結果

問題 No.674 n連勤
ユーザー ziitaziita
提出日時 2018-04-14 17:33:24
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 5,040 bytes
コンパイル時間 2,592 ms
コンパイル使用メモリ 90,796 KB
実行使用メモリ 73,024 KB
最終ジャッジ日時 2024-06-26 22:26:04
合計ジャッジ時間 7,230 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,108 KB
testcase_01 AC 53 ms
36,756 KB
testcase_02 AC 53 ms
36,988 KB
testcase_03 AC 54 ms
36,944 KB
testcase_04 AC 53 ms
37,196 KB
testcase_05 AC 54 ms
36,976 KB
testcase_06 AC 54 ms
36,988 KB
testcase_07 AC 55 ms
36,984 KB
testcase_08 AC 54 ms
37,360 KB
testcase_09 AC 54 ms
37,092 KB
testcase_10 AC 54 ms
36,964 KB
testcase_11 AC 150 ms
40,896 KB
testcase_12 RE -
testcase_13 AC 271 ms
43,876 KB
testcase_14 AC 279 ms
44,236 KB
testcase_15 AC 286 ms
44,380 KB
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 AC 281 ms
44,256 KB
権限があれば一括ダウンロードができます

ソースコード

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;
    long inf = Long.MAX_VALUE;

    void solve(){
        long d = nl();
        int q = ni();
        TreeSet<Long> left = new TreeSet<>();
        TreeMap<Long, Long> map = new TreeMap<>(); 
        left.add(-100l);
        map.put(-100l, -100l);
        left.add(inf);
        map.put(inf, inf);
        long ans = 0;
        for(int i = 0; i < q; i++){
            long a = nl();
            long b = nl();
            long ll = left.headSet(a+1, false).last();
            long lr = map.get(ll);
            boolean merge = false;
            if(ll<=a && lr>=a-1){
                map.remove(ll);
                left.remove(ll);
                a = ll;
                b = Math.max(lr, b);
                map.put(a, b);
                left.add(a);
                merge = true;
                ans = Math.max(ans, b-a+1);
            }
            long rl = left.headSet(b+2, false).last();
            long rr = map.get(rl);
            if(rl<=b+1 && rl>=a){
                map.remove(rl);
                left.remove(rl);
                b = Math.max(rr, b);
                map.put(a, b);
                left.add(a);
                merge = true;
                ans = Math.max(ans, b-a+1);
            }
            if(!merge){
                map.put(a,b);
                left.add(a);
                ans = Math.max(ans, b-a+1);
            }
            TreeSet<Long> tmpset = (TreeSet) left.headSet(b+1, false);
            // out.println(a+" "+b);
            for(long j : tmpset){
                if(j>a&&map.get(j)<=b){
                    left.remove(j);
                    map.remove(j);
                }
            }
            out.println(ans);
        }
        // for(long i : map.keySet()){
        //     out.println(i+" "+map.get(i));
        // }
    }


    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