結果

問題 No.2372 既視感
ユーザー AsahiAsahi
提出日時 2023-07-07 21:56:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 130 ms / 2,000 ms
コード長 9,505 bytes
コンパイル時間 3,103 ms
コンパイル使用メモリ 87,320 KB
実行使用メモリ 38,856 KB
最終ジャッジ日時 2024-07-21 17:50:11
合計ジャッジ時間 5,977 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,708 KB
testcase_01 AC 54 ms
37,088 KB
testcase_02 AC 51 ms
36,928 KB
testcase_03 AC 53 ms
36,808 KB
testcase_04 AC 52 ms
36,456 KB
testcase_05 AC 52 ms
36,796 KB
testcase_06 AC 53 ms
37,004 KB
testcase_07 AC 52 ms
36,644 KB
testcase_08 AC 77 ms
38,032 KB
testcase_09 AC 71 ms
37,588 KB
testcase_10 AC 88 ms
37,972 KB
testcase_11 AC 80 ms
38,072 KB
testcase_12 AC 58 ms
36,808 KB
testcase_13 AC 96 ms
38,400 KB
testcase_14 AC 56 ms
36,580 KB
testcase_15 AC 73 ms
38,484 KB
testcase_16 AC 71 ms
37,368 KB
testcase_17 AC 57 ms
36,948 KB
testcase_18 AC 55 ms
36,724 KB
testcase_19 AC 54 ms
36,600 KB
testcase_20 AC 54 ms
37,016 KB
testcase_21 AC 53 ms
36,472 KB
testcase_22 AC 57 ms
36,592 KB
testcase_23 AC 118 ms
38,740 KB
testcase_24 AC 106 ms
38,528 KB
testcase_25 AC 110 ms
38,840 KB
testcase_26 AC 108 ms
38,416 KB
testcase_27 AC 130 ms
38,856 KB
testcase_28 AC 98 ms
38,696 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Main{
    static PrintWriter out = new PrintWriter(System.out);
    static In in  = new In();
    static Out outer = new Out();
    static final int [] dx4 = {0,1,0,-1};
    static final int [] dy4 = {-1,0,1,0};
    static final int [] dx8 = {-1,-1,0,1,1,1,0,-1};
    static final int [] dy8 = {0,1,1,1,0,-1,-1,-1};
    static final long MOD7 = 1000000007;
    static final long 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() , Q = in.nextInt();
        ArrayDeque<String> seen = new ArrayDeque<>();
        while(Q-->0) {
            int type = in.nextInt();
            if(type == 1) {
                seen.addLast(in.next());
                if(seen.size() > N) {
                    seen.pollFirst();
                }
            }
            else{
                int solve = 0 ;
                int past = 0 ;
                ArrayList<String> solved = new ArrayList<>();
                for(int i = 0 ; i < 6 ; i ++ ) {
                    String name = in.next() ;
                    int time = in.nextInt();
                    int add = time ;
                    if(seen.contains(name)) {
                        add = Math.min(time,K);
                    }
                    if(past + add <= 60 && solve + 1 == (i + 1)) {
                        past += add ;
                        solve = Math.max(solve , i + 1);
                        solved.add(name);
                    }
                }
                for(int i = 0 ; i < solved.size() ; i ++ ) {
                    seen.addLast(solved.get(i));
                    if(seen.size() > N) {
                        seen.pollFirst();
                    }
                }
                out.println(solve);
            }
        }
    }
    void yn(boolean ok) { out.println(ok ? yes : no ); }
    public static void main(String[] args) {
        new Main().solve();
        out.flush();
    }
}
/*
▕▔▔▔▔▔▔▔▔▔▔▔╲
▕╮╭┻┻╮╭┻┻╮╭▕╮╲
▕╯┃╭╮┃┃╭╮┃╰▕╯╭▏
▕╭┻┻┻┛┗┻┻┛ ╰▏ ▏
▕╰━━━┓┈┈┈╭╮▕╭╮▏
▕╭╮╰┳┳┳┳╯╰╯▕╰╯▏
▕╰╯┈┗┛┗┛┈╭╮▕╮┈▏
 */
class Out{
    void print(int    [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(long   [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(String [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(char   [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(double [] a) { System.out.println(Arrays.toString(a)) ; }
    void print(boolean[] a) { System.out.println(Arrays.toString(a)) ; }
    void print(int    [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(long   [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(String [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(char   [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(double [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(boolean[][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }
    void print(int begin , int end) { for(int i = begin ; i < end ; i ++ ) System.out.printf("%3d",i); }
}
class Pair implements Comparable<Pair>{
    private int first ;
    private int second;
    Pair(int first,int second) {
        this.first = first;
        this.second = second;
    }
    int first()  { 
        return this.first ;
    }
    int second() { 
        return this.second;
    }
    @Override
    public boolean equals(Object o) {
        if (!(o instanceof Pair)) {
            return false;
        }
        Pair that = (Pair)o;
        return first == that.first && second == that.second;
    }
    @Override
    public int hashCode() {
        return Objects.hash(first, second);
    }
    @Override
    public int compareTo(Pair o) {
        return first == o.first ? Integer.compare(second, o.second) : Integer.compare(first, o.first);
    }
    @Override
    public String toString(){ 
        return first()+" "+second();
    }
}

class Triple {
    private int first;
    private int second;
    private int third;
    Triple(int first, int second, int third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }
    int first() {
        return this.first;
    }
    int second() {
        return this.second;
    }
    int third() {
        return this.third;
    }
    @Override
    public boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }

        if (obj == null || getClass() != obj.getClass()) {
            return false;
        }

        Triple other = (Triple) obj;
        return this.first == other.first && this.second == other.second && this.third == other.third;
    }
    @Override
    public int hashCode() {
        int result = 17;
        result = 31 * result + first;
        result = 31 * result + second;
        result = 31 * result + third;
        return result;
    }
    @Override 
    public String toString() {
        return this.first+" "+this.second+" "+this.third;
    }
}

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