結果
問題 | No.2890 Chiffon |
ユーザー |
|
提出日時 | 2024-10-10 00:05:54 |
言語 | Java (openjdk 23) |
結果 |
TLE
|
実行時間 | - |
コード長 | 15,494 bytes |
コンパイル時間 | 5,576 ms |
コンパイル使用メモリ | 93,588 KB |
実行使用メモリ | 358,408 KB |
最終ジャッジ日時 | 2024-10-10 00:06:40 |
合計ジャッジ時間 | 45,116 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 50 TLE * 3 |
ソースコード
package no2xxx;import java.io.*;import java.util.*;import java.util.function.IntUnaryOperator;import java.util.function.LongUnaryOperator;public class No2890 {InputStream is;FastWriter out;String INPUT = "";int n;int K;LST lst;public void solve(){n = ni();K = ni();int[] a = na(K);lst = new LST(4*n);for(int v : a){lst.set(v);lst.set(v+n*2);}int low = 0, high = n/K+1;while(high - low > 1) {int h = high + low >> 1;if(ok(h)) {low = h;}else {high = h;}}out.println(low*2);}boolean ok(int h){int[] nes = new int[3*n];for(int i = 0;i < n;i++){int ne = lst.next(2*i);int nne = lst.next(ne+1);if(nne <= 2*i+2*h){nes[i] = -1;}else if(ne <= 2*i+2*h){nes[i] = (i+h);}else{nes[i] = ne/2+1;}}for(int i = 0;i < n;i++){if(nes[i] == -1){nes[i+n] = nes[i+2*n] = -1;}else{nes[i+n] = nes[i] + n;nes[i+2*n] = -1;}}// if(h == 2)tr(nes);int[][] sn = sparseNext(nes);for(int i = 0;i < n;i++){int to = go(i, K, sn);if(to == -1)continue;if(to <= i+n){return true;}}return false;}public int[][] sparseNext(int[] f){int n = f.length;final int m = 21; //int[][] sf = new int[m][n];sf[0] = Arrays.copyOf(f, n);for(int i = 1;i < m;i++){for(int j = 0;j < n;j++){sf[i][j] = sf[i-1][j] == -1 ? -1 : sf[i-1][sf[i-1][j]];}}return sf;}/*** fromからstepだけ進んだ点* @param from* @param step* @param sf* @return*/public static int go(int from, int step, int[][] sf){int cur = from;for(int i = sf.length-1;i >= 0;i--){if(step<<31-i<0){cur = sf[i][cur];if(cur == -1)break;}}return cur;}public static class LST {public long[][] set;public int n;// public int size;public LST(int n) {this.n = n;int d = 1;for(int m = n;m > 1;m>>>=6, d++);set = new long[d][];for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){set[i] = new long[m+1];}// size = 0;}// [0,r)public LST setRange(int r){for(int i = 0;i < set.length;i++, r=r+63>>>6){for(int j = 0;j < r>>>6;j++){set[i][j] = -1L;}if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;}return this;}// [0,r)public LST unsetRange(int r){if(r >= 0){for(int i = 0;i < set.length;i++, r=r+63>>>6){for(int j = 0;j < r+63>>>6;j++){set[i][j] = 0;}if((r&63) != 0)set[i][r>>>6] &= -(1L << r);}}return this;}public LST set(int pos){if(pos >= 0 && pos < n){// if(!get(pos))size++;for(int i = 0;i < set.length;i++, pos>>>=6){set[i][pos>>>6] |= 1L<<pos;}}return this;}public LST unset(int pos){if(pos >= 0 && pos < n){// if(get(pos))size--;for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){set[i][pos>>>6] &= ~(1L<<pos);}}return this;}public boolean get(int pos){return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;}public LST toggle(int pos){return get(pos) ? unset(pos) : set(pos);}public int prev(int pos){for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){int pre = prev(set[i][pos>>>6], pos&63);if(pre != -1){pos = pos>>>6<<6|pre;while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);return pos;}}return -1;}public int next(int pos){for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){int nex = next(set[i][pos>>>6], pos&63);if(nex != -1){pos = pos>>>6<<6|nex;while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);return pos;}}return -1;}private static int prev(long set, int n){long h = set<<~n;if(h == 0L)return -1;return -Long.numberOfLeadingZeros(h)+n;}private static int next(long set, int n){long h = set>>>n;if(h == 0L)return -1;return Long.numberOfTrailingZeros(h)+n;}@Overridepublic String toString(){List<Integer> list = new ArrayList<>();for(int pos = next(0);pos != -1;pos = next(pos+1)){list.add(pos);}return list.toString();}}public static void main(String[] args) {new No2890().run();}public void run(){long S = System.currentTimeMillis();is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new FastWriter(System.out);solve();out.flush();long G = System.currentTimeMillis();tr(G-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();}private boolean eof(){if(lenbuf == -1)return true;int lptr = ptrbuf;while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;try {is.mark(1000);while(true){int b = is.read();if(b == -1){is.reset();return true;}else if(!isSpaceChar(b)){is.reset();return false;}}} catch (IOException e) {return true;}}private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){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[][] 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[] 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 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();}}public static class FastWriter{private static final int BUF_SIZE = 1<<13;private final byte[] buf = new byte[BUF_SIZE];private final OutputStream out;private int ptr = 0;private FastWriter(){out = null;}public FastWriter(OutputStream os){this.out = os;}public FastWriter(String path){try {this.out = new FileOutputStream(path);} catch (FileNotFoundException e) {throw new RuntimeException("FastWriter");}}public FastWriter write(byte b){buf[ptr++] = b;if(ptr == BUF_SIZE)innerflush();return this;}public FastWriter write(char c){return write((byte)c);}public FastWriter write(char[] s){for(char c : s){buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();}return this;}public FastWriter write(String s){s.chars().forEach(c -> {buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();});return this;}private static int countDigits(int l) {if (l >= 1000000000) return 10;if (l >= 100000000) return 9;if (l >= 10000000) return 8;if (l >= 1000000) return 7;if (l >= 100000) return 6;if (l >= 10000) return 5;if (l >= 1000) return 4;if (l >= 100) return 3;if (l >= 10) return 2;return 1;}public FastWriter write(int x){if(x == Integer.MIN_VALUE){return write((long)x);}if(ptr + 12 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}private static int countDigits(long l) {if (l >= 1000000000000000000L) return 19;if (l >= 100000000000000000L) return 18;if (l >= 10000000000000000L) return 17;if (l >= 1000000000000000L) return 16;if (l >= 100000000000000L) return 15;if (l >= 10000000000000L) return 14;if (l >= 1000000000000L) return 13;if (l >= 100000000000L) return 12;if (l >= 10000000000L) return 11;if (l >= 1000000000L) return 10;if (l >= 100000000L) return 9;if (l >= 10000000L) return 8;if (l >= 1000000L) return 7;if (l >= 100000L) return 6;if (l >= 10000L) return 5;if (l >= 1000L) return 4;if (l >= 100L) return 3;if (l >= 10L) return 2;return 1;}public FastWriter write(long x){if(x == Long.MIN_VALUE){return write("" + x);}if(ptr + 21 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}public FastWriter write(double x, int precision){if(x < 0){write('-');x = -x;}x += Math.pow(10, -precision)/2;// if(x < 0){ x = 0; }write((long)x).write(".");x -= (long)x;for(int i = 0;i < precision;i++){x *= 10;write((char)('0'+(int)x));x -= (int)x;}return this;}public FastWriter writeln(char c){ return write(c).writeln(); }public FastWriter writeln(int x){ return write(x).writeln(); }public FastWriter writeln(long x){ return write(x).writeln(); }public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }public FastWriter write(int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(IntUnaryOperator f, int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(f.applyAsInt(x));}return this;}public FastWriter write(LongUnaryOperator f, long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(f.applyAsLong(x));}return this;}public FastWriter writeln(){return write((byte)'\n');}public FastWriter writeln(int... xs) { return write(xs).writeln(); }public FastWriter writeln(long... xs) { return write(xs).writeln(); }public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }public FastWriter writeln(char[] line) { return write(line).writeln(); }public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }public FastWriter writeln(String s) { return write(s).writeln(); }private void innerflush(){try {out.write(buf, 0, ptr);ptr = 0;} catch (IOException e) {throw new RuntimeException("innerflush");}}public void flush(){innerflush();try {out.flush();} catch (IOException e) {throw new RuntimeException("flush");}}public FastWriter print(byte b) { return write(b); }public FastWriter print(char c) { return write(c); }public FastWriter print(char[] s) { return write(s); }public FastWriter print(String s) { return write(s); }public FastWriter print(int x) { return write(x); }public FastWriter print(long x) { return write(x); }public FastWriter print(double x, int precision) { return write(x, precision); }public FastWriter println(char c){ return writeln(c); }public FastWriter println(int x){ return writeln(x); }public FastWriter println(long x){ return writeln(x); }public FastWriter println(double x, int precision){ return writeln(x, precision); }public FastWriter print(int... xs) { return write(xs); }public FastWriter print(long... xs) { return write(xs); }public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }public FastWriter println(int... xs) { return writeln(xs); }public FastWriter println(long... xs) { return writeln(xs); }public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }public FastWriter println(char[] line) { return writeln(line); }public FastWriter println(char[]... map) { return writeln(map); }public FastWriter println(String s) { return writeln(s); }public FastWriter println() { return writeln(); }}public static void trnz(int... o){for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");System.out.println();}// print ids which are 1public static void trt(long... o){Queue<Integer> stands = new ArrayDeque<>();for(int i = 0;i < o.length;i++){for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));}System.out.println(stands);}public static void tf(boolean... r){for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}public static void tf(boolean[]... b){for(boolean[] r : b) {for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}System.out.println();}public void tf(long[]... b){if(INPUT.length() != 0) {for (long[] r : b) {for (long x : r) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}System.out.println();}}public void tf(long... b){if(INPUT.length() != 0) {for (long x : b) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}}private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }}