結果

問題 No.2402 Dirty Stairs and Shoes
ユーザー AsahiAsahi
提出日時 2023-08-04 23:13:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 179 ms / 2,000 ms
コード長 9,662 bytes
コンパイル時間 6,642 ms
コンパイル使用メモリ 89,324 KB
実行使用メモリ 49,708 KB
最終ジャッジ日時 2024-05-10 07:23:16
合計ジャッジ時間 11,193 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,940 KB
testcase_01 AC 53 ms
37,172 KB
testcase_02 AC 51 ms
37,004 KB
testcase_03 AC 143 ms
44,844 KB
testcase_04 AC 73 ms
38,424 KB
testcase_05 AC 179 ms
49,708 KB
testcase_06 AC 118 ms
41,464 KB
testcase_07 AC 90 ms
39,184 KB
testcase_08 AC 100 ms
40,088 KB
testcase_09 AC 105 ms
41,320 KB
testcase_10 AC 147 ms
45,556 KB
testcase_11 AC 126 ms
41,932 KB
testcase_12 AC 112 ms
39,452 KB
testcase_13 AC 108 ms
42,936 KB
testcase_14 AC 122 ms
43,572 KB
testcase_15 AC 102 ms
41,548 KB
testcase_16 AC 88 ms
39,716 KB
testcase_17 AC 114 ms
42,876 KB
testcase_18 AC 103 ms
42,068 KB
testcase_19 AC 116 ms
42,768 KB
testcase_20 AC 108 ms
42,700 KB
testcase_21 AC 86 ms
37,472 KB
testcase_22 AC 88 ms
40,352 KB
testcase_23 AC 86 ms
38,736 KB
testcase_24 AC 90 ms
40,496 KB
testcase_25 AC 111 ms
43,288 KB
testcase_26 AC 90 ms
40,608 KB
testcase_27 AC 113 ms
42,972 KB
testcase_28 AC 108 ms
42,656 KB
testcase_29 AC 90 ms
40,548 KB
testcase_30 AC 55 ms
36,896 KB
testcase_31 AC 115 ms
43,348 KB
testcase_32 AC 85 ms
40,068 KB
testcase_33 AC 66 ms
36,992 KB
testcase_34 AC 89 ms
39,860 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Main{

    static final int MOD7 = 1000000007;
    static final int MOD9 = 998244353 ;
    static final int  inf = (1  << 30);
    static final long lnf = (1L << 60);
    final String yes = "Yes";
    final String no  = "No" ;
    ///////////////////////////////////

    ///////////////////////////////////
    void solve() {   
        int N = in.nextInt() , K = in.nextInt();
        int M_1 = in.nextInt();
        int [] A = in.IntArray(M_1);
        int M_2 = in.nextInt();
        int [] B = in.IntArray(M_2);
        Set<Integer> bad = new HashSet<>();
        Set<Integer> good = new HashSet<>();
        boolean [] dp = new boolean[N + 1];
        for(int i = 0 ; i < M_1 ; i ++ ) {
            bad.add(A[i]);
        }
        for(int i = 0 ; i < M_2 ; i ++ ) {
            dp[B[i]] = true;
        }
        dp[0] = true;
        for(int i = 0 ; i < N ; i ++ ) {
            if(!dp[i]) continue;
            if(!bad.contains(i + K) && i + K <= N) {
                dp[i + K] = dp[i];
            }
            if(!bad.contains(i + 1) && i + 1 <= N) {
                dp[i + 1] = dp[i];
            }
        }
        out.print(dp[N] ? yes : no);
    }
    ///////////////////////////////////
    ///////////////////////////////////
    public static void main(String[] args) {
        new Main().solve();
        out.flush();
    }
    ///////////////////////////////////
    static PrintWriter out = new PrintWriter(System.out);
    static In in = new In();
    static Display disp = new Display();
}

class Pair<T extends Comparable<T>, U extends Comparable<U>> implements Comparable<Pair<T, U>> {

    private final T first;
    private final U second;

