Submission #845414
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII; typedef pair<LL, LL> PLL;
typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<VVI> VVVI;
typedef vector<LL> VLL; typedef vector<VLL> VVLL; typedef vector<VVLL> VVVLL;
typedef vector<double> VD; typedef vector<VD> VVD; typedef vector<VVD> VVVD;
typedef vector<string> VS; typedef vector<VS> VVS; typedef vector<VVS> VVVS;
typedef vector<bool> VB; typedef vector<VB> VVB; typedef vector<VVB> VVVB;
typedef vector<PII> VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL> VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;
typedef unsigned int UI;
typedef vector<UI> VUI;
typedef vector<VUI> VVUI;
#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N) for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP(x) cerr << #x << " = " << (x) << endl
template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a) { OSS oss; oss << a; return oss.str(); };
template<typename T=int> inline void dump(vector<T> vs, bool ent=false) { rep(i, vs.size()) cout << vs[i] << (i+1==vs.size() ? '\n' : ' '); if (ent) cout << endl; }
template<typename T = int> inline void dump(vector<vector<T>> vs, bool ent=false) { rep(i, vs.size()) dump<T>(vs[i]); if (ent) cout << endl; }
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int DX[] = {1, 0, -1, 0};
const int DY[] = {0, -1, 0, 1};
const double EPS = 1e-12;
// const double PI = acos(-1.0);
template<typename T = int> inline T in() { T x; cin >> x; return x; }
template<typename T = int> inline vector<T> in(int n) { vector<T> xs(n); rep(i, n) cin >> xs[i]; return xs; }
template<typename T = int> inline vector<vector<T>> in(int n, int m) { vector<vector<T>> xs(n, vector<T>(m)); rep(i, n) rep(j, m) cin >> xs[i][j]; return xs; }
int main(void) {
int N = in();
VI as = in(N);
VI dp(N + 1);
rep(i, N) {
dp[i + 1] = dp[i] + as[i] / 2;
if (i + 1 < N) {
dp[i + 2] = dp[i] + min(as[i], as[i + 1]);
}
}
cout << dp[N] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Simplified mahjong |
User |
snakazawa |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3064 Byte |
Status |
WA |
Exec Time |
81 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 |
75 ms |
1024 KB |
02.txt |
WA |
77 ms |
1024 KB |
03.txt |
WA |
77 ms |
1024 KB |
04.txt |
WA |
60 ms |
1024 KB |
05.txt |
WA |
60 ms |
1024 KB |
06.txt |
WA |
56 ms |
1024 KB |
07.txt |
WA |
70 ms |
1024 KB |
08.txt |
WA |
70 ms |
1024 KB |
09.txt |
WA |
75 ms |
1024 KB |
10.txt |
WA |
75 ms |
1024 KB |
11.txt |
AC |
37 ms |
1024 KB |
12.txt |
WA |
81 ms |
1024 KB |
13.txt |
WA |
78 ms |
1024 KB |
14.txt |
WA |
76 ms |
1024 KB |
15.txt |
AC |
35 ms |
1024 KB |
16.txt |
WA |
81 ms |
1024 KB |
17.txt |
WA |
77 ms |
1024 KB |
18.txt |
AC |
4 ms |
256 KB |
19.txt |
AC |
4 ms |
256 KB |
20.txt |
AC |
4 ms |
256 KB |
21.txt |
AC |
4 ms |
256 KB |
22.txt |
AC |
4 ms |
256 KB |
s1.txt |
AC |
4 ms |
256 KB |
s2.txt |
AC |
4 ms |
256 KB |