ソースコード 拡げる

Copy
```#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
int N; cin >> N;
vector<int> a(N);
for (int& x : a) cin >> x;
ll ans = 0;
for (int& x: a) {
if (x <= 10) continue;
int y = 10 + x % 2;
ans += (x - y) / 2;
x = y;
}
vector<int> v;
for (int i = 0; i < N; i++)
while (a[i]--)
v.push_back(i);
int M = v.size();
for (int i = 0; i + 1 < M;) {
if (v[i + 1] - v[i] >= 2) i++;
else {
i += 2;
ans++;
}
}
cout << ans << endl;
}
```

#### 提出情報

提出日時 2016-08-21 21:09:26+0900 B - Simplified mahjong sugim48 C++14 (GCC 5.4.1) 400 1133 Byte AC 106 ms 8940 KB

#### ジャッジ結果

セット名 Sample All

 AC × 2
 AC × 24
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
01.txt AC 106 ms 8940 KB
02.txt AC 102 ms 8940 KB
03.txt AC 102 ms 8940 KB
04.txt AC 73 ms 4848 KB
05.txt AC 72 ms 4848 KB
06.txt AC 70 ms 4848 KB
07.txt AC 86 ms 4848 KB
08.txt AC 85 ms 4848 KB
09.txt AC 105 ms 8940 KB
10.txt AC 94 ms 4848 KB
11.txt AC 33 ms 640 KB
12.txt AC 101 ms 4848 KB
13.txt AC 105 ms 8940 KB
14.txt AC 105 ms 8940 KB
15.txt AC 34 ms 1024 KB
16.txt AC 105 ms 8940 KB
17.txt AC 105 ms 8940 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