Submission #847034


Source Code Expand

Copy
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N;
	cin >> N;
	vector<int> A(N);
	long long sum =0;
	for(int i =0; i < N; i++) {
		cin >> A[i];
		sum +=A[i];}
	vector<long long> pE(N+1,-sum-tisic),pO(N+1,-sum-tisic);
	pE[0] =0;
	for(int i =0; i < N; i++) {
		if(A[i] == 0) {
			pE[i+1] =pE[i];
//			cout << pE[i+1] << "\n";
			continue;}
		pO[i+1] =max((A[i]-1)/2+pE[i],A[i]/2+pO[i]);
		pE[i+1] =max(A[i]/2+pE[i],(A[i]+1)/2+pO[i]);
		pE[i+1] =max(pE[i+1],pO[i+1]);
//		cout << pO[i+1] << " " << pE[i+1] << "\n";
		}
	cout << max(pE[N],pO[N]) << "\n";
	return 0;}

// look at my code
// my code is amazing

Submission Info

Submission Time
Task B - Simplified mahjong
User xellos
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1527 Byte
Status AC
Exec Time 27 ms
Memory 2176 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 26 ms 2176 KB
02.txt AC 26 ms 2176 KB
03.txt AC 26 ms 2176 KB
04.txt AC 23 ms 2176 KB
05.txt AC 23 ms 2176 KB
06.txt AC 23 ms 2176 KB
07.txt AC 25 ms 2176 KB
08.txt AC 25 ms 2176 KB
09.txt AC 26 ms 2176 KB
10.txt AC 27 ms 2176 KB
11.txt AC 18 ms 2176 KB
12.txt AC 27 ms 2176 KB
13.txt AC 26 ms 2176 KB
14.txt AC 26 ms 2176 KB
15.txt AC 18 ms 2176 KB
16.txt AC 27 ms 2176 KB
17.txt AC 27 ms 2176 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