結果

問題 No.416 旅行会社
コンテスト
ユーザー 37zigen
提出日時 2016-08-28 04:21:02
言語 Java
(openjdk 23)
結果
MLE  
実行時間 -
コード長 4,823 bytes
コンパイル時間 4,383 ms
コンパイル使用メモリ 90,224 KB
実行使用メモリ 835,372 KB
最終ジャッジ日時 2024-11-09 00:28:35
合計ジャッジ時間 9,178 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other MLE * 1 -- * 20
権限があれば一括ダウンロードができます

ソースコード

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;
import java.util.InputMismatchException;

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, 0);
		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(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;
		}
	}

	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		long s = System.currentTimeMillis();
		solver();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
	public static void main(String[] args) throws Exception { new Q416_2().run(); }

	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;

	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}

	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }

	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}

	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}

	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}

	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

}
0