結果
問題 | No.1765 While Shining |
ユーザー | shojin_pro |
提出日時 | 2022-01-22 00:39:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 225 ms / 2,000 ms |
コード長 | 3,845 bytes |
コンパイル時間 | 1,999 ms |
コンパイル使用メモリ | 75,288 KB |
実行使用メモリ | 61,160 KB |
最終ジャッジ日時 | 2023-08-17 11:54:12 |
合計ジャッジ時間 | 7,333 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
49,768 KB |
testcase_01 | AC | 40 ms
49,576 KB |
testcase_02 | AC | 39 ms
49,640 KB |
testcase_03 | AC | 39 ms
49,760 KB |
testcase_04 | AC | 41 ms
50,012 KB |
testcase_05 | AC | 44 ms
49,960 KB |
testcase_06 | AC | 42 ms
49,644 KB |
testcase_07 | AC | 42 ms
49,652 KB |
testcase_08 | AC | 50 ms
50,444 KB |
testcase_09 | AC | 187 ms
56,048 KB |
testcase_10 | AC | 205 ms
56,384 KB |
testcase_11 | AC | 199 ms
56,168 KB |
testcase_12 | AC | 208 ms
57,060 KB |
testcase_13 | AC | 198 ms
56,000 KB |
testcase_14 | AC | 220 ms
56,644 KB |
testcase_15 | AC | 211 ms
56,388 KB |
testcase_16 | AC | 214 ms
56,688 KB |
testcase_17 | AC | 216 ms
56,616 KB |
testcase_18 | AC | 216 ms
56,540 KB |
testcase_19 | AC | 207 ms
56,164 KB |
testcase_20 | AC | 211 ms
56,452 KB |
testcase_21 | AC | 208 ms
55,952 KB |
testcase_22 | AC | 213 ms
56,216 KB |
testcase_23 | AC | 217 ms
56,564 KB |
testcase_24 | AC | 225 ms
61,160 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { static FastScanner sc = new FastScanner(System.in); static PrintWriter pw = new PrintWriter(System.out); static StringBuilder sb = new StringBuilder(); static long mod = (long) 1e9 + 7; public static void main(String[] args) throws Exception { solve(); pw.flush(); } public static void solve() { int n = sc.nextInt(); long ans = 0; Deque<Integer> dq = new ArrayDeque<Integer>(); for(int i = 0; i < n-1; i++){ if(dq.size() % 2 == 0){ if(sc.nextInt() == 1){ dq.add(i); }else{ dq.clear(); } }else{ if(sc.nextInt() == 0){ dq.add(i); }else{ dq.clear(); dq.add(i); } } ans += (dq.size()+1)/2; //pw.println(dq); } pw.println(ans); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } public static void save_sort(long[] array) { shuffle(array); Arrays.sort(array); } public static long[] shuffle(long[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); long randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public FastScanner(FileReader in) { reader = new BufferedReader(in); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }