結果

問題 No.1420 国勢調査 (Easy)
ユーザー tenten
提出日時 2023-07-13 09:03:46
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,390 bytes
コンパイル時間 2,954 ms
コンパイル使用メモリ 86,440 KB
実行使用メモリ 52,440 KB
最終ジャッジ日時 2024-09-14 20:41:11
合計ジャッジ時間 17,451 ms
ジャッジサーバーID
(参考情報)
judge1 / judge6
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 7 WA * 15 RE * 8
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int m = sc.nextInt();
UnionFindTree uft = new UnionFindTree(n);
for (int i = 0; i < n; i++) {
int left = sc.nextInt() - 1;
int right = sc.nextInt() - 1;
int value = sc.nextInt();
if (uft.same(left, right)) {
if ((uft.getValue(left) ^ uft.getValue(right)) != value) {
System.out.println(-1);
return;
}
} else {
uft.unite(left, right, value);
}
}
System.out.println(String.join("\n", Arrays.stream(uft.values).mapToObj(String::valueOf).toArray(String[]::new)));
}
static class UnionFindTree {
int[] parents;
int[] values;
public UnionFindTree(int size) {
parents = new int[size];
values = new int[size];
for (int i = 0; i < size; i++) {
parents[i] = i;
}
}
public int find(int x) {
if (x == parents[x]) {
return x;
} else {
int p = find(parents[x]);
if (parents[x] != parents[parents[x]]) {
values[x] ^= values[parents[x]];
}
return parents[x] = p;
}
}
public boolean same(int x, int y) {
return find(x) == find(y);
}
public void unite(int x, int y, int v) {
int xx = find(x);
int yy = find(y);
if (xx == yy) {
return;
}
parents[yy] = xx;
values[yy] ^= values[x] ^ values[y] ^ v;
}
public int getValue(int x) {
find(x);
if (x == parents[x]) {
return values[x];
} else {
return values[x] ^ values[parents[x]];
}
}
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0