結果

問題 No.416 旅行会社
ユーザー tanzakutanzaku
提出日時 2016-08-26 22:36:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,182 ms / 4,000 ms
コード長 7,362 bytes
コンパイル時間 2,668 ms
コンパイル使用メモリ 88,844 KB
実行使用メモリ 87,644 KB
最終ジャッジ日時 2024-05-08 14:54:50
合計ジャッジ時間 15,704 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 494 ms
68,448 KB
testcase_01 AC 57 ms
37,412 KB
testcase_02 AC 56 ms
37,508 KB
testcase_03 AC 56 ms
37,472 KB
testcase_04 AC 56 ms
37,232 KB
testcase_05 AC 57 ms
37,496 KB
testcase_06 AC 57 ms
37,420 KB
testcase_07 AC 78 ms
38,160 KB
testcase_08 AC 117 ms
40,272 KB
testcase_09 AC 184 ms
42,372 KB
testcase_10 AC 544 ms
68,952 KB
testcase_11 AC 549 ms
72,360 KB
testcase_12 AC 535 ms
68,596 KB
testcase_13 AC 497 ms
69,144 KB
testcase_14 AC 1,170 ms
81,720 KB
testcase_15 AC 1,182 ms
85,444 KB
testcase_16 AC 1,120 ms
87,368 KB
testcase_17 AC 1,138 ms
87,644 KB
testcase_18 AC 1,130 ms
87,468 KB
testcase_19 AC 928 ms
76,164 KB
testcase_20 AC 805 ms
68,492 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int n = io.nextInt();
			int m = io.nextInt();
			int Q = io.nextInt();
			long[] es = new long[m];
			long[] d = new long[Q];
			TreeSet<Long> set = new TreeSet<>();
			UnionFind uf = new UnionFind(n);
			for(int i = 0; i < m; i++) {
				es[i] = io.nextLong() << 32 | io.nextLong();
			}
			for(int i = 0; i < Q; i++) {
				long a = io.nextLong();
				long b = io.nextLong();
				d[i] = a << 32 | b;
				set.add(a << 32 | b);
				set.add(a | b << 32);
			}
			for(long e : es) if(!set.contains(e)) {
				long a = e & 0xFFFFFFFFL;
				long b = e >>> 32;
				uf.union((int)a - 1, (int)b - 1);
			}
			int[] ans = new int[n-1];
			for(int i = 1; i < n; i++) {
				if(uf.same(i, 0)) {
					ans[i-1] = -1;
				}
			}
			for(int i = Q - 1; i >= 0; i--) {
				long a = d[i] & 0xFFFFFFFFL;
				long b = d[i] >>> 32;
				int aa = (int)a - 1;
				int bb = (int)b - 1;
				if(!uf.same(aa, bb)) {
					int con = -1;
					if(uf.same(0, aa)) con = bb;
					else if(uf.same(0, bb)) con = aa;
					if(con != -1) {
						for(int idx = uf.root(con); idx != -1; idx = uf.next[idx]) {
							ans[idx - 1] = i + 1;
						}
					}
					uf.union(aa, bb);
				}
			}
			for(int x : ans) {
				io.out.println(x);
			}
		}
	}
	
	static
	class UnionFind {
		private int[] data;
		private int[] next;
		private int[] last;
		
		public UnionFind(int size) {
			data = new int[size];
			next = new int[size];
			last = new int[size];
			clear();
		}
		
		public UnionFind(final UnionFind uf) {
			data = uf.data.clone();
			next = uf.next.clone();
			last = uf.last.clone();
		}
		
		public void clear() {
			Arrays.fill(data, -1);
			Arrays.fill(next, -1);
			for(int i = 0; i < last.length; i++) {
				last[i] = i;
			}
		}
		
		public int root(int x) { return data[x] < 0 ? x : (data[x] = root(data[x])); }
		
		public void union(int x, int y) {
			if((x = root(x)) != (y = root(y))) {
				if(data[y] < data[x]) { final int t = x; x = y; y = t; }
				next[last[x]] = y;
				last[x] = last[y];
				data[x] += data[y];
				data[y] = x;
			}
		}
		
		public boolean same(int x, int y) { return root(x) == root(y); }
		public int size(int x) { return -data[root(x)]; }
	}

	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0