Submission #7910863
Source Code Expand
#include<bits/stdc++.h> typedef long long ll; ll gi(){ ll x=0,f=1; char ch=getchar(); while(!isdigit(ch))f^=ch=='-',ch=getchar(); while(isdigit(ch))x=x*10+ch-'0',ch=getchar(); return f?x:-x; } int a[100010]; int main(){ #ifdef XZZSB freopen("in.in","r",stdin); freopen("out.out","w",stdout); #endif int n=gi(); for(int i=1;i<=n;++i)a[i]=gi(); ll ans=0; for(int i=1;i<=n;++i){ ans+=a[i]>>1;a[i]&=1; if(a[i]&&a[i+1])--a[i],--a[i+1],++ans; } printf("%lld\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | test12345 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 491 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 640 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 | 10 ms | 640 KB |
02.txt | AC | 10 ms | 640 KB |
03.txt | AC | 10 ms | 640 KB |
04.txt | AC | 7 ms | 640 KB |
05.txt | AC | 7 ms | 640 KB |
06.txt | AC | 7 ms | 640 KB |
07.txt | AC | 9 ms | 640 KB |
08.txt | AC | 9 ms | 640 KB |
09.txt | AC | 10 ms | 640 KB |
10.txt | AC | 10 ms | 640 KB |
11.txt | AC | 3 ms | 640 KB |
12.txt | AC | 10 ms | 640 KB |
13.txt | AC | 9 ms | 640 KB |
14.txt | AC | 9 ms | 640 KB |
15.txt | AC | 4 ms | 640 KB |
16.txt | AC | 10 ms | 640 KB |
17.txt | AC | 10 ms | 640 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |