Submission #1681115
Source Code Expand
#include <bits/stdc++.h> #define ll long long #define INF 1000000005 #define MOD 1000000007 #define EPS 1e-10 #define rep(i,n) for(int i=0;i<(int)(n);++i) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i) #define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i) #define each(a,b) for(auto (a): (b)) #define all(v) (v).begin(),(v).end() #define len(v) (int)(v).size() #define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end()) #define fi first #define se second #define pb push_back #define show(x) cout<<#x<<" = "<<(x)<<endl #define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl #define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl #define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl #define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl using namespace std; typedef pair<int,int> P; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<double> vd; typedef vector<P> vp; const int MAX_N = 100005; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vi vec(n); rep(i,n){ cin >> vec[i]; } ll val = 0; rep(i,n-1){ val += min(vec[i],vec[i+1]); vec[i+1] -= min(vec[i],vec[i+1]); } rep(i,n){ val += vec[i] / 2; } cout << val << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Simplified mahjong |
User | kopricky |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1430 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 640 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 | 12 ms | 640 KB |
02.txt | WA | 12 ms | 640 KB |
03.txt | WA | 12 ms | 640 KB |
04.txt | WA | 10 ms | 640 KB |
05.txt | WA | 10 ms | 640 KB |
06.txt | WA | 10 ms | 640 KB |
07.txt | WA | 11 ms | 640 KB |
08.txt | WA | 11 ms | 640 KB |
09.txt | WA | 12 ms | 640 KB |
10.txt | WA | 12 ms | 640 KB |
11.txt | AC | 8 ms | 640 KB |
12.txt | WA | 12 ms | 640 KB |
13.txt | WA | 11 ms | 640 KB |
14.txt | WA | 11 ms | 640 KB |
15.txt | AC | 7 ms | 640 KB |
16.txt | WA | 12 ms | 640 KB |
17.txt | WA | 12 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 | WA | 1 ms | 256 KB |
s2.txt | WA | 1 ms | 256 KB |