#113179 (Java21) No.416 旅行会社

提出ソース

結果

問題	No.416 旅行会社
ユーザー	uwi
提出日時	2016-08-27 00:26:39
言語	Java21 (openjdk 21)
結果	AC
実行時間	995 ms / 4,000 ms
コード長	6,580 bytes
コンパイル時間	5,007 ms
コンパイル使用メモリ	87,512 KB
実行使用メモリ	58,124 KB
最終ジャッジ日時	2023-08-21 09:45:59
合計ジャッジ時間	15,503 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	328 ms 47,272 KB
testcase_01	AC	48 ms 35,096 KB
testcase_02	AC	51 ms 34,752 KB
testcase_03	AC	48 ms 35,156 KB
testcase_04	AC	50 ms 34,904 KB
testcase_05	AC	50 ms 35,240 KB
testcase_06	AC	51 ms 35,264 KB
testcase_07	AC	57 ms 35,476 KB
testcase_08	AC	89 ms 37,284 KB
testcase_09	AC	140 ms 39,344 KB
testcase_10	AC	311 ms 47,136 KB
testcase_11	AC	296 ms 49,212 KB
testcase_12	AC	314 ms 47,960 KB
testcase_13	AC	306 ms 48,812 KB
testcase_14	AC	916 ms 58,124 KB
testcase_15	AC	949 ms 56,592 KB
testcase_16	AC	954 ms 56,792 KB
testcase_17	AC	995 ms 57,032 KB
testcase_18	AC	968 ms 56,604 KB
testcase_19	AC	597 ms 51,972 KB
testcase_20	AC	583 ms 52,452 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package q4xx;

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 N416 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni(), Q = ni();
		long[] es = new long[m];
		for(int i = 0;i < m;i++){
			es[i] = (long)ni()-1<<32|(long)ni()-1;
		}
		es = radixSort(es);
		int[] time = new int[m];
		Arrays.fill(time, m+2);
		for(int i = 0;i < Q;i++){
			long code = (long)ni()-1<<32|(long)ni()-1;
			int ind = Arrays.binarySearch(es, code);
			time[ind] = i+1;
		}
		long[][] ees = new long[m][];
		for(int i = 0;i < m;i++){
			ees[i] = new long[]{es[i], time[i]};
		}
		Arrays.sort(ees, new Comparator<long[]>() {
			public int compare(long[] a, long[] b) {
				return -Long.compare(a[1], b[1]);
			}
		});
		
		int[] ret = new int[n];
		DisjointSetOfList ds = new DisjointSetOfList(n);
		for(int i = 0;i < m;i++){
			int f = (int)(ees[i][0]>>>32);
			int t = (int)(ees[i][0]);
			if(ds.equiv(f, t))continue;
			if(ds.equiv(f, 0)){
				for(int r = ds.root(t);r != -1;r = ds.next[r]){
					ret[r] = (int)ees[i][1];
				}
			}else if(ds.equiv(t, 0)){
				for(int r = ds.root(f);r != -1;r = ds.next[r]){
					ret[r] = (int)ees[i][1];
				}
			}
			ds.union(f, t);
		}
		for(int i = 1;i < n;i++){
			if(ret[i] == m+2)ret[i] = -1;
			out.println(ret[i]);
		}
	}
	
	public static class DisjointSetOfList {
		public int[] upper;
		public int[] next;
		public int[] last;

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

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

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

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

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

	
	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

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

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

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

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

	
	public static long[] radixSort(long[] f)
	{
		long[] to = new long[f.length];
		{
			int[] b = new int[65537];
			for(int i = 0;i < f.length;i++)b[1+(int)(f[i]&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < f.length;i++)to[b[(int)(f[i]&0xffff)]++] = f[i];
			long[] d = f; f = to;to = d;
		}
		{
			int[] b = new int[65537];
			for(int i = 0;i < f.length;i++)b[1+(int)(f[i]>>>16&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < f.length;i++)to[b[(int)(f[i]>>>16&0xffff)]++] = f[i];
			long[] d = f; f = to;to = d;
		}
		{
			int[] b = new int[65537];
			for(int i = 0;i < f.length;i++)b[1+(int)(f[i]>>>32&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < f.length;i++)to[b[(int)(f[i]>>>32&0xffff)]++] = f[i];
			long[] d = f; f = to;to = d;
		}
		{
			int[] b = new int[65537];
			for(int i = 0;i < f.length;i++)b[1+(int)(f[i]>>>48&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < f.length;i++)to[b[(int)(f[i]>>>48&0xffff)]++] = f[i];
			long[] d = f; f = to;to = d;
		}
		return f;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new N416().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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード