結果

問題 No.938 賢人を探せ
ユーザー OlandOland
提出日時 2019-12-01 00:16:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 236 ms / 2,000 ms
コード長 8,479 bytes
コンパイル時間 4,346 ms
コンパイル使用メモリ 80,968 KB
実行使用メモリ 47,332 KB
最終ジャッジ日時 2024-05-08 08:53:52
合計ジャッジ時間 6,477 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 236 ms
47,052 KB
testcase_01 AC 50 ms
37,276 KB
testcase_02 AC 51 ms
37,260 KB
testcase_03 AC 51 ms
37,076 KB
testcase_04 AC 50 ms
36,880 KB
testcase_05 AC 51 ms
37,240 KB
testcase_06 AC 51 ms
37,312 KB
testcase_07 AC 51 ms
36,916 KB
testcase_08 AC 166 ms
46,952 KB
testcase_09 AC 168 ms
46,920 KB
testcase_10 AC 49 ms
36,800 KB
testcase_11 AC 185 ms
47,300 KB
testcase_12 AC 171 ms
47,040 KB
testcase_13 AC 176 ms
46,988 KB
testcase_14 AC 171 ms
47,024 KB
testcase_15 AC 177 ms
47,308 KB
testcase_16 AC 179 ms
46,808 KB
testcase_17 AC 174 ms
47,152 KB
testcase_18 AC 174 ms
46,764 KB
testcase_19 AC 180 ms
47,176 KB
testcase_20 AC 173 ms
47,164 KB
testcase_21 AC 175 ms
47,260 KB
testcase_22 AC 197 ms
47,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve(){
        int N = in.nextInt();
        String[][] AB = new String[N][2];
        Counter<String> counter = new Counter<>();
        for(int i = 0; i < N; i++){
            AB[i][0] = in.nextStr();
            AB[i][1] = in.nextStr();
            counter.add(AB[i][1]);
        }
        for(int i = 0; i < N; i++){
            counter.delete(AB[i][0]);
        }
        for(int i = 0; i < N; i++){
            if(counter.containsKey(AB[i][0])){
                out.println(AB[i][0]);
                counter.delete(AB[i][0]);
            }
            if(counter.containsKey(AB[i][1])){
                out.println(AB[i][1]);
                counter.delete(AB[i][1]);
            }
        }
    }
    
    class Counter<T>{
        HashMap<T, Long> map;
        List<Map.Entry<T, Long>> listEntries;
        long num = 0;
        
        public Counter(){
            map = new HashMap<T, Long>();
        }
        
        public long add(T e){
            map.put(e, map.getOrDefault(e, 0L) + 1);
            num++;
            return map.get(e);
        }
        
        public long add(T e, long n){
            map.put(e, map.getOrDefault(e, 0L) + n);
            num += n;
            return map.get(e);
        }
        
        public long get(T e){
            return map.getOrDefault(e, 0L);
        }
        
        //要素eが集合に含まれない<=>mapにeのマッピングは存在しない
        public boolean remove(T e){
            if(!map.containsKey(e)) return false;
            long c = map.get(e);
            if(c == 1) map.remove(e);
            else map.put(e, c - 1);
            num--;
            return true;
        }
        
        public boolean remove(T e, int n){
            if(map.getOrDefault(e, 0L) < n) return false;
            long c = map.get(e);
            if(c == n) map.remove(e);
            else map.put(e, c - n);
            num -= n;
            return true;
        }
        
        public boolean delete(T e){
            if(!map.containsKey(e)) return false;
            num -= map.get(e);
            map.remove(e);
            return true;
        }
        
        public boolean containsKey(T e){
            return map.containsKey(e);
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }

    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "output.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }

    static class FastScanner {
        private Reader input;

        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }

        public int nextInt() {return (int) nextLong();}

        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

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

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }

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