Submission #1594799
Source Code Expand
using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.IO; using System.Text; using System.Globalization; using System.Diagnostics; class Myon { public Myon() { } public static int Main() { new Myon().calc(); return 0; } Scanner cin; void calc() { cin = new Scanner(); int N = cin.nextInt(); int[] a = cin.ArrayInt(N); long ans = 0; for (int i = 0; i < N; i++) { ans += a[i] / 2; a[i] %= 2; if(i != N - 1 && a[i] >= 1 && a[i+1] >= 1) { a[i]--; a[i + 1]--; ans += 1; } } Console.WriteLine(ans); } } class Scanner { string[] s; int i; char[] cs = new char[] { ' '}; public Scanner() { s = new string[0]; i = 0; } public string next() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); if (s.Length == 0) return next(); i = 0; return s[i++]; } public int nextInt() { return int.Parse(next()); } public int[] ArrayInt(int N, int add = 0) { int[] Array = new int[N]; for (int i = 0; i < N; i++) { Array[i] = nextInt() + add; } return Array; } public long nextLong() { return long.Parse(next()); } public long[] ArrayLong(int N, long add = 0) { long[] Array = new long[N]; for (int i = 0; i < N; i++) { Array[i] = nextLong() + add; } return Array; } public double nextDouble() { return double.Parse(next()); } public double[] ArrayDouble(int N, double add = 0) { double[] Array = new double[N]; for (int i = 0; i < N; i++) { Array[i] = nextDouble() + add; } return Array; } }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | chokudai |
Language | C# (Mono 4.6.2.0) |
Score | 400 |
Code Size | 2228 Byte |
Status | AC |
Exec Time | 72 ms |
Memory | 17336 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 71 ms | 13280 KB |
02.txt | AC | 72 ms | 15328 KB |
03.txt | AC | 71 ms | 13396 KB |
04.txt | AC | 66 ms | 13280 KB |
05.txt | AC | 64 ms | 15328 KB |
06.txt | AC | 62 ms | 13280 KB |
07.txt | AC | 67 ms | 13280 KB |
08.txt | AC | 69 ms | 15328 KB |
09.txt | AC | 70 ms | 13396 KB |
10.txt | AC | 71 ms | 13280 KB |
11.txt | AC | 53 ms | 13280 KB |
12.txt | AC | 72 ms | 13280 KB |
13.txt | AC | 69 ms | 13396 KB |
14.txt | AC | 69 ms | 13396 KB |
15.txt | AC | 54 ms | 15328 KB |
16.txt | AC | 72 ms | 17336 KB |
17.txt | AC | 71 ms | 13280 KB |
18.txt | AC | 20 ms | 9044 KB |
19.txt | AC | 19 ms | 9044 KB |
20.txt | AC | 19 ms | 9044 KB |
21.txt | AC | 20 ms | 9044 KB |
22.txt | AC | 19 ms | 9044 KB |
s1.txt | AC | 19 ms | 9044 KB |
s2.txt | AC | 19 ms | 9044 KB |