結果
問題 | No.139 交差点 |
ユーザー | t8m8⛄️ |
提出日時 | 2015-03-10 19:49:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 115 ms / 5,000 ms |
コード長 | 4,259 bytes |
コンパイル時間 | 3,582 ms |
コンパイル使用メモリ | 74,636 KB |
実行使用メモリ | 52,668 KB |
最終ジャッジ日時 | 2023-09-06 22:58:53 |
合計ジャッジ時間 | 7,312 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,264 KB |
testcase_01 | AC | 42 ms
49,288 KB |
testcase_02 | AC | 42 ms
49,288 KB |
testcase_03 | AC | 55 ms
50,808 KB |
testcase_04 | AC | 101 ms
52,324 KB |
testcase_05 | AC | 61 ms
50,916 KB |
testcase_06 | AC | 66 ms
52,476 KB |
testcase_07 | AC | 73 ms
51,376 KB |
testcase_08 | AC | 86 ms
52,036 KB |
testcase_09 | AC | 55 ms
50,876 KB |
testcase_10 | AC | 74 ms
51,316 KB |
testcase_11 | AC | 73 ms
52,000 KB |
testcase_12 | AC | 93 ms
52,668 KB |
testcase_13 | AC | 43 ms
49,308 KB |
testcase_14 | AC | 44 ms
49,264 KB |
testcase_15 | AC | 54 ms
49,768 KB |
testcase_16 | AC | 43 ms
49,664 KB |
testcase_17 | AC | 48 ms
49,380 KB |
testcase_18 | AC | 69 ms
50,732 KB |
testcase_19 | AC | 65 ms
50,812 KB |
testcase_20 | AC | 60 ms
50,816 KB |
testcase_21 | AC | 55 ms
50,592 KB |
testcase_22 | AC | 60 ms
51,700 KB |
testcase_23 | AC | 115 ms
52,628 KB |
testcase_24 | AC | 42 ms
49,264 KB |
testcase_25 | AC | 55 ms
50,860 KB |
testcase_26 | AC | 50 ms
49,900 KB |
testcase_27 | AC | 49 ms
49,224 KB |
testcase_28 | AC | 43 ms
49,340 KB |
testcase_29 | AC | 53 ms
50,668 KB |
testcase_30 | AC | 47 ms
49,388 KB |
ソースコード
//No.139 交差点 import java.util.*; import java.io.*; import static java.util.Arrays.*; import static java.lang.Math.*; public class No139 { static final InputStream in = System.in; static final PrintWriter out = new PrintWriter(System.out,false); static void solve(){ n = nextInt(); int l = nextInt(); int[] x = new int[n]; int[] w = new int[n]; t = new int[n]; for (int i=0; i<n; i++) { x[i] = nextInt(); w[i] = nextInt(); t[i] = nextInt(); } tt = new int[n]; isRed = new boolean[n]; int ptr = 0; for (int i=0; i<l; i++) { if (ptr < n && i == x[ptr]) { if (isRed[ptr]) while (isRed[ptr]) timePass(); else while (isRed[ptr] || w[ptr] > t[ptr] - tt[ptr]) timePass(); ptr++; } timePass(); } out.println(ans); } static int n; static int[] t; static int[] tt; static boolean[] isRed; static int ans = 0; static void timePass() { for (int i=0; i<n; i++) { if (++tt[i] >= t[i]) { isRed[i] = !isRed[i]; tt[i] = 0; } } ans++; } public static void main(String[] args) throws Exception { long start = System.currentTimeMillis(); solve(); out.flush(); long end = System.currentTimeMillis(); //trace(end-start + "ms"); in.close(); } static void trace(Object... o) { System.out.println(deepToString(o));} static final byte[] buf = new byte[1024]; static int ptr = 0; static int buflen = 0; static boolean hasNextByte() { if (ptr < buflen) return true; ptr = 0; try{ buflen = in.read(buf); }catch (IOException e) {e.printStackTrace();} if (buflen <= 0) return false; return true; } static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;} static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;} static boolean hasNext() {skip(); return hasNextByte();} static String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } static long nextLong() { if (!hasNext()) throw new NoSuchElementException(); boolean minus = false; long num = readByte(); if(num == '-'){ num = 0; minus = true; }else if (num < '0' || '9' < num){ throw new NumberFormatException(); }else{ num -= '0'; } while(true){ int b = readByte(); if('0' <= b && b <= '9') num = num * 10 + (b - '0'); else if(b == -1 || !isPrintableChar(b)) return minus ? -num : num; else throw new NoSuchElementException(); } } static int nextInt() { long num = nextLong(); if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num) throw new NumberFormatException(); return (int)num; } static double nextDouble() { return Double.parseDouble(next()); } static char nextChar() { if (!hasNext()) throw new NoSuchElementException(); return (char)readByte(); } static String nextLine() { while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++; if (!hasNextByte()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (b != '\n' && b != '\r') { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } static int[] nextArrayInt(int n) { int[] a = new int[n]; for (int i=0; i<n; i++) a[i] = nextInt(); return a; } }