結果
| 問題 |
No.416 旅行会社
|
| コンテスト | |
| ユーザー |
 hiro116s
|
| 提出日時 | 2016-08-26 23:36:24 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,279 ms / 4,000 ms |
| コード長 | 6,240 bytes |
| コンパイル時間 | 2,880 ms |
| コンパイル使用メモリ | 92,748 KB |
| 実行使用メモリ | 101,844 KB |
| 最終ジャッジ日時 | 2024-12-14 19:54:59 |
| 合計ジャッジ時間 | 17,903 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 21 |
ソースコード
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
public class Main {
InputStream is;
int __t__ = 1;
int __f__ = 0;
int __FILE_DEBUG_FLAG__ = __f__;
String __DEBUG_FILE_NAME__ = "src/D2";
FastScanner in;
PrintWriter out;
class UnionFindTree {
int[] parent;
int[] size;
public UnionFindTree(int n) {
parent = new int[n];
size = new int[n];
init();
}
public void init() {
for (int i = 0; i < parent.length; i++) {
parent[i] = i;
size[i] = 1;
}
}
public int find(int x) {
if (parent[x] == x) return x;
return parent[x] = find(parent[x]);
}
public boolean same(int x, int y) {
return find(x) == find(y);
}
public void unite(int x, int y) {
int xx = find(x), yy = find(y);
if (xx == yy) return;
parent[xx] = yy;
size[yy] += size[xx];
}
public int getSize(int x) {
return size[find(x)];
}
public String toString() {
String res = "";
res += Arrays.toString(parent) + "\n";
res += Arrays.toString(size);
return res;
}
}
int MAX = 500100;
long toKey(int a, int b) {
if (a > b) {
int tmp = a;
a = b;
b = tmp;
}
return (long) a * MAX + b;
}
int[] res;
ArrayList<Integer>[] g;
void dfs(int turn, int u, UnionFindTree uft) {
res[u] = turn;
for (int v : g[u]) {
if (uft.same(0, v) && res[v] == 0) dfs(turn, v, uft);
}
}
public void solve() {
int N = in.nextInt(), M = in.nextInt(), Q = in.nextInt();
int[] A = new int[M];
int[] B = new int[M];
int[] C = new int[Q];
int[] D = new int[Q];
HashSet<Long> hash = new HashSet<>();
g = new ArrayList[N];
for (int i = 0; i < N; i++)
g[i] = new ArrayList<Integer>();
for (int i = 0; i < M; i++) {
A[i] = in.nextInt() - 1;
B[i] = in.nextInt() - 1;
g[A[i]].add(B[i]);
g[B[i]].add(A[i]);
}
for (int i = 0; i < Q; i++) {
C[i] = in.nextInt() - 1;
D[i] = in.nextInt() - 1;
hash.add(toKey(C[i], D[i]));
}
UnionFindTree uft = new UnionFindTree(N);
for (int i = 0; i < M; i++) {
if (!hash.contains(toKey(A[i], B[i])))
uft.unite(A[i], B[i]);
}
res = new int[N];
for (int i = 0; i < N; i++) {
res[i] = uft.same(0, i) ? -1 : 0;
}
for (int q = Q - 1; q >= 0; q--) {
boolean can1 = uft.same(0, C[q]);
boolean can2 = uft.same(0, D[q]);
uft.unite(C[q], D[q]);
if (!can1 && uft.same(0, C[q]))
dfs(q + 1, C[q], uft);
if (!can2 && uft.same(0, D[q]))
dfs(q + 1, D[q], uft);
}
for (int i = 1; i < N; i++)
out.println(res[i]);
out.close();
}
public void run() {
if (__FILE_DEBUG_FLAG__ == __t__) {
try {
is = new FileInputStream(__DEBUG_FILE_NAME__);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
System.out.println("FILE_INPUT!");
} else {
is = System.in;
}
in = new FastScanner(is);
out = new PrintWriter(System.out);
Thread t = new Thread(null, new Runnable() {
@Override
public void run() {
solve();
}
}, "lul", 1 << 27);
t.start();
}
public static void main(String[] args) {
new Main().run();
}
public void mapDebug(int[][] a) {
System.out.println("--------map display---------");
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
System.out.printf("%3d ", a[i][j]);
}
System.out.println();
}
System.out.println("----------------------------");
System.out.println();
}
public void debug(Object... obj) {
System.out.println(Arrays.deepToString(obj));
}
class FastScanner {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
public FastScanner(InputStream stream) {
this.stream = stream;
//stream = new FileInputStream(new File("dec.in"));
}
int read() {
if (numChars == -1)
throw new InputMismatchException();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0)
return -1;
}
return buf[curChar++];
}
boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
boolean isEndline(int c) {
return c == '\n' || c == '\r' || c == -1;
}
int nextInt() {
return Integer.parseInt(next());
}
int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++)
array[i] = nextInt();
return array;
}
int[][] nextIntMap(int n, int m) {
int[][] map = new int[n][m];
for (int i = 0; i < n; i++) {
map[i] = in.nextIntArray(m);
}
return map;
}
long nextLong() {
return Long.parseLong(next());
}
long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++)
array[i] = nextLong();
return array;
}
long[][] nextLongMap(int n, int m) {
long[][] map = new long[n][m];
for (int i = 0; i < n; i++) {
map[i] = in.nextLongArray(m);
}
return map;
}
double nextDouble() {
return Double.parseDouble(next());
}
double[] nextDoubleArray(int n) {
double[] array = new double[n];
for (int i = 0; i < n; i++)
array[i] = nextDouble();
return array;
}
double[][] nextDoubleMap(int n, int m) {
double[][] map = new double[n][m];
for (int i = 0; i < n; i++) {
map[i] = in.nextDoubleArray(m);
}
return map;
}
String next() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
String[] nextStringArray(int n) {
String[] array = new String[n];
for (int i = 0; i < n; i++)
array[i] = next();
return array;
}
String nextLine() {
int c = read();
while (isEndline(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isEndline(c));
return res.toString();
}
}
}