結果
問題 | No.1054 Union add query |
ユーザー | 37zigen |
提出日時 | 2019-11-09 03:11:23 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 830 ms / 2,000 ms |
コード長 | 4,181 bytes |
コンパイル時間 | 2,888 ms |
コンパイル使用メモリ | 79,804 KB |
実行使用メモリ | 93,492 KB |
最終ジャッジ日時 | 2024-05-05 22:32:32 |
合計ジャッジ時間 | 8,306 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
36,288 KB |
testcase_01 | AC | 44 ms
36,388 KB |
testcase_02 | AC | 44 ms
36,640 KB |
testcase_03 | AC | 703 ms
73,936 KB |
testcase_04 | AC | 663 ms
81,204 KB |
testcase_05 | AC | 830 ms
81,484 KB |
testcase_06 | AC | 700 ms
93,492 KB |
testcase_07 | AC | 613 ms
93,388 KB |
testcase_08 | AC | 616 ms
93,148 KB |
testcase_09 | AC | 410 ms
54,244 KB |
testcase_10 | AC | 163 ms
46,880 KB |
ソースコード
//check violation of constraints import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.HashSet; import java.util.NoSuchElementException; public class Main { class DJSet { int n; int[] upper; long[] weight; public DJSet(int n) { this.n = n; upper = new int[n]; weight = new long[n]; Arrays.fill(upper, -1); } void add_weight(int x, long w) { x = root(x); weight[x] += w; } long get_weight(int x) { return weight[x] + (upper[x] < 0 ? 0 : get_weight(upper[x])); } int root(int x) { return upper[x] < 0 ? x : root(upper[x]); } boolean equiv(int x, int y) { return root(x) == root(y); } void setUnion(int x, int y) { x = root(x); y = root(y); if (x == y) return; if (upper[x] < upper[y]) { x ^= y; y ^= x; x ^= y; } upper[y] += upper[x]; upper[x] = y; weight[x] -= weight[y]; } } void run() { FastScanner sc = new FastScanner(); int N = sc.nextInt(); int Q = sc.nextInt(); if (!(1 <= N && N <= 5e5 && 1 <= Q && Q <= 5e5)) throw new AssertionError(); DJSet ds = new DJSet(N); PrintWriter pw = new PrintWriter(System.out); HashSet<Long> set = new HashSet<>(); for (int q = 0; q < Q; ++q) { int T = sc.nextInt(); int A = sc.nextInt(); int B = sc.nextInt(); //----------------------------------------- if (!(T == 1 || T == 2 || T == 3)) throw new AssertionError(); // T==1 の時、self-loopがないことから A!=B if (!((T == 1 && 1 <= A && A <= N && 1 <= B && B <= N && A != B) || (T == 2 && 1 <= A && A <= N && -2000 <= B && B <= 2000) || (T == 3 && 1 <= A && A <= N && B == 0))) throw new AssertionError(); //----------------------------------------- --A; if (T == 1) { --B; long add1 = (long) A << 30 | B; long add2 = (long) B << 30 | A; if (set.contains(add1) || set.contains(add2)) throw new AssertionError(); // multiple edges set.add(add1); set.add(add2); if (ds.equiv(A, B)) continue; ds.setUnion(A, B); } else if (T == 2) { ds.add_weight(A, B); } else if (T == 3) { pw.println(ds.get_weight(A)); } } pw.close(); } public static void main(String[] args) throws FileNotFoundException { new Main().run(); } void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }