提出 #74603932

ソースコード 拡げる

import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.PrintWriter;

@SuppressWarnings("DuplicatedCode")
public class Main {
    static int MAX_STRING_LENGTH = (int) 1e6; // 字符串最大长度
    static int MAX_DIGIT_LENGTH = (int) 1e6; // 数位最大长度
    static int MOD7 = (int) 1e9 + 7, MOD8 = 80112002, MOD9 = 998244353, inf = Integer.MAX_VALUE;

    /***** 检查 T *****/
    static class Solution {

        void solve() {
            int n = io.nextInt(), m = io.nextInt(), q = io.nextInt();
            char[] s = new char[n];
            for (int i = 0; i < m; i++) {
                int id = io.nextInt() - 1;
                char c = io.nextChar();
                s[id] = c;
            }

            out: for (int i = 0; i < q; i++) {
                char[] t = io.nextCharArray(n);
                for (int j = 0; j < n; j++) {
                    if (s[j] != 0 && s[j] != t[j]) {
                        io.println("No");
                        continue out;
                    }
                }
                io.println("Yes");
            }
        }

        static class Fenwick {
            int[] tree;
            int n;

            Fenwick(int n) {
                tree = new int[n + 1];
                this.n = n + 1;
            }

            void add(int i, int v) {
                for (i++; i < n; i += i & -i) {
                    tree[i] += v;
                }
            }

            int query(int l, int r) {
                return pre(r) - pre(l - 1);
            }

            int pre(int i) {
                int s = 0;
                for (i++; i > 0; i &= i - 1) {
                    s += tree[i];
                }
                return s;
            }
        }


    }


    public static void main(String[] args) {
        io = new IO();
        int T = 1;
        // T = io.nextInt();
        for (; T > 0; T--) {
            new Solution().solve();
        }
        io.close();
    }

