Submission #435209
Source Code Expand
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.*; public class Main { static InputStream is; static PrintWriter out; static String INPUT = ""; final int INF = Integer.MAX_VALUE; final int MIN = Integer.MIN_VALUE; static void solve() { int m = ni(); int vv = 0; if (m < 100) { } else if (m <= 5000) { vv = m / 100; } else if (m <= 30000) { vv = m / 1000 + 50; } else if (m <= 70000) { vv = ((m / 1000) - 30) / 5 + 80; } else { vv = 89; } System.out.println(String.format("%02d", vv)); } public static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G - S + "ms"); } private static 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 static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } // private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); } private static int skip() { int b; while ((b = readByte()) != -1 && isSpaceChar(b)) ; return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char) skip(); } private static String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while (!(isSpaceChar(b))) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private static 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 static 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 static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static 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 static 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) { if (INPUT.length() != 0) System.out.println(Arrays.deepToString(o)); } }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | elzup |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 4757 Byte |
Status | AC |
Exec Time | 381 ms |
Memory | 21164 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 279 ms | 21044 KB |
00_sample_02.txt | AC | 277 ms | 21040 KB |
00_sample_03.txt | AC | 279 ms | 21048 KB |
test_01.txt | AC | 281 ms | 21048 KB |
test_02.txt | AC | 276 ms | 21128 KB |
test_03.txt | AC | 288 ms | 21084 KB |
test_04.txt | AC | 278 ms | 21048 KB |
test_05.txt | AC | 300 ms | 21052 KB |
test_06.txt | AC | 356 ms | 21088 KB |
test_07.txt | AC | 308 ms | 21032 KB |
test_08.txt | AC | 306 ms | 21116 KB |
test_09.txt | AC | 279 ms | 21124 KB |
test_10.txt | AC | 279 ms | 21040 KB |
test_11.txt | AC | 280 ms | 21116 KB |
test_12.txt | AC | 278 ms | 21100 KB |
test_13.txt | AC | 283 ms | 21044 KB |
test_14.txt | AC | 276 ms | 21048 KB |
test_15.txt | AC | 280 ms | 21092 KB |
test_16.txt | AC | 278 ms | 21132 KB |
test_17.txt | AC | 278 ms | 21048 KB |
test_18.txt | AC | 281 ms | 21100 KB |
test_19.txt | AC | 278 ms | 21044 KB |
test_20.txt | AC | 278 ms | 21164 KB |
test_21.txt | AC | 282 ms | 21048 KB |
test_22.txt | AC | 277 ms | 21048 KB |
test_23.txt | AC | 381 ms | 21048 KB |
test_24.txt | AC | 282 ms | 21120 KB |
test_25.txt | AC | 282 ms | 21100 KB |
test_26.txt | AC | 283 ms | 21124 KB |
test_27.txt | AC | 287 ms | 21164 KB |
test_28.txt | AC | 296 ms | 21116 KB |
test_29.txt | AC | 284 ms | 21128 KB |
test_30.txt | AC | 284 ms | 21132 KB |
test_31.txt | AC | 285 ms | 21116 KB |
test_32.txt | AC | 285 ms | 21128 KB |
test_33.txt | AC | 279 ms | 21164 KB |
test_34.txt | AC | 281 ms | 21040 KB |
test_35.txt | AC | 282 ms | 21032 KB |