結果

問題 No.416 旅行会社
ユーザー 37zigen37zigen
提出日時 2016-08-28 04:02:34
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,977 bytes
コンパイル時間 4,073 ms
コンパイル使用メモリ 80,192 KB
実行使用メモリ 71,296 KB
最終ジャッジ日時 2024-04-26 07:33:42
合計ジャッジ時間 22,433 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 756 ms
57,920 KB
testcase_01 AC 52 ms
37,160 KB
testcase_02 AC 53 ms
36,892 KB
testcase_03 AC 57 ms
37,160 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 912 ms
61,444 KB
testcase_11 AC 892 ms
61,556 KB
testcase_12 AC 937 ms
61,840 KB
testcase_13 AC 713 ms
58,036 KB
testcase_14 AC 1,620 ms
69,480 KB
testcase_15 AC 1,616 ms
69,076 KB
testcase_16 AC 1,742 ms
70,968 KB
testcase_17 AC 1,784 ms
70,308 KB
testcase_18 AC 1,662 ms
69,964 KB
testcase_19 WA -
testcase_20 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package No400番台;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;

public class Q416_2 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";

	void solver() {
		int N = ni(), M = ni(), Q = ni();
		long[] list = new long[M];
		long[][] nt = new long[M][2];
		for (int i = 0; i < M; i++) {
			list[i] = (long) (ni() - 1) << 32 | ni() - 1;
		}
		Arrays.sort(list);
		for (int i = 0; i < M; i++) {
			nt[i][0] = list[i];
			nt[i][1] = Q + 1;
		}
		for (int i = 0; i < Q; i++) {
			int idx = Arrays.binarySearch(list, (long) (ni() - 1) << 32 | ni() - 1);
			nt[idx][1] = i + 1;
		}
		Arrays.sort(nt, new Comparator<long[]>() {
			@Override
			public int compare(long[] o1, long[] o2) {
				return -Long.compare(o1[1], o2[1]);
			}
		});
		int[] ret = new int[N];
		Arrays.fill(ret, -1);
		DJSet ds = new DJSet(N);
		for (int i = 0; i < M; i++) {
			long idx = nt[i][0];
			int x = (int) (idx >> 32), y = (int) (idx);
			if (ds.equiv(x, y)) {
				continue;
			} else if (ds.equiv(x, 0)) {
				for (int r = ds.root(y); -1 != r; r = ds.next[r]) {
					ret[r] = (int) nt[i][1];
				}
			} else if (ds.equiv(y, 0)) {
				for (int r = ds.root(x); -1 != r; r = ds.next[r]) {
					ret[r] = (int) nt[i][1];
				}
			}
			ds.setUnion(x, y);
		}
		for (int i = 1; i < N; i++) {
			System.out.println(ret[i] == Q + 1 ? -1 : ret[i]);
		}

	}

	public static class DJSet {
		int n;
		int[] d;
		int[] next;
		int[] last;

		DJSet(int n) {
			this.n = n;
			d = new int[n];
			next = new int[n];
			last = new int[n];
			Arrays.fill(d, -1);
			Arrays.fill(next, -1);
			for (int i = 0; i < n; i++) {
				last[i] = i;
			}
		}

		int root(int x) {
			return d[x] < 0 ? x : (d[x] = root(d[x]));
		}

		boolean setUnion(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (d[y] < d[x]) {
					int d = x;
					x = y;
					y = d;
				}
				d[x] += d[y];
				d[y] = x;
				next[last[x]] = y;
				last[x] = last[y];
			}
			return x != y;
		}

		boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		int size(int x) {
			return d[root(x)] * (-1);
		}

		int count() {
			int ct = 0;
			for (int u : d) {
				if (u < 0)
					ct++;
			}
			return ct;
		}
	}

	public static void main(String[] args) throws Exception {
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		new Q416_2().solver();
		out.flush();
	}

	static long nl() {
		try {
			long num = 0;
			boolean minus = false;
			while ((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'))
				;
			if (num == '-') {
				num = 0;
				minus = true;
			} else {
				num -= '0';
			}

			while (true) {
				int b = is.read();
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static char nc() {
		try {
			int b = skip();
			if (b == -1)
				return 0;
			return (char) b;
		} catch (IOException e) {
		}
		return 0;
	}

	static double nd() {
		try {
			return Double.parseDouble(ns());
		} catch (Exception e) {
		}
		return 0;
	}

	static String ns() {
		try {
			int b = skip();
			StringBuilder sb = new StringBuilder();
			if (b == -1)
				return "";
			sb.append((char) b);
			while (true) {
				b = is.read();
				if (b == -1)
					return sb.toString();
				if (b <= ' ')
					return sb.toString();
				sb.append((char) b);
			}
		} catch (IOException e) {
		}
		return "";
	}

	public static char[] ns(int n) {
		char[] buf = new char[n];
		try {
			int b = skip(), p = 0;
			if (b == -1)
				return null;
			buf[p++] = (char) b;
			while (p < n) {
				b = is.read();
				if (b == -1 || b <= ' ')
					break;
				buf[p++] = (char) b;
			}
			return Arrays.copyOf(buf, p);
		} catch (IOException e) {
		}
		return null;
	}

	public static byte[] nse(int n) {
		byte[] buf = new byte[n];
		try {
			int b = skip();
			if (b == -1)
				return null;
			is.read(buf);
			return buf;
		} catch (IOException e) {
		}
		return null;
	}

	static int skip() throws IOException {
		int b;
		while ((b = is.read()) != -1 && !(b >= 33 && b <= 126))
			;
		return b;
	}

	static boolean eof() {
		try {
			is.mark(1000);
			int b = skip();
			is.reset();
			return b == -1;
		} catch (IOException e) {
			return true;
		}
	}

	static int ni() {
		try {
			int num = 0;
			boolean minus = false;
			while ((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'))
				;
			if (num == '-') {
				num = 0;
				minus = true;
			} else {
				num -= '0';
			}

			while (true) {
				int b = is.read();
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

}
0