    static IO io;
    static class IO {
        BufferedInputStream bis = new BufferedInputStream(System.in);
        PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));

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

        long nextLong() {
            try {
                long sign = 1, x = 0;
                int c = bis.read();
                while (c < '0' || c > '9') {
                    if (c == '-') sign = -1;
                    c = bis.read();
                }
                while (c >= '0' && c <= '9') {
                    x = x * 10 + (c - '0');
                    c = bis.read();
                }
                return sign * x;
            } catch (IOException e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                try {
                    int sign = 1, x = 0;
                    int c = bis.read();
                    while (c < '0' || c > '9') {
                        if (c == '-') sign = -1;
                        c = bis.read();
                    }
                    while (c >= '0' && c <= '9') {
                        x = x * 10 + (c - '0');
                        c = bis.read();
                    }
                    a[i] = sign * x;
                } catch (IOException e) {
                    throw new RuntimeException(e.getMessage());
                }
            }
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                try {
                    long sign = 1, x = 0;
                    int c = bis.read();
                    while (c < '0' || c > '9') {
                        if (c == '-') sign = -1;
                        c = bis.read();
                    }
                    while (c >= '0' && c <= '9') {
                        x = x * 10 + (c - '0');
                        c = bis.read();
                    }
                    a[i] = sign * x;
                } catch (IOException e) {
                    throw new RuntimeException(e.getMessage());
                }
            }
            return a;
        }

        int[] nextDigitArray(int n) {
            try {
                int[] a = new int[n];
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int i = 0;
                while (!ignore(x)) {
                    a[i++] = x - '0';
                    x = bis.read();
                }
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        private int[] DIGIT_ARRAY;

        int[] nextDigitArray() {
            try {
                if (DIGIT_ARRAY == null) {
                    DIGIT_ARRAY = new int[MAX_DIGIT_LENGTH];
                }
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int m = 0;
                while (!ignore(x)) {
                    DIGIT_ARRAY[m++] = x - '0';
                    x = bis.read();
                }
                int[] a = new int[m];
                System.arraycopy(DIGIT_ARRAY, 0, a, 0, m);
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        char nextChar() {
            try {
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                return (char) x;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) {
                try {
                    if (CHAR_ARRAY == null) {
                        CHAR_ARRAY = new char[MAX_STRING_LENGTH];
                    }
                    int x = bis.read();
                    while (ignore(x)) {
                        x = bis.read();
                    }
                    int m = 0;
                    while (x != ' ' && x != ',' && !ignore(x)) {
                        CHAR_ARRAY[m++] = (char) x;
                        x = bis.read();
                    }
                    a[i] = new String(CHAR_ARRAY, 0, m);
                } catch (IOException e) {
                    throw new RuntimeException(e.getMessage());
                }
            }
            return a;
        }

        private char[] CHAR_ARRAY;

        char[] nextCharArray(boolean line) {
            try {
                if (CHAR_ARRAY == null) {
                    CHAR_ARRAY = new char[MAX_STRING_LENGTH];
                }
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int m = 0;
                while (line ? (x == ' ' || x == ',' || !ignore(x)) : !ignore(x)) {
                    CHAR_ARRAY[m++] = (char) x;
                    x = bis.read();
                }
                char[] a = new char[m];
                System.arraycopy(CHAR_ARRAY, 0, a, 0, m);
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        char[] nextCharArray(int n) {
            try {
                char[] a = new char[n];
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int i = 0;
                while (!ignore(x)) {
                    a[i++] = (char) x;
                    x = bis.read();
                }
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        private boolean ignore(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        String nextString(boolean line) {
            return new String(nextCharArray(line));
        }

        String nextString() {
            return nextString(false);
        }

        boolean nextBoolean() {
            return "true".equalsIgnoreCase(nextString());
        }

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

        void println(Object obj) {
            print(obj);
            print("\n");
        }

        void println() {
            print('\n');
        }

        void print(Object obj) {
            pw.print(obj);
        }

        void printf(String format, Object... obj) {
            pw.printf(format, obj);
        }

        void close() {
            try {
                if (bis != null) bis.close();
                if (pw != null) {
                    pw.flush();
                    pw.close();
                }
                bis = null;
                pw = null;
            } catch (Exception ignore) {
            }
        }
    }
}

提出情報

提出日時
問題 A - パスワード照合
ユーザ gaoyuliang
言語 Java24 (OpenJDK 24.0.2)
得点 266
コード長 9606 Byte
結果 AC
実行時間 77 ms
メモリ 40204 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 266 / 266
結果
AC × 3
AC × 55
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 42 ms 38392 KiB
in02.txt AC 34 ms 38288 KiB
in03.txt AC 33 ms 37960 KiB
in04.txt AC 32 ms 37948 KiB
in05.txt AC 32 ms 37768 KiB
in06.txt AC 31 ms 38280 KiB
in07.txt AC 31 ms 38108 KiB
in08.txt AC 32 ms 37908 KiB
in09.txt AC 34 ms 38180 KiB
in10.txt AC 54 ms 40016 KiB
in11.txt AC 41 ms 39036 KiB
in12.txt AC 77 ms 40204 KiB
in13.txt AC 32 ms 37668 KiB
in14.txt AC 36 ms 37812 KiB
in15.txt AC 33 ms 37936 KiB
in16.txt AC 32 ms 37888 KiB
in17.txt AC 33 ms 38396 KiB
in18.txt AC 33 ms 38188 KiB
in19.txt AC 32 ms 38256 KiB
in20.txt AC 62 ms 40052 KiB
in21.txt AC 33 ms 38172 KiB
in22.txt AC 34 ms 38516 KiB
in23.txt AC 34 ms 38224 KiB
in24.txt AC 34 ms 38080 KiB
in25.txt AC 33 ms 38068 KiB
in26.txt AC 34 ms 38084 KiB
in27.txt AC 35 ms 37768 KiB
in28.txt AC 35 ms 38248 KiB
in29.txt AC 34 ms 38376 KiB
in30.txt AC 36 ms 38104 KiB
in31.txt AC 34 ms 37648 KiB
in32.txt AC 33 ms 38040 KiB
in33.txt AC 34 ms 38076 KiB
in34.txt AC 33 ms 38136 KiB
in35.txt AC 42 ms 39092 KiB
in36.txt AC 42 ms 39060 KiB
in37.txt AC 33 ms 37684 KiB
in38.txt AC 33 ms 38076 KiB
in39.txt AC 33 ms 38260 KiB
in40.txt AC 32 ms 38380 KiB
in41.txt AC 34 ms 38064 KiB
in42.txt AC 34 ms 38016 KiB
in43.txt AC 35 ms 38140 KiB
in44.txt AC 34 ms 37960 KiB
in45.txt AC 35 ms 38024 KiB
in46.txt AC 35 ms 37996 KiB
in47.txt AC 34 ms 37980 KiB
in48.txt AC 33 ms 38060 KiB
in49.txt AC 34 ms 38256 KiB
in50.txt AC 33 ms 37996 KiB
in51.txt AC 34 ms 38112 KiB
in52.txt AC 33 ms 38040 KiB
sample01.txt AC 33 ms 38044 KiB
sample02.txt AC 34 ms 38264 KiB
sample03.txt AC 33 ms 37768 KiB