    Pair(T first, U second) {
        this.first = first;
        this.second = second;
    }

    T first() {
        return first;
    }

    U second() {
        return second;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Pair<?, ?> pair = (Pair<?, ?>) o;
        return Objects.equals(first, pair.first) && Objects.equals(second, pair.second);
    }

    @Override
    public int hashCode() {
        return Objects.hash(first, second);
    }

    @Override
    public int compareTo(Pair<T, U> other) {
        T f  = this.first  , F  = other.first;
        U s  = this.second , S  = other.second;
        int First_Result  = f.compareTo(F);
        int Second_Result = s.compareTo(S);
        return First_Result == 0 ? Second_Result : First_Result ;
    }

    @Override
    public String toString() {
        return "(" + this.first + " , " + this.second + ")";
    }
}

class Triple<T extends Comparable<T>, U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Triple<T, U, V>> {
    
    private final T first;
    private final U second;
    private final V third;

    Triple(T first, U second, V third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }

    T first() {
        return first;
    }

    U second() {
        return second;
    }

    V third() {
        return third;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Triple<?, ?, ?> triple = (Triple<?, ?, ?>) o;
        return Objects.equals(first, triple.first) 
            && Objects.equals(second, triple.second)
            && Objects.equals(third, triple.third) ;
    }


    @Override
    public int hashCode() {
        return Objects.hash(first, second, third);
    }

    @Override
    public int compareTo(Triple<T, U, V> other) {
        T f  = this.first  , F  = other.first;
        U s  = this.second , S  = other.second;
        V t  = this.third  , T  = other.third;
        int First_Result  = f.compareTo(F);
        int Second_Result = s.compareTo(S);
        int Third_Result  = t.compareTo(T);
        return First_Result == 0 ? (Second_Result == 0 ? Third_Result : Second_Result ) : First_Result;
    }

    @Override
    public String toString() {
        return "(" + this.first + " , " + this.second + " , " + this.third + ")";
    }
}

class Display {

    private PrintWriter out = new PrintWriter(System.out);

    public void display(int [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(long [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(double [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(String [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(char [] a) { out.println(Arrays.toString(a)); fl();}
    public void display(boolean [] a) { char [] c = conv(a); display(c); fl();}
    public void display(int [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(long [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(double [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(String [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(char [][] a) { for(int i = 0 ; i < a.length ; i ++ ) out.println(Arrays.toString(a[i])); fl();}
    public void display(boolean [][] a) { char [][] c = new char [a.length][a[0].length] ; for(int i = 0 ; i < a.length ; i ++ ) c[i] = conv(a[i]) ; display(c); fl();}
    private char [] conv(boolean [] a) { char [] c = new char[a.length] ; for(int i = 0 ; i < a.length ; i ++ ) c[i] = a[i] ? 'O' : 'X' ; return c ; }
    private void fl() { out.flush(); }
}

class In{

    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();
    }

    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();
    }

    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();
        }
    }
    int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    double nextDouble() { 
        return Double.parseDouble(next());
    }
    char nextChar() {
        return next().charAt(0);
    }
    int [] IntArray(int n) {
        final int [] Array = new int [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextInt();
        }
        return Array;
    }
    int [][] IntArray(int n , int m) {
        final int [][] Array = new int [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = IntArray(m);
        }
        return Array;
    }   
    long [] LongArray(int n) {
        final long [] Array = new long [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextLong();
        }
        return Array;
    }
    long [][] LongArray(int n , int m) {
        final long [][] Array = new long [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = LongArray(m);
        }
        return Array;
    }
    String [] StringArray(int n) {
        final String [] Array = new String [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next();
        }
        return Array;
    }
    char [] CharArray(int n) {
        final char [] Array = new char[n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().charAt(0);
        }
        return Array;
    }
    char [][] CharArray(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().toCharArray();
        }
        return Array;
    }
    char [][] CharArray2(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                Array[i][j] = next().charAt(0);
            }
        }
        return Array;
    }
}
0