結果

問題 No.1390 Get together
ユーザー neko_the_shadowneko_the_shadow
提出日時 2021-04-13 10:11:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,028 ms / 2,000 ms
コード長 6,540 bytes
コンパイル時間 2,453 ms
コンパイル使用メモリ 89,032 KB
実行使用メモリ 104,424 KB
最終ジャッジ日時 2023-09-11 14:37:01
合計ジャッジ時間 22,395 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
51,588 KB
testcase_01 AC 64 ms
51,648 KB
testcase_02 AC 66 ms
51,540 KB
testcase_03 AC 164 ms
59,016 KB
testcase_04 AC 162 ms
58,728 KB
testcase_05 AC 158 ms
58,252 KB
testcase_06 AC 153 ms
58,468 KB
testcase_07 AC 160 ms
58,568 KB
testcase_08 AC 160 ms
58,792 KB
testcase_09 AC 164 ms
58,424 KB
testcase_10 AC 67 ms
51,640 KB
testcase_11 AC 66 ms
51,736 KB
testcase_12 AC 65 ms
52,012 KB
testcase_13 AC 66 ms
51,740 KB
testcase_14 AC 65 ms
51,536 KB
testcase_15 AC 65 ms
51,492 KB
testcase_16 AC 862 ms
87,192 KB
testcase_17 AC 753 ms
79,672 KB
testcase_18 AC 872 ms
104,424 KB
testcase_19 AC 1,020 ms
97,724 KB
testcase_20 AC 761 ms
80,288 KB
testcase_21 AC 803 ms
79,736 KB
testcase_22 AC 1,028 ms
94,676 KB
testcase_23 AC 960 ms
92,480 KB
testcase_24 AC 1,015 ms
94,736 KB
testcase_25 AC 1,001 ms
95,848 KB
testcase_26 AC 969 ms
95,964 KB
testcase_27 AC 985 ms
96,204 KB
testcase_28 AC 973 ms
96,076 KB
testcase_29 AC 974 ms
95,772 KB
testcase_30 AC 997 ms
95,448 KB
testcase_31 AC 990 ms
95,712 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package _1390;
import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.function.Supplier;
import java.util.regex.Pattern;
import java.util.stream.IntStream;

public class Main {
    public void exec() {
        int n = stdin.nextInt();
        int m = stdin.nextInt();
        
        int[] b = new int[n];
        int[] c = new int[n];
        for (int i = 0; i < n; i++) {
            b[i] = stdin.nextInt();
            c[i] = stdin.nextInt();
        }
        
        Map<Integer, List<Integer>> d = new HashMap<>();
        for (int i = 0; i < n; i++) {
            d.computeIfAbsent(b[i], unused -> new ArrayList<>()).add(c[i]);
        }
        
        Map<Integer, Integer> e = new HashMap<>();
        for (int i = 0; i < n; i++) {
            e.put(c[i], b[i]);
        }
        
        UnionFind uf = new UnionFind(Arrays.stream(c).max().getAsInt()+1);
        for (List<Integer> slimes : d.values()) {
            for (int i = 1; i < slimes.size(); i++) {
                uf.union(slimes.get(0), slimes.get(i));
            }
        }
        
        int count = 0;
        for (int box : d.keySet()) {
            List<Integer> slimes = d.get(box);
            if (e.get(uf.find(slimes.get(0))) != box) {
                count++;
            }
        }
        stdout.println(count);
    }
    
    public class UnionFind {
        private int[] parent;
        private int[] size;

        public UnionFind(int n) {
            this.parent = IntStream.range(0, n).toArray();
            this.size = new int[n];
            Arrays.fill(this.size, 1);
        }

        public int find(int x) {
            if (parent[x] == x) {
                return x;
            }
            parent[x] = find(parent[x]);
            return parent[x];
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }

        public void union(int x, int y) {
            x = find(x);
            y = find(y);
            if (x == y) {
                return ;
            }

            if (size[x] < size[y]) {
                parent[x] = y;
                size[y] += size[x];
            } else {
                parent[y] = x;
                size[x] += size[y];
            }

        }

        public int size(int x) {
            return size[find(x)];
        }
    }

    private static final Stdin stdin = new Stdin(System.in);
    private static final Stdout stdout = new Stdout(System.out);

    public static void main(String[] args) {
        try {
            new Main().exec();
        } finally {
            stdout.flush();
        }
    }

    public static class Stdin {
        private Deque<String> queue;
        private BufferedReader in;
        private Pattern space;

        public Stdin(InputStream in) {
            this.queue = new ArrayDeque<>();
            this.in = new BufferedReader(new InputStreamReader(in));
            this.space = Pattern.compile(" ");
        }

        public String nextString() {
            if (queue.isEmpty()) {
                try {
                    String line = in.readLine();
                    if (line == null) {
                        throw new EOFException();
                    }
                    space.splitAsStream(line).forEach(this.queue::addLast);
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return queue.removeFirst();
        }

        public int nextInt() {
            return Integer.parseInt(nextString());
        }

        public double nextDouble() {
            return Double.parseDouble(nextString());
        }

        public long nextLong() {
            return Long.parseLong(nextString());
        }
        
        public BigInteger nextBigInteger() {
            return new BigInteger(nextString());
        }

        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) a[i] = nextString();
            return a;
        }

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        public double[] nextDoubleArray(int n) {
            double[] a = new double[n];
            for (int i = 0; i < n; i++) a[i] = nextDouble();
            return a;
        }

        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
        
        public BigInteger[] nexBigIntegerArray(int n) {
            BigInteger[] a = new BigInteger[n];
            for (int i = 0; i < n; i++) a[i] = nextBigInteger();
            return a;
        }
        
        public List<Integer> nextIntegerList(int n) {
            return nextList(n, this::nextInt);
        }
        
        public List<Long> nextLongList(int n) {
            return nextList(n, this::nextLong);
        }
        
        public List<Double> nextDoubleList(int n) {
            return nextList(n, this::nextDouble);
        }
        
        public List<String> nextStringList(int n) {
            return nextList(n, this::nextString);
        }
        
        public List<BigInteger> nextBigIntegerList(int n) {
            return nextList(n, this::nextBigInteger);
        }
        
        private <T> List<T> nextList(int n, Supplier<T> supplier) {
            List<T> a = new ArrayList<>();
            for (int i = 0; i < n; i++) a.add(supplier.get());
            return a;
        }
    }

    public static class Stdout {
        private PrintWriter stdout;

        public Stdout(PrintStream stdout) {
            this.stdout =  new PrintWriter(stdout, false);
        }

        public void println(Object ... objs) {
            for (int i = 0, len = objs.length; i < len; i++) {
                stdout.print(objs[i]);
                if (i != len-1) stdout.print(' ');
            }
            stdout.println();
        }

        public void flush() {
            stdout.flush();
        }
    }
}
0