結果
問題 | No.2165 Let's Play Nim! |
ユーザー |
|
提出日時 | 2022-12-16 00:19:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 499 ms / 2,000 ms |
コード長 | 17,298 bytes |
コンパイル時間 | 5,126 ms |
コンパイル使用メモリ | 94,424 KB |
実行使用メモリ | 68,308 KB |
平均クエリ数 | 878.85 |
最終ジャッジ日時 | 2024-04-27 00:04:40 |
合計ジャッジ時間 | 33,398 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 152 ms
64,036 KB |
testcase_01 | AC | 390 ms
65,640 KB |
testcase_02 | AC | 412 ms
67,844 KB |
testcase_03 | AC | 304 ms
65,096 KB |
testcase_04 | AC | 153 ms
63,860 KB |
testcase_05 | AC | 173 ms
63,620 KB |
testcase_06 | AC | 176 ms
63,720 KB |
testcase_07 | AC | 166 ms
63,688 KB |
testcase_08 | AC | 312 ms
65,196 KB |
testcase_09 | AC | 161 ms
64,060 KB |
testcase_10 | AC | 185 ms
64,172 KB |
testcase_11 | AC | 414 ms
67,844 KB |
testcase_12 | AC | 356 ms
65,568 KB |
testcase_13 | AC | 151 ms
64,016 KB |
testcase_14 | AC | 171 ms
63,960 KB |
testcase_15 | AC | 157 ms
63,680 KB |
testcase_16 | AC | 346 ms
65,260 KB |
testcase_17 | AC | 257 ms
64,516 KB |
testcase_18 | AC | 499 ms
67,456 KB |
testcase_19 | AC | 153 ms
64,060 KB |
testcase_20 | AC | 165 ms
63,244 KB |
testcase_21 | AC | 237 ms
64,192 KB |
testcase_22 | AC | 211 ms
64,288 KB |
testcase_23 | AC | 202 ms
64,144 KB |
testcase_24 | AC | 197 ms
64,320 KB |
testcase_25 | AC | 298 ms
65,136 KB |
testcase_26 | AC | 399 ms
68,308 KB |
testcase_27 | AC | 222 ms
63,904 KB |
testcase_28 | AC | 268 ms
64,520 KB |
testcase_29 | AC | 150 ms
63,740 KB |
testcase_30 | AC | 145 ms
63,812 KB |
testcase_31 | AC | 144 ms
63,476 KB |
testcase_32 | AC | 319 ms
65,284 KB |
evil_2_big_1.txt | TLE | - |
evil_2_big_2.txt | TLE | - |
evil_2_big_3.txt | TLE | - |
evil_big_1.txt | TLE | - |
evil_big_2.txt | TLE | - |
evil_big_3.txt | TLE | - |
ソースコード
package advent; import java.io.*; import java.util.*; import java.util.function.IntUnaryOperator; import java.util.function.LongUnaryOperator; public class Day16 { InputStream is; FastWriter out; String INPUT = ""; public void solve() { int n = ni(); int[] a = na(n); int x = 0; for(int v : a)x ^= v; List<Set<Integer>> bu = new ArrayList<>(); for(int i = 0;i <= 75000;i++){ bu.add(new HashSet<>()); } LST hit = new LST(75005); for(int i = 0;i < n;i++){ bu.get(a[i]).add(i); hit.set(a[i]); } if(x == 0){ out.println(0); out.flush(); int ind = ni()-1; int val = ni(); bu.get(a[ind]).remove(ind); if(bu.get(a[ind]).isEmpty()){ hit.unset(a[ind]); } x = a[ind] ^ a[ind] - val; a[ind] -= val; if(a[ind] > 0){ bu.get(a[ind]).add(ind); hit.set(a[ind]); } ni(); }else{ out.println(1); out.flush(); } while(true){ for(int i = hit.next(0);i != -1;i = hit.next(i+1)){ if((i^x) <= i){ int y = i-(i^x); int ind = bu.get(i).iterator().next(); bu.get(i).remove(ind); if(bu.get(i).isEmpty()){ hit.unset(i); } bu.get(i^x).add(ind); hit.set(i^x); a[ind] = i^x; out.println((ind+1) + " " + y); out.flush(); break; } } int ret = ni(); if(ret == -1)break; int ind = ni()-1; int val = ni(); bu.get(a[ind]).remove(ind); if(bu.get(a[ind]).isEmpty()){ hit.unset(a[ind]); } x = a[ind] ^ a[ind] - val; a[ind] -= val; if(a[ind] > 0){ bu.get(a[ind]).add(ind); hit.set(a[ind]); } ni(); } } 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; } @Override public 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 class MinHeap { public int[] a; public int[] map; public int[] imap; public int n; public int pos; public static int INF = Integer.MAX_VALUE; public MinHeap(int m) { n = m+2; a = new int[n]; map = new int[n]; imap = new int[n]; Arrays.fill(a, INF); Arrays.fill(map, -1); Arrays.fill(imap, -1); pos = 1; } public int add(int ind, int x) { int ret = imap[ind]; if(imap[ind] < 0){ a[pos] = x; map[pos] = ind; imap[ind] = pos; pos++; up(pos-1); } return ret != -1 ? a[ret] : x; } public int update(int ind, int x) { int ret = imap[ind]; if(imap[ind] < 0){ a[pos] = x; map[pos] = ind; imap[ind] = pos; pos++; up(pos-1); }else{ int o = a[ret]; a[ret] = x; up(ret); down(ret); // if(a[ret] > o){ // up(ret); // }else{ // down(ret); // } } return x; } public int remove(int ind) { if(pos == 1)return INF; if(imap[ind] == -1)return INF; pos--; int rem = imap[ind]; int ret = a[rem]; map[rem] = map[pos]; imap[map[pos]] = rem; imap[ind] = -1; a[rem] = a[pos]; a[pos] = INF; map[pos] = -1; up(rem); down(rem); return ret; } public int min() { return a[1]; } public int argmin() { return map[1]; } public int size() { return pos-1; } public int get(int ind){ return a[imap[ind]]; } private void up(int cur) { for(int c = cur, p = c>>>1;p >= 1 && a[p] > a[c];c>>>=1, p>>>=1){ int d = a[p]; a[p] = a[c]; a[c] = d; int e = imap[map[p]]; imap[map[p]] = imap[map[c]]; imap[map[c]] = e; e = map[p]; map[p] = map[c]; map[c] = e; } } private void down(int cur) { for(int c = cur;2*c < pos;){ int b = a[2*c] < a[2*c+1] ? 2*c : 2*c+1; if(a[b] < a[c]){ int d = a[c]; a[c] = a[b]; a[b] = d; int e = imap[map[c]]; imap[map[c]] = imap[map[b]]; imap[map[b]] = e; e = map[c]; map[c] = map[b]; map[b] = e; c = b; }else{ break; } } } } public static void main(String[] args) { new Day16().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 1 public 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)); } }