結果
問題 | No.674 n連勤 |
ユーザー | ziita |
提出日時 | 2018-04-14 17:52:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 379 ms / 2,000 ms |
コード長 | 5,211 bytes |
コンパイル時間 | 2,818 ms |
コンパイル使用メモリ | 94,920 KB |
実行使用メモリ | 47,084 KB |
最終ジャッジ日時 | 2024-06-26 22:28:52 |
合計ジャッジ時間 | 7,449 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,908 KB |
testcase_01 | AC | 49 ms
36,920 KB |
testcase_02 | AC | 50 ms
37,020 KB |
testcase_03 | AC | 49 ms
36,744 KB |
testcase_04 | AC | 52 ms
37,280 KB |
testcase_05 | AC | 51 ms
37,280 KB |
testcase_06 | AC | 52 ms
36,892 KB |
testcase_07 | AC | 50 ms
37,288 KB |
testcase_08 | AC | 49 ms
37,000 KB |
testcase_09 | AC | 51 ms
37,192 KB |
testcase_10 | AC | 51 ms
37,280 KB |
testcase_11 | AC | 146 ms
41,524 KB |
testcase_12 | AC | 156 ms
42,556 KB |
testcase_13 | AC | 301 ms
43,448 KB |
testcase_14 | AC | 316 ms
43,916 KB |
testcase_15 | AC | 306 ms
44,172 KB |
testcase_16 | AC | 376 ms
46,948 KB |
testcase_17 | AC | 376 ms
47,084 KB |
testcase_18 | AC | 379 ms
45,840 KB |
testcase_19 | AC | 298 ms
43,804 KB |
ソースコード
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); } ArrayList<Long> remove = new ArrayList<>(); TreeSet<Long> tmpset = (TreeSet) left.tailSet(a-1, false); for(long j : tmpset){ if(map.get(j)<=b){ if(j==a&&map.get(j)==b) continue; remove.add(j); } else break; } for(long j : remove){ 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)); } }