Submission #996635
Source Code Expand
import java.io.*; import java.math.*; import java.util.*; import static java.util.Arrays.*; public class Main { private static final int mod = (int)1e9+7; final Random random = new Random(0); final IOFast io = new IOFast(); /// MAIN CODE public void run() throws IOException { // int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim()); int TEST_CASE = 1; while(TEST_CASE-- != 0) { int K = io.nextInt(); char[] cs = io.next(); if (K == 0) { io.out.println(new String(cs)); return; } BigInteger low = BigInteger.ZERO; BigInteger high = new BigInteger(new String(cs)); while (high.subtract(low).compareTo(BigInteger.ONE) > 0) { BigInteger mid = low.add(high).shiftRight(1); BigInteger b = BigInteger.ZERO; int comma = K; for (int i = 0; i < cs.length; i++) { b = b.multiply(BigInteger.TEN).add(BigInteger.valueOf(cs[i] - '0')); if (b.compareTo(mid) > 0) { if (comma-- == 0) break; b = BigInteger.valueOf(cs[i] - '0'); } } if (comma < 0) { low = mid; } else { high = mid; } } { // StringBuilder sb = new StringBuilder(); // BigInteger b = BigInteger.ZERO; // for (int i = 0; i < cs.length; i++) { // b = b.multiply(BigInteger.TEN).add(BigInteger.valueOf(cs[i] - '0')); // if (b.compareTo(high) > 0) { // sb.append(','); // b = BigInteger.valueOf(cs[i] - '0'); // } // sb.append(cs[i]); // } io.out.println(high); } } } /// TEMPLATE static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); } static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); } static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; } static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; } void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } void main() throws IOException { // IOFast.setFileIO("rle-size.in", "rle-size.out"); try { run(); } catch (EndOfFileRuntimeException e) { } io.out.flush(); } public static void main(String[] args) throws IOException { new Main().main(); } static class EndOfFileRuntimeException extends RuntimeException { private static final long serialVersionUID = -8565341110209207657L; } static public class IOFast { private BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); private PrintWriter out = new PrintWriter(System.out); void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); } void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); } void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); } private static int pos, readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } // public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; } public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }
Submission Info
Submission Time | |
---|---|
Task | B - Problem where Commas Separate Digits |
User | tanzaku |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 6672 Byte |
Status | WA |
Exec Time | 3172 ms |
Memory | 330764 KB |
Judge Result
Set Name | Sample | Dataset1 | Dataset2 | Dataset3 | Dataset4 | Dataset5 | ||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 0 / 100 | 0 / 200 | 0 / 200 | 0 / 400 | ||||||||||||||||||||||||||||||
Status |
|
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask_02_ex1.txt, subtask_03_ex2.txt, subtask_03_ex3.txt |
Dataset1 | subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt |
Dataset2 | subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt |
Dataset3 | subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_06.txt, subtask_03_07.txt, subtask_03_08.txt, subtask_03_09.txt, subtask_03_10.txt, subtask_03_11.txt, subtask_03_12.txt, subtask_03_13.txt, subtask_03_14.txt, subtask_03_15.txt, subtask_03_ex2.txt, subtask_03_ex3.txt |
Dataset4 | subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_06.txt, subtask_03_07.txt, subtask_03_08.txt, subtask_03_09.txt, subtask_03_10.txt, subtask_03_11.txt, subtask_03_12.txt, subtask_03_13.txt, subtask_03_14.txt, subtask_03_15.txt, subtask_03_ex2.txt, subtask_03_ex3.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_10.txt, subtask_04_11.txt, subtask_04_12.txt, subtask_04_13.txt, subtask_04_14.txt, subtask_04_15.txt |
Dataset5 | subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_02_04.txt, subtask_02_05.txt, subtask_02_06.txt, subtask_02_07.txt, subtask_02_08.txt, subtask_02_09.txt, subtask_02_10.txt, subtask_02_11.txt, subtask_02_12.txt, subtask_02_13.txt, subtask_02_14.txt, subtask_02_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_06.txt, subtask_03_07.txt, subtask_03_08.txt, subtask_03_09.txt, subtask_03_10.txt, subtask_03_11.txt, subtask_03_12.txt, subtask_03_13.txt, subtask_03_14.txt, subtask_03_15.txt, subtask_03_ex2.txt, subtask_03_ex3.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_10.txt, subtask_04_11.txt, subtask_04_12.txt, subtask_04_13.txt, subtask_04_14.txt, subtask_04_15.txt, subtask_05_01.txt, subtask_05_02.txt, subtask_05_03.txt, subtask_05_04.txt, subtask_05_05.txt, subtask_05_06.txt, subtask_05_07.txt, subtask_05_08.txt, subtask_05_09.txt, subtask_05_10.txt, subtask_05_11.txt, subtask_05_12.txt, subtask_05_13.txt, subtask_05_14.txt, subtask_05_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask_01_01.txt | AC | 95 ms | 8400 KB |
subtask_01_02.txt | AC | 100 ms | 8912 KB |
subtask_01_03.txt | AC | 98 ms | 8660 KB |
subtask_01_04.txt | AC | 96 ms | 8404 KB |
subtask_01_05.txt | AC | 95 ms | 8528 KB |
subtask_01_06.txt | AC | 96 ms | 8532 KB |
subtask_01_07.txt | AC | 96 ms | 8404 KB |
subtask_01_08.txt | WA | 98 ms | 8660 KB |
subtask_01_09.txt | AC | 96 ms | 8528 KB |
subtask_01_10.txt | AC | 96 ms | 8404 KB |
subtask_01_11.txt | AC | 96 ms | 8400 KB |
subtask_01_12.txt | AC | 96 ms | 8532 KB |
subtask_01_13.txt | WA | 97 ms | 8652 KB |
subtask_01_14.txt | AC | 96 ms | 8404 KB |
subtask_01_15.txt | AC | 99 ms | 8532 KB |
subtask_01_16.txt | AC | 97 ms | 8532 KB |
subtask_01_17.txt | AC | 98 ms | 8528 KB |
subtask_02_01.txt | AC | 102 ms | 8784 KB |
subtask_02_02.txt | AC | 113 ms | 8912 KB |
subtask_02_03.txt | WA | 112 ms | 8788 KB |
subtask_02_04.txt | AC | 102 ms | 8784 KB |
subtask_02_05.txt | AC | 101 ms | 8784 KB |
subtask_02_06.txt | AC | 112 ms | 8788 KB |
subtask_02_07.txt | AC | 112 ms | 8780 KB |
subtask_02_08.txt | AC | 113 ms | 8908 KB |
subtask_02_09.txt | AC | 96 ms | 8404 KB |
subtask_02_10.txt | AC | 113 ms | 8908 KB |
subtask_02_11.txt | AC | 111 ms | 8784 KB |
subtask_02_12.txt | AC | 102 ms | 8912 KB |
subtask_02_13.txt | AC | 113 ms | 8780 KB |
subtask_02_14.txt | AC | 103 ms | 8656 KB |
subtask_02_ex1.txt | AC | 99 ms | 8652 KB |
subtask_03_01.txt | AC | 137 ms | 14672 KB |
subtask_03_02.txt | AC | 135 ms | 14672 KB |
subtask_03_03.txt | WA | 140 ms | 14672 KB |
subtask_03_04.txt | AC | 141 ms | 14928 KB |
subtask_03_05.txt | AC | 134 ms | 14804 KB |
subtask_03_06.txt | AC | 132 ms | 14800 KB |
subtask_03_07.txt | AC | 138 ms | 14672 KB |
subtask_03_08.txt | AC | 133 ms | 15316 KB |
subtask_03_09.txt | AC | 96 ms | 8532 KB |
subtask_03_10.txt | AC | 140 ms | 14676 KB |
subtask_03_11.txt | AC | 135 ms | 14800 KB |
subtask_03_12.txt | AC | 140 ms | 14800 KB |
subtask_03_13.txt | AC | 125 ms | 11984 KB |
subtask_03_14.txt | AC | 132 ms | 13520 KB |
subtask_03_15.txt | AC | 112 ms | 8788 KB |
subtask_03_ex2.txt | AC | 96 ms | 8528 KB |
subtask_03_ex3.txt | AC | 136 ms | 13392 KB |
subtask_04_01.txt | MLE | 2612 ms | 330416 KB |
subtask_04_02.txt | MLE | 2643 ms | 330740 KB |
subtask_04_03.txt | MLE | 2605 ms | 330532 KB |
subtask_04_04.txt | MLE | 2601 ms | 330520 KB |
subtask_04_05.txt | MLE | 2634 ms | 330764 KB |
subtask_04_06.txt | MLE | 2609 ms | 330344 KB |
subtask_04_07.txt | MLE | 2640 ms | 330760 KB |
subtask_04_08.txt | TLE | 3051 ms | 330356 KB |
subtask_04_09.txt | AC | 98 ms | 8528 KB |
subtask_04_10.txt | MLE | 2611 ms | 330272 KB |
subtask_04_11.txt | MLE | 2626 ms | 330524 KB |
subtask_04_12.txt | MLE | 2604 ms | 330536 KB |
subtask_04_13.txt | MLE | 649 ms | 259192 KB |
subtask_04_14.txt | AC | 246 ms | 44688 KB |
subtask_04_15.txt | MLE | 960 ms | 328352 KB |
subtask_05_01.txt | TLE | 3172 ms | 328872 KB |
subtask_05_02.txt | TLE | 3172 ms | 328740 KB |
subtask_05_03.txt | TLE | 3172 ms | 328748 KB |
subtask_05_04.txt | TLE | 3172 ms | 328752 KB |
subtask_05_05.txt | TLE | 3172 ms | 328740 KB |
subtask_05_06.txt | TLE | 3172 ms | 328748 KB |
subtask_05_07.txt | TLE | 3172 ms | 328740 KB |
subtask_05_08.txt | TLE | 3172 ms | 328852 KB |
subtask_05_09.txt | AC | 125 ms | 11468 KB |
subtask_05_10.txt | TLE | 3172 ms | 328732 KB |
subtask_05_11.txt | TLE | 3172 ms | 328744 KB |
subtask_05_12.txt | TLE | 3172 ms | 328728 KB |
subtask_05_13.txt | TLE | 3172 ms | 330176 KB |
subtask_05_14.txt | TLE | 3172 ms | 329356 KB |
subtask_05_15.txt | TLE | 3172 ms | 330740 KB |