Submission #845973
Source Code Expand
# define _CRT_SECUREj_NO_WARNINGS 1 # define _USE_MATH_DEFINES # include <iostream> # include <numeric> # include <string> # include <bitset> # include <vector> # include <algorithm> # include <cstdlib> # include <cstdio> # include <cstring> # include <cstdlib> # include <iomanip> # include <queue> # include <sstream> # include <climits> # include <cmath> # include <list> # include <functional> # include <string> # include <ctime> # include <set> # include <forward_list> # include <map> # include <stack> using namespace std; # define INF ((int)(1<<25)) # define REP(i,n) for(int i=0;i<(int)n;i++) # define FOR(i,n) REP(i,n) # define FORI(i,k,n) for(int i=k;i<(int)n;i++) # define TORAD 2.0*M_PI/360.0 # define INT(x) int x;cin>>x; # define ALL(x) (x).begin(),(x).end() # define RALL(x) (x).rbegin(),(x).rend() # define DEBUG(x) cout<<#x<<":"<<x<<endl; # define EPS 1e-12 #ifdef _MSC_VER #include <intrin.h> #define __builtin_popcount __popcnt #endif typedef long long lint; typedef vector<int> vi; typedef vector<string> vs; typedef pair<int, int> pii; typedef pair<int, pii> piii; const int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 }; template<class T> void debug(T a) { for (auto i : a)cout << i << endl; } const int M = 100010; int main() { lint ans = 0; lint n; lint a[M] = {}; cin >> n; FORI(i, 1, n + 1) { cin >> a[i]; } FORI(i, 1, n + 1) { if (a[i] % 2 && a[i - 1]) { ans++; a[i]--; a[i - 1]--; } } FORI(i, 1, n + 1) { ans += a[i] / 2; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | yukitohj |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1590 Byte |
Status | WA |
Exec Time | 123 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 119 ms | 1024 KB |
02.txt | WA | 118 ms | 1024 KB |
03.txt | WA | 118 ms | 1024 KB |
04.txt | WA | 65 ms | 1024 KB |
05.txt | WA | 77 ms | 1024 KB |
06.txt | WA | 77 ms | 1024 KB |
07.txt | WA | 102 ms | 1024 KB |
08.txt | WA | 102 ms | 1024 KB |
09.txt | WA | 118 ms | 1024 KB |
10.txt | WA | 118 ms | 1024 KB |
11.txt | AC | 33 ms | 1024 KB |
12.txt | AC | 123 ms | 1024 KB |
13.txt | WA | 120 ms | 1024 KB |
14.txt | WA | 119 ms | 1024 KB |
15.txt | AC | 36 ms | 1024 KB |
16.txt | WA | 117 ms | 1024 KB |
17.txt | WA | 118 ms | 1024 KB |
18.txt | AC | 5 ms | 1024 KB |
19.txt | AC | 5 ms | 1024 KB |
20.txt | AC | 5 ms | 1024 KB |
21.txt | AC | 6 ms | 1024 KB |
22.txt | AC | 6 ms | 1024 KB |
s1.txt | AC | 6 ms | 1024 KB |
s2.txt | AC | 5 ms | 1024 KB |