結果
問題 | No.686 Uncertain LIS |
ユーザー |
|
提出日時 | 2018-05-11 23:47:56 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 481 ms / 2,000 ms |
コード長 | 9,895 bytes |
コンパイル時間 | 4,506 ms |
コンパイル使用メモリ | 90,176 KB |
実行使用メモリ | 56,700 KB |
最終ジャッジ日時 | 2024-11-30 21:45:07 |
合計ジャッジ時間 | 15,294 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 36 |
ソースコード
package contest180511;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Random;public class E {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();int[][] rs = new int[n][];for(int i = 0;i < n;i++){rs[i] = new int[]{ni(), ni()};}Node root = null;root = new Node(0);for(int[] q : rs){int l = q[0], r = q[1];int fl = lowerBound(root, l);int fr = lowerBound(root, r);if(fl < fr){Node[] lm_r = split(root, fr);Node[] l_m = split(lm_r[0], fl);Node M = l_m[1];add(M, 0, count(M), 1);root = merge(merge(merge(l_m[0], new Node(l)), M), split(lm_r[1], 1)[1]);}else{Node nf = get(root, fl);if(nf != null){nf.v = l;while(nf != null){update(nf);nf = nf.parent;}}else{root = merge(root, new Node(l));}}// a[low] < L a[low+1] := L// a[x+1] = a[x] + 1}out.println(count(root)-1);}public static int lowerBound(Node a, int q){int lcount = 0;while(a != null){fall(a);if(a.v >= q){a = a.left;}else{lcount += count(a.left) + 1;a = a.right;}}return lcount;}public static Random gen = new Random();static public class Node{public int v; // valuepublic long priority;public Node left, right, parent;public int count;public int add; // add coverpublic int min;public Node(int v){this.v = v;priority = gen.nextLong();update(this);}@Overridepublic String toString() {StringBuilder builder = new StringBuilder();builder.append("Node [v=");builder.append(v);builder.append(", count=");builder.append(count);builder.append(", parent=");builder.append(parent != null ? parent.v : "null");builder.append(", add=");builder.append(add);builder.append(", min=");builder.append(min);builder.append("]");return builder.toString();}}public static Node update(Node a){if(a == null)return null;a.count = 1;if(a.left != null)a.count += a.left.count;if(a.right != null)a.count += a.right.count;a.min = a.v;if(a.left != null)a.min = Math.min(a.left.min+a.add, a.min);if(a.right != null)a.min = Math.min(a.right.min+a.add, a.min);return a;}public static Node disconnect(Node a){if(a == null)return null;a.left = a.right = a.parent = null;return update(a);}public static Node root(Node x){if(x == null)return null;while(x.parent != null)x = x.parent;return x;}public static int count(Node a){return a == null ? 0 : a.count;}public static void setParent(Node a, Node par){if(a != null)a.parent = par;}public static int min(Node a, int L, int R){if(a == null || L >= R || L >= count(a) || R <= 0)return Integer.MAX_VALUE / 2;if(L <= 0 && R >= count(a)){return a.min;}else{int lmin = min(a.left, L, R);int rmin = min(a.right, L-count(a.left)-1, R-count(a.left)-1);int min = Math.min(lmin, rmin) + a.add;if(L <= count(a.left) && count(a.left) < R)min = Math.min(min, a.v);return min;}}public static void add(Node a, int L, int R, int V){if(a == null || L >= R || L >= count(a) || R <= 0)return;if(L <= 0 && R >= count(a)){a.v += V;a.add += V;}else{add(a.left, L, R, V);add(a.right, L-count(a.left)-1, R-count(a.left)-1, V);if(L <= count(a.left) && count(a.left) < R)a.v += V;}update(a);}public static void fall(Node a){if(a == null)return;if(a.left != null){a.left.add += a.add;a.left.v += a.add;update(a.left);}if(a.right != null){a.right.add += a.add;a.right.v += a.add;update(a.right);}a.add = 0;update(a);}public static Node merge(Node a, Node b){if(b == null)return a;if(a == null)return b;if(a.priority > b.priority){fall(a);setParent(a.right, null);setParent(b, null);a.right = merge(a.right, b);setParent(a.right, a);return update(a);}else{fall(b);setParent(a, null);setParent(b.left, null);b.left = merge(a, b.left);setParent(b.left, b);return update(b);}}// [0,K),[K,N)public static Node[] split(Node a, int K){if(a == null)return new Node[]{null, null};fall(a);if(K <= count(a.left)){setParent(a.left, null);Node[] s = split(a.left, K);a.left = s[1];setParent(a.left, a);s[1] = update(a);return s;}else{setParent(a.right, null);Node[] s = split(a.right, K-count(a.left)-1);a.right = s[0];setParent(a.right, a);s[0] = update(a);return s;}}public static Node insert(Node a, int K, Node b){if(a == null)return b;fall(a);if(b.priority < a.priority){if(K <= count(a.left)){a.left = insert(a.left, K, b);setParent(a.left, a);}else{a.right = insert(a.right, K-count(a.left)-1, b);setParent(a.right, a);}return update(a);}else{Node[] ch = split(a, K);b.left = ch[0]; b.right = ch[1];setParent(b.left, b);setParent(b.right, b);return update(b);}}// delete K-thpublic static Node erase(Node a, int K){if(a == null)return null;if(K < count(a.left)){a.left = erase(a.left, K);setParent(a.left, a);return update(a);}else if(K == count(a.left)){fall(a);setParent(a.left, null);setParent(a.right, null);Node aa = merge(a.left, a.right);disconnect(a);return aa;}else{a.right = erase(a.right, K-count(a.left)-1);setParent(a.right, a);return update(a);}}public static Node get(Node a, int K){while(a != null){fall(a);if(K < count(a.left)){a = a.left;}else if(K == count(a.left)){break;}else{K = K - count(a.left)-1;a = a.right;}}return a;}static Node[] Q = new Node[100];public static Node update(Node a, int K, int v){int p = 0;while(a != null){Q[p++] = a;if(K < count(a.left)){a = a.left;}else if(K == count(a.left)){break;}else{K = K - count(a.left)-1;a = a.right;}}a.v = v;while(p > 0){update(Q[--p]);}return a;}public static int index(Node a){if(a == null)return -1;int ind = count(a.left);while(a != null){Node par = a.parent;if(par != null && par.right == a){ind += count(par.left) + 1;}a = par;}return ind;}public static Node[] nodes(Node a) { return nodes(a, new Node[count(a)], 0, count(a)); }public static Node[] nodes(Node a, Node[] ns, int L, int R){if(a == null)return ns;nodes(a.left, ns, L, L+count(a.left));ns[L+count(a.left)] = a;nodes(a.right, ns, R-count(a.right), R);return ns;}public static String toString(Node a, String indent){if(a == null)return "";StringBuilder sb = new StringBuilder();sb.append(toString(a.left, indent + " "));sb.append(indent).append(a).append("\n");sb.append(toString(a.right, indent + " "));return sb.toString();}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)); }}