1013. Battle Over Cities (25)
来源:互联网 发布:新网域名转万网 编辑:程序博客网 时间:2024/06/05 20:02
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other highways to keep the rest of the cities connected. Given the map of cities which have all the remaining highways marked, you are supposed to tell the number of highways need to be repaired, quickly.
For example, if we have 3 cities and 2 highways connecting city1-city2 and city1-city3. Then if city1 is occupied by the enemy, we must have 1 highway repaired, that is the highway city2-city3.
Input
Each input file contains one test case. Each case starts with a line containing 3 numbers N (<1000), M and K, which are the total number of cities, the number of remaining highways, and the number of cities to be checked, respectively. Then M lines follow, each describes a highway by 2 integers, which are the numbers of the cities the highway connects. The cities are numbered from 1 to N. Finally there is a line containing K numbers, which represent the cities we concern.
Output
For each of the K cities, output in a line the number of highways need to be repaired if that city is lost.
Sample Input3 2 31 21 31 2 3Sample Output
100
思路:用而为数组存储图的信息,既哪些城市相连,某个城市被破坏,将数组里所有与它相连的值置为false,然后深度优先遍历此时的图,判断分为了几个独立的部分即可。
脑子卡了一下,数组直接赋值是共享同一个内存的,所以要单独写个函数挨个赋值。代码最后一组数据超时,优化中。。
代码:
import java.io.*;import java.util.ArrayList;import java.util.HashSet;public class Main { static int cnum,wnum;static boolean[][]map;static boolean[]vis;static ArrayList<Integer>check = new ArrayList();static void dfs(boolean[][]m,boolean[]v,int c,ArrayList<Integer>a){ for(int i=1;i<=cnum;i++){ if(!v[i] && m[c][i]){ v[i] = true; a.add(i); dfs(m,v,i,a); } }}static int map_num(boolean[][]m,boolean[]v){ int num = 0; ArrayList<Integer>al = new ArrayList(); for(int i=1;i<=cnum;i++){ if(!v[i]){ al.add(i); v[i] = true; dfs(m,v,i,al); num++; if(al.size()>=cnum){ break; } } } return num-2;}static void destroy(boolean[][]m,int c){ for(int i=1;i<=cnum;i++){ if(i == c)continue; m[c][i] = false; m[i][c] = false; }}static boolean[][]copy(boolean[][]m){ boolean[][]c = new boolean[m.length][m[0].length]; for(int i=0;i<m.length;i++){ for(int j=0;j<m[i].length;j++){ c[i][j] = m[i][j]; } } return c;}static boolean[]copya(boolean[]v){ boolean[]vv = new boolean[v.length]; for(int i=0;i<v.length;i++){ vv[i] = v[i]; } return vv;} public static void main(String[] args) throws IOException { // TODO Auto-generated method stub BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[]in = br.readLine().split(" "); cnum = Integer.parseInt(in[0]); wnum = Integer.parseInt(in[1]); map = new boolean[cnum+1][cnum+1]; vis = new boolean[cnum+1]; for(int i=1;i<=cnum;i++){ vis[i] = false; for(int j=1;j<=cnum;j++){ if(i == j)map[i][j] = true; else map[i][j] = false; } } for(int i=0;i<wnum;i++){ in = br.readLine().split(" "); int c1 = Integer.parseInt(in[0]); int c2 = Integer.parseInt(in[1]); map[c1][c2] = true; map[c2][c1] = true; } in = br.readLine().split(" "); for(int x=0;x<in.length;x++){ boolean[][]m = copy(map); boolean[]v = copya(vis); int c = Integer.parseInt(in[x]); destroy(m,c); System.out.println(map_num(m,v)); } }}
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- json字符串
- MaxCompute SQL原理解析及性能调优
- 【技术】【总结】git配合gerrit使用的一些总结
- VS+CMake+opencv3+opencv_contrib
- 解读tensorflow之rnn
- 1013. Battle Over Cities (25)
- java 的 && 和 & 、|| 和 | 区别
- gradle扩展属性、任务与构建周期
- DLL入门:C#调用C++ DLL例子
- MyBatis 动态SQL
- centos7环境下编译bitcoin
- find your present (2)
- MapReduce实战练习四:找出共同好友
- 电磁兼容设计中,有关旁路电容和耦合电容学习 从电路来说,总是存在驱动的源和被驱动的负载。如果负载电容比较大,驱动电路要把电容充电、放电,才能完成信号的跳变,在上升沿比较陡峭的时候,电流比较大,这样驱动