蓝桥杯题库 算法提高非vip部分（C++、Java）代码实现（251-280）
文章目录
-
- ADV-251 Petri Net Simulation
-
- cpp:
- java:
- ADV-252 Navigation
-
- cpp:
- ADV-256 The Sky is the Limit
-
- cpp:
- java:
- ADV-264 Degrees of Separation
-
- cpp:
- java:
- ADV-265 Cutting Chains
-
- cpp:
- java:
- ADV-270 Flight Planning
-
- cpp:
- java:
- ADV-271 Stacking Plates
-
- cpp:
- ADV-275 JOE的算数
-
- cpp:
- java:
- ADV-276 Raising the Roof
- ADV-277 The Islands
-
- cpp:
- ADV-278 歌唱比赛
-
- cpp:
- java:
- ADV-279 矩阵乘法
-
- cpp:
- java:
将定期更新蓝桥杯习题集的解题报告~
ADV-251 Petri Net Simulation
cpp:
#include java:
import java.util.*;
public class Main {
static int np, nt, nf;
static int p[], in[][], out[][];
static int cur;
static int enabled() {
for(int i=0; i<nt; i++) {
boolean flag = true;
for(int j=0; j<np; j++)
if(p[j] < in[i][j]) {
flag = false;
break;
}
if(flag)
return i;
}
return -1;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = 0;
while(true) {
t++;
cur = 0;
np = sc.nextInt();
if(np==0)
break;
p = new int[np];
for(int i=0; i<np; i++) {
p[i] = sc.nextInt();
}
nt = sc.nextInt();
in = new int[nt][np];
out = new int[nt][np];
for(int i=0; i<nt; i++) {
for(int j=0; ; j++) {
int n = sc.nextInt();
if(n==0)
break;
else if(n<0)
in[i][-n-1] ++;
else
out[i][n-1] ++;
}
}
nf = sc.nextInt();
while(true) {
int n = enabled();
if(n==-1||cur==nf)
break;
for(int j=0; j<np; j++) {
p[j] -= in[n][j];
p[j] += out[n][j];
}
cur++;
}
if(enabled()!=-1) {
System.out.println("Case "+t+": still live after "+cur+" transitions");
}else {
System.out.println("Case "+t+": dead after "+cur+" transitions");
}
System.out.print("Places with tokens:");
for(int i=0; i<np; i++) {
if(p[i]>=1)
System.out.print(" "+(i+1)+" ("+p[i]+")");
}
System.out.println("\n");
}
}
}
ADV-252 Navigation
cpp:
#include ADV-256 The Sky is the Limit
cpp:
#include java:
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner read = new Scanner(System.in);
int N = read.nextInt();
double num[][] = new double[N][3];
List<Mon> liss = new ArrayList<Mon>();
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++)
num[i][j] = read.nextDouble();
}
Line l[] = new Line[N];
List<Node> list = new ArrayList<Node>();
for (int i = 0; i < N; i++) {
Line li = new Line();
double x1 = num[i][0] - num[i][2] / 2;
double x2 = num[i][0];
double y2 = num[i][1];
double x3 = num[i][0] + num[i][2] / 2;
li.k1 = (y2 / (x2 - x1));
li.b1 = x1 * y2 / (x1 - x2);
li.k2 = (y2 / (x2 - x3));
li.b2 = x3 * y2 / (x3 - x2);
l[i] = li;
list.add(new Node(x1, 0));
list.add(new Node(x2, y2));
list.add(new Node(x3, 0));
liss.add(new Mon(x2, y2, li));
}
Collections.sort(liss);
for (int i = 0; i < N - 1; i++) {
Mon n1 = liss.get(i);
for (int j = i + 1; j < N; j++) {
Mon n2 = liss.get(j);
Line l1 = n1.l;
Line l2 = n2.l;
try {
l1.x = (l2.b1 - l1.b1) / (l1.k1 - l2.k1);
l1.y = l1.k1 * l1.x + l1.b1;
if (l1.y >= 0 && l1.y <= n1.y && l1.y <= n2.y) {
list.add(new Node(l1.x, l1.y));
}
} catch (Exception e) {
}
try {
l1.x = (l2.b1 - l1.b2) / (l1.k2 - l2.k1);
l1.y2 = l1.k2 * l1.x + l1.b2;
if (l1.y2 >= 0 && l1.y2 <= n1.y && l1.y2 <= n2.y) {
list.add(new Node(l1.x, l1.y2));
}
} catch (Exception e) {
}
try {
l1.x = (l2.b2 - l1.b2) / (l1.k2 - l2.k2);
l1.y2 = l1.k2 * l1.x + l1.b2;
if (l1.y2 >= 0 && l1.y2 <= n1.y && l1.y2 <= n2.y) {
list.add(new Node(l1.x, l1.y2));
}
} catch (Exception e) {
}
}
}
Collections.sort(list);
for (int i = 0; i < list.size(); i++) {
Node n = list.get(i);
}
double sum = 0;
for (int i = 0; i < list.size() - 1; i++) {
Node n1 = list.get(i);
Node n2 = list.get(i + 1);
double x = (n2.x - n1.x) / 2 + n1.x;
int ind = 0;
int ind2 = 0;
double max = 0;
for (int j = 0; j < liss.size(); j++) {
Mon m = liss.get(j);
m.l.x = x;
if (n2.x <= m.x) {
m.l.y = m.l.k1 * m.l.x + m.l.b1;
if (m.l.y > max) {
ind = j;
ind2 = 0;
max = m.l.y;
}
} else {
m.l.y2 = m.l.k2 * m.l.x + m.l.b2;
if (m.l.y2 > max) {
ind = j;
ind2 = 1;
max = m.l.y2;
}
}
}
Mon m = liss.get(ind);
if (max == 0)
continue;
double y1 = 0, y2 = 0;
if (ind2 == 0) {
m.l.x = n1.x;
m.l.y = m.l.k1 * m.l.x + m.l.b1;
y1 = m.l.y;
m.l.x = n2.x;
m.l.y = m.l.k1 * m.l.x + m.l.b1;
y2 = m.l.y;
sum += Math.sqrt(Math.pow(n2.x - n1.x, 2) + Math.pow(y1 - y2, 2));
} else {
m.l.x = n1.x;
m.l.y2 = m.l.k2 * m.l.x + m.l.b2;
y1 = m.l.y2;
m.l.x = n2.x;
m.l.y2 = m.l.k2 * m.l.x + m.l.b2;
y2 = m.l.y2;
sum += Math.sqrt(Math.pow(n2.x - n1.x, 2) + Math.pow(y1 - y2, 2));
}
}
System.out.println(String.format("%.0f", sum));
}
}
class Mon implements Comparable<Mon> {
Line l;
double x;
double y;
public Mon(double x, double y, Line l) {
super();
this.x = x;
this.y = y;
this.l = l;
}
@Override
public int compareTo(Mon o) {
// TODO Auto-generated method stub
return (int) (this.x - o.x);
}
}
class Line {
double x;
double k1, b1, k2, b2;
double y;
double y2;
}
class Node implements Comparable<Node> {
double x;
double y;
public Node(double x, double y) {
super();
this.x = x;
this.y = y;
}
@Override
public int compareTo(Node o) {
// TODO Auto-generated method stub
return (int) (this.x * 1000 - o.x * 1000);
}
}
ADV-264 Degrees of Separation
cpp:
#include java:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.StringTokenizer;
class R{
static BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer tokenizer=new StringTokenizer("");
static String nextLine() throws IOException {
return reader.readLine();
}
static String next() throws IOException {
while(!tokenizer.hasMoreTokens()) {
tokenizer=new StringTokenizer(reader.readLine());
}
return tokenizer.nextToken();
}
static int nextInt() throws NumberFormatException, IOException {
return Integer.parseInt(next());
}
static Double nextDouble() throws NumberFormatException, IOException {
return Double.parseDouble(next());
}
}
public class Main {
//static Scanner cin=new Scanner(System.in);
static int p,r;
static String s[]=new String[300];
static int len[][]=new int[55][55];
static String q;
static Map mp=new HashMap<String, Integer>();
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
int cas=1;
while(true) {
p=R.nextInt();
r=R.nextInt();
if(p==0&&r==0) break;
mp.clear();
int cnt=1;
for(int i=1;i<=p;i++) {
for(int j=1;j<=p;j++) {
len[i][j]=1000000000;
}
len[i][i]=0;
}
for(int i=0;i<r;i++) {
String a,b;
a=R.next();
b=R.next();
if(mp.containsKey(a)==false) {
mp.put(a, cnt);
cnt++;
}
if(mp.containsKey(b)==false) {
mp.put(b, cnt);
cnt++;
}
len[(int) mp.get(a)][(int) mp.get(b)]=1;
len[(int) mp.get(b)][(int) mp.get(a)]=1;
}
int ans=0;
for(int i=1;i<=p;i++) {
for(int j=1;j<=p;j++) {
for(int k=1;k<=p;k++) {
len[j][k]=Math.min(len[j][k],len[j][i]+len[i][k]);
}
}
}
for(int i=1;i<=p;i++) {
for(int j=1;j<=p;j++) {
ans=Math.max(ans, len[i][j]);
}
}
if(ans==1000000000) System.out.println("Network "+cas+": DISCONNECTED");
else System.out.println("Network "+cas+": "+ans);
System.out.println();
cas++;
}
}
}
ADV-265 Cutting Chains
cpp:
#include java:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class Main {
static int INF =0x3f3f3f3f;
static int vis[] = new int[20];
static int g[][] = new int[20][20];
static int n, cn;
static StreamTokenizer in;
static void init() throws IOException {
int a = 0, b = 0;
g = new int[20][20];
while (true) {
in.nextToken();
a=(int) in.nval;
in.nextToken();
b=(int) in.nval;
if( a == -1 && b == -1)
break;
g[a - 1][b - 1] = g[b - 1][a - 1] = 1;
}
}
static boolean two(int s) {
for (int i = 0; i < n; i++) {
if ((s&(1<<i))!=0) continue;
int num = 0;
for (int j = 0; j < n; j++) {
if ((s&(1<<j))!=0) continue;
if (g[i][j]!=0) num++;
}
if (num > 2) return true;
}
return false;
}
static boolean dfs(int s, int now, int fa) {
vis[now] = 1;
for (int i = 0; i < n; i++) {
if (!(g[now][i]!=0) || (s&(1<<i))!=0 || i == fa) continue;
if (vis[i]!=0) return true;
if (dfs(s, i, now)) return true;
}
return false;
}
static boolean circle(int s) {
for (int i = 0; i < n; i++) {
if (vis[i]!=0|| (s&(1<<i))!=0) continue;
cn++;
if (dfs(s, i, -1)) return true;
}
return false;
}
static int cal(int s) {
return s == 0 ? 0 : cal(s / 2) + (s&1);
}
static int solve() {
int ans = INF;
int s = (1<<n);
for (int i = 0; i < s; i++) {
cn = 0;
vis = new int[20];
if(two(i) || circle(i)) continue;
if (cal(i) >= cn - 1)
ans = Math.min(cal(i), ans);
}
return ans;
}
public static void main(String[] args) throws IOException {
in= new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
int cas = 0;
while (true) {
in.nextToken();
n=(int) in.nval;
if(n==0)
break;
init();
System.out.println("Set "+ ++cas+": Minimum links to open is "+solve());
}
}
}
ADV-270 Flight Planning
cpp:
#include java:
import java.util.*;
public class Main {
static Scanner sc=new Scanner(System.in);
static int V=400;
static int GP=2000,GE=10,C=50;
static int A=30;
static double dp[][];
static int m[][]; //记忆前一段的高度
static int Arr[][]; //A[i][0]记录最低点风速 A[i][1]记录最高点风速
static int H[]; //长度数组
static int K; //个数
static void init() {
//没问题
K=sc.nextInt();
H=new int[K+1];
dp=new double[K+1][21];
m=new int[K+1][21];
Arr=new int[K+1][2];
for(int i=1;i<=K;i++) {
H[i]=sc.nextInt();
Arr[i][0]=sc.nextInt();
Arr[i][1]=sc.nextInt();
}
for(int j=0;j<=20;j++) {
dp[0][j]=C*(j+20);
}
}
public static void main(String[] args) {
int n=sc.nextInt();
for(int i=1;i<=n;i++) {
init();
for(int k=1;k<=K;k++)
for(int j=0;j<=20;j++)
getDP(k,j);
double min=1000000000;
int p=-1;
for(int j=0;j<=20;j++) {
if(dp[K][j]<min) {
min=dp[K][j];
p=j;
}
}
print(p,i);
System.out.println((int)Math.ceil(min));
}
}
static void print(int k,int j) {
int arr[]=new int[K];
int p=k;
for(int i=K;i>=1;i--) {
arr[i-1]=k=m[i][k];
}
System.out.print("Flight "+j+": ");
for(int i=1;i<K;i++) {
System.out.print(arr[i]+20+" ");
}
System.out.print((p+20)+" ");
}
static void getDP(int i,int j) {
//
double min=100000000;
for(int k=0;k<=20;k++) {
double num=dp[i-1][k];
if(k<j)
num+=50*(j-k);
if(min>num) {
m[i][j]=k;
min=num;
}
}
min+=getHY(i,j);
dp[i][j]=min;
//System.out.println(i+" "+j+" "+dp[i][j]);
}
static double getHY(int i,int h) {
//第i段航线高度为h的耗油数 没问题
//System.out.println("第"+i+"段，风速为："+(V+getV(i,h))+" 高度为："+h+" 耗油数为："+getY(h)+" 总耗油为："+(H[i]*getY(h)/(V+getV(i,h))));
return H[i]*getY(h)/(V+getV(i,h));
}
static double getY(int h) {
return 2000+Math.abs(10-h)*10;
}
static double getV(int i,int x) {
//得到第i段航路高度为x的风速
return (double)(Arr[i][1]-Arr[i][0])*x/20+Arr[i][0];
}
}
ADV-271 Stacking Plates
cpp:
#include ADV-275 JOE的算数
cpp:
#include java:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a=sc.nextLong();
int b=sc.nextInt();
int c=sc.nextInt();
long res=1;
while (b!=0) {
if ((b&1)==1) {
res=(res*a)%c;
}
a=(a*a)%c;
b>>=1;
}
System.out.println(res);
}
}
ADV-276 Raising the Roof
暂时未通过
ADV-277 The Islands
cpp:
#include ADV-278 歌唱比赛
cpp:
#include java:
import java.text.DecimalFormat;
import java.util.*;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner reader = new Scanner(System.in);
DecimalFormat df = new DecimalFormat("#.0");
int n;
n = reader.nextInt();
int a,b,c,d;
double[] sum = new double[n];
for(int i=0;i<n;i++){
a = reader.nextInt();
b = reader.nextInt();
c = reader.nextInt();
d = reader.nextInt();
sum[i] = 0.7*a+0.2*b+0.1*c+d;
if(sum[i] > 100)
sum[i] = 100;
}
for(int i=0;i<n;i++)
System.out.print(df.format(sum[i])+"\n");
//System.out.print(String.format("%.1f", sum));
}
}
ADV-279 矩阵乘法
cpp:
#include java:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int mar1[][] = new int[n][m];
int mar2[][] = new int[m][k];
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
mar1[i][j] = sc.nextInt();
}
}
for(int i=0;i<m;i++) {
for(int j=0;j<k;j++) {
mar2[i][j] = sc.nextInt();
}
}
int ans[][] = new int[n][k];
for(int i=0;i<n;i++) {
for(int j=0;j<k;j++) {
for(int t=0;t<m;t++) {
ans[i][j] += mar1[i][t]*mar2[t][j];
}
System.out.print(ans[i][j]+" ");
}
System.out.println();
}
}
}