結果
問題 | No.992 最長増加部分列の数え上げ |
ユーザー | uwi |
提出日時 | 2020-02-14 21:36:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 358 ms / 2,000 ms |
コード長 | 5,712 bytes |
コンパイル時間 | 4,692 ms |
コンパイル使用メモリ | 90,932 KB |
実行使用メモリ | 48,124 KB |
最終ジャッジ日時 | 2024-04-16 01:37:40 |
合計ジャッジ時間 | 17,754 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,888 KB |
testcase_01 | AC | 50 ms
37,172 KB |
testcase_02 | AC | 50 ms
36,800 KB |
testcase_03 | AC | 51 ms
37,244 KB |
testcase_04 | AC | 217 ms
43,276 KB |
testcase_05 | AC | 204 ms
41,792 KB |
testcase_06 | AC | 245 ms
44,456 KB |
testcase_07 | AC | 201 ms
42,976 KB |
testcase_08 | AC | 154 ms
41,560 KB |
testcase_09 | AC | 224 ms
43,408 KB |
testcase_10 | AC | 281 ms
44,560 KB |
testcase_11 | AC | 255 ms
45,284 KB |
testcase_12 | AC | 131 ms
40,164 KB |
testcase_13 | AC | 201 ms
43,092 KB |
testcase_14 | AC | 201 ms
43,008 KB |
testcase_15 | AC | 129 ms
40,116 KB |
testcase_16 | AC | 340 ms
47,024 KB |
testcase_17 | AC | 155 ms
41,620 KB |
testcase_18 | AC | 197 ms
43,100 KB |
testcase_19 | AC | 254 ms
45,800 KB |
testcase_20 | AC | 333 ms
47,968 KB |
testcase_21 | AC | 340 ms
47,976 KB |
testcase_22 | AC | 335 ms
47,128 KB |
testcase_23 | AC | 334 ms
47,336 KB |
testcase_24 | AC | 337 ms
47,916 KB |
testcase_25 | AC | 334 ms
47,748 KB |
testcase_26 | AC | 353 ms
48,124 KB |
testcase_27 | AC | 334 ms
47,824 KB |
testcase_28 | AC | 358 ms
47,664 KB |
testcase_29 | AC | 330 ms
47,660 KB |
testcase_30 | AC | 304 ms
47,408 KB |
testcase_31 | AC | 308 ms
47,800 KB |
testcase_32 | AC | 304 ms
47,168 KB |
testcase_33 | AC | 305 ms
47,384 KB |
testcase_34 | AC | 304 ms
47,668 KB |
testcase_35 | AC | 320 ms
47,692 KB |
testcase_36 | AC | 325 ms
47,404 KB |
testcase_37 | AC | 315 ms
47,652 KB |
testcase_38 | AC | 302 ms
47,488 KB |
testcase_39 | AC | 305 ms
47,260 KB |
testcase_40 | AC | 322 ms
47,872 KB |
testcase_41 | AC | 342 ms
47,868 KB |
testcase_42 | AC | 350 ms
48,028 KB |
testcase_43 | AC | 305 ms
47,816 KB |
testcase_44 | AC | 305 ms
47,872 KB |
ソースコード
package contest200214; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); out.println(countLIS(a, 1000000007)); } public static int[] shrink(int[] a) { int n = a.length; long[] b = new long[n]; for(int i = 0;i < n;i++)b[i] = (long)a[i]<<32|i; Arrays.sort(b); int[] ret = new int[n]; int p = 0; for(int i = 0;i < n;i++) { if(i>0 && (b[i]^b[i-1])>>32!=0)p++; ret[(int)b[i]] = p; } return ret; } public static long countLIS(int[] a, int mod) { if(mod == 1)return 0; a = shrink(a); int n = a.length; SegmentTreeRMQSumWhenMax st = new SegmentTreeRMQSumWhenMax(n+1, mod); st.updateOrAdd(0, 0, 1); // shifted by 1 for(int i = 0;i < n;i++){ int max = st.maxx(0, a[i]+1); // <=a[i] st.updateOrAdd(a[i]+1, max+1, (int)st.gw); } return st.w[1]; } private static class SegmentTreeRMQSumWhenMax { public int M, H, N; public int[] st; public int[] w; public int mod; public SegmentTreeRMQSumWhenMax(int n, int mod) { N = n; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; w = new int[M]; this.mod = mod; Arrays.fill(st, 0, M, Integer.MIN_VALUE); } public SegmentTreeRMQSumWhenMax(int[] a, int mod) { N = a.length; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; w = new int[M]; for(int i = 0;i < N;i++){ st[H+i] = a[i]; } this.mod = mod; Arrays.fill(st, H+N, M, Integer.MIN_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } // if x equals to before st[H+pos], +y, else update y public void updateOrAdd(int pos, int x, int y) { if(x < st[H+pos])throw new RuntimeException("x < st[H+pos]"); if(x == st[H+pos]){ w[H+pos] += y; if(w[H+pos] >= mod)w[H+pos] -= mod; }else{ st[H+pos] = x; w[H+pos] = y; // y % mod } for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i); } private void propagate(int i) { if(st[2*i] < st[2*i+1]){ st[i] = st[2*i+1]; w[i] = w[2*i+1]; }else if(st[2*i] > st[2*i+1]){ st[i] = st[2*i]; w[i] = w[2*i]; }else{ st[i] = st[2*i]; w[i] = w[2*i] + w[2*i+1]; if(w[i] >= mod)w[i] -= mod; } } public long gw; public int maxx(int l, int r){ gw = 0; if(l >= r)return 0; int max = Integer.MIN_VALUE; while(l != 0){ int f = l&-l; if(l+f > r)break; int v = st[(H+l)/f]; if(v > max){ max = v; gw = w[(H+l)/f]; }else if(v == max){ gw += w[(H+l)/f]; } l += f; } while(l < r){ int f = r&-r; int v = st[(H+r)/f-1]; if(v > max){ max = v; gw = w[(H+r)/f-1]; }else if(v == max){ gw += w[(H+r)/f-1]; } r -= f; } gw %= mod; return max; } } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new E().run(); } private byte[] inbuf = new byte[1024]; public 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))){ // when nextLine, (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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }