Submission #844802


Source Code Expand

Copy
#include <sstream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cassert>
#include <ctime>
#include <map>
#include <math.h>
#include <cstdio>
#include <set>
#include <deque>
#include <memory.h>
#include <queue>

#pragma comment(linker, "/STACK:64000000")
typedef long long ll;

using namespace std;

const int MAXN = 1 << 18;
const int MOD = 1; // 1000 * 1000 * 1000 + 7;
const int INF = 2e9;
const double PI = acos(-1.0);

void go(ll &a, ll b) {
	if (a < b) a = b;
}

int main() {
#ifdef _MSC_VER
	freopen("input.txt", "r", stdin);
#endif

	int n;
	while (cin >> n) {
		vector<int> a(n);
		for (int i = 0; i < n; i++) cin >> a[i];

		vector<vector<ll> > dp(n + 1, vector<ll>(2, -1));
		dp[0][0] = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < 2; j++) {
				if (dp[i][j] == -1) continue;
				if (j == 0) {
					go(dp[i + 1][a[i] % 2], dp[i][j] + a[i] / 2);
				}
				else {
					if (a[i] == 0) go(dp[i + 1][0], dp[i][j]);
					else {
						int cc = a[i] + 1;
						go(dp[i + 1][cc % 2], dp[i][j] + cc / 2);
					}
				}
				//int cc = a[i] + j;
				//dp[i + 1][cc % 2] = max(dp[i + 1][cc % 2], dp[i][j] + cc / 2);
			}
		}
		cout << max(dp[n][0], dp[n][1]) << endl;
	}

	return 0;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User izban
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1337 Byte
Status AC
Exec Time 96 ms
Memory 6144 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 24
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 94 ms 6144 KB
02.txt AC 93 ms 6144 KB
03.txt AC 91 ms 6144 KB
04.txt AC 74 ms 6144 KB
05.txt AC 71 ms 6144 KB
06.txt AC 71 ms 6144 KB
07.txt AC 84 ms 6144 KB
08.txt AC 83 ms 6144 KB
09.txt AC 91 ms 6144 KB
10.txt AC 91 ms 6144 KB
11.txt AC 49 ms 6144 KB
12.txt AC 96 ms 6144 KB
13.txt AC 91 ms 6144 KB
14.txt AC 91 ms 6144 KB
15.txt AC 52 ms 6144 KB
16.txt AC 90 ms 6144 KB
17.txt AC 90 ms 6144 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