結果

問題 No.618 labo-index
ユーザー yuya178yuya178
提出日時 2017-12-18 17:05:42
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,168 bytes
コンパイル時間 2,728 ms
コンパイル使用メモリ 84,064 KB
実行使用メモリ 110,292 KB
最終ジャッジ日時 2024-12-15 23:54:35
合計ジャッジ時間 53,508 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
110,292 KB
testcase_01 AC 48 ms
108,904 KB
testcase_02 AC 50 ms
57,104 KB
testcase_03 AC 49 ms
50,432 KB
testcase_04 AC 82 ms
51,292 KB
testcase_05 AC 100 ms
52,172 KB
testcase_06 AC 50 ms
50,368 KB
testcase_07 AC 53 ms
50,052 KB
testcase_08 AC 62 ms
50,316 KB
testcase_09 AC 78 ms
50,956 KB
testcase_10 AC 87 ms
50,948 KB
testcase_11 AC 76 ms
50,968 KB
testcase_12 AC 60 ms
50,400 KB
testcase_13 AC 76 ms
51,184 KB
testcase_14 AC 75 ms
50,900 KB
testcase_15 AC 77 ms
51,148 KB
testcase_16 AC 88 ms
51,208 KB
testcase_17 AC 59 ms
50,236 KB
testcase_18 AC 120 ms
52,352 KB
testcase_19 AC 1,260 ms
89,248 KB
testcase_20 AC 1,628 ms
91,220 KB
testcase_21 AC 969 ms
88,464 KB
testcase_22 AC 1,310 ms
86,116 KB
testcase_23 AC 1,463 ms
92,048 KB
testcase_24 AC 965 ms
86,732 KB
testcase_25 AC 1,768 ms
92,016 KB
testcase_26 AC 1,034 ms
92,504 KB
testcase_27 AC 1,327 ms
90,212 KB
testcase_28 AC 988 ms
85,412 KB
testcase_29 WA -
testcase_30 AC 896 ms
79,876 KB
testcase_31 AC 1,144 ms
88,756 KB
testcase_32 AC 1,896 ms
90,544 KB
testcase_33 AC 1,354 ms
81,016 KB
testcase_34 TLE -
testcase_35 TLE -
testcase_36 TLE -
testcase_37 TLE -
testcase_38 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long MOD = 1_000_000_007;
    int inf = Integer.MAX_VALUE;

    void solve(){
        int Q = ni();
        long[] index = new long[100001];
        List<Long> arr = new ArrayList<>();
        long bias = 0;
        int num = 1;
        for(int i = 1; i <= Q; i++){
            int t = ni();
            int a = ni();
            long l = 0;
            if(t==1){
                index[num++] = a - bias;
                arr.add(a-bias);
                Collections.sort(arr);
                int res = 0;
                for(int j = 0; j < arr.size(); j++){
                    if(arr.get(j)+bias>=0){
                        res = Math.max(arr.size()-j,res);
                    }
                    if(arr.size()-j >= arr.get(j)+bias){
                        l = arr.get(j)+bias;
                    }
                }
                if(l<=0) l = Math.max(l,res);
            }
            if(t==2){
                arr.remove(index[a]);
                Collections.sort(arr);
                int res = 0;
                for(int j = 0; j < arr.size(); j++){
                    if(arr.get(j)+bias>=0){
                        res = Math.max(arr.size()-j,res);
                    }
                    if(arr.size()-j >= arr.get(j)+bias){
                        l = arr.get(j)+bias;
                    }
                }
                if(l<=0)l = Math.max(l,res);
            }
            if(t==3){
                bias += a;
                Collections.sort(arr);
                int res = 0;
                for(int j = 0; j < arr.size(); j++){
                    if(arr.get(j)+bias>=0){
                        res = Math.max(arr.size()-j,res);
                    }
                    if(arr.size()-j >= arr.get(j)+bias){
                        l = arr.get(j)+bias;
                    }
                }
                if(l<=0)l = Math.max(l,res);
            }
            out.println(l);
        }

    }
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0