Submission #845141


Source Code Expand

Copy
#include <bits/stdc++.h>

using namespace std;

#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()

template<typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

typedef long long LL;

const int oo = 0x3f3f3f3f;

const int maxn = 100000;

LL dp[maxn + 5][2];

int n;
int a[maxn + 5];

int main()
{
#ifdef matthew99
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	memset(dp, -oo, sizeof dp);
	scanf("%d", &n);
	REP(i, 0, n) scanf("%d", a + i);
	dp[0][0] = 0;
	REP(i, 0, n) REP(j, 0, 2) if (dp[i][j] >= 0)
	{
		REP(k, 0, min(a[i], 1) + 1)
		{
			int tmp = (a[i] - k) >> 1;
			int res = a[i] - (tmp << 1) - k;
			if (j && k) chkmax(dp[i + 1][res], dp[i][j] + tmp + 1);
			else chkmax(dp[i + 1][k], dp[i][j] + tmp);
		}
	}
	cout << max(dp[n][0], dp[n][1]) << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User matthew99
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1193 Byte
Status AC
Exec Time 29 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:35:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:36:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, 0, n) scanf("%d", a + i);
                                 ^

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 29 ms 2176 KB
02.txt AC 29 ms 2176 KB
03.txt AC 29 ms 2176 KB
04.txt AC 26 ms 2176 KB
05.txt AC 27 ms 2176 KB
06.txt AC 27 ms 2176 KB
07.txt AC 28 ms 2176 KB
08.txt AC 28 ms 2176 KB
09.txt AC 29 ms 2176 KB
10.txt AC 29 ms 2176 KB
11.txt AC 19 ms 2176 KB
12.txt AC 29 ms 2176 KB
13.txt AC 28 ms 2176 KB
14.txt AC 28 ms 2176 KB
15.txt AC 20 ms 2176 KB
16.txt AC 29 ms 2176 KB
17.txt AC 29 ms 2176 KB
18.txt AC 6 ms 1792 KB
19.txt AC 6 ms 1792 KB
20.txt AC 6 ms 1792 KB
21.txt AC 6 ms 1792 KB
22.txt AC 6 ms 1792 KB
s1.txt AC 6 ms 1792 KB
s2.txt AC 6 ms 1792 KB