Submission #846604


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))

const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

int main(){
	int n;
	ll a[100010];
	scanf("%d",&n);
	rep(i,n){
		scanf("%lld",&a[i]);
	}
	
	ll cnt = 0;
	vector<ll> vec;
	rep(i,n){
		if(a[i] == 0)continue;
		if(a[i]%2 == 0){
			vec.pb(i);
			vec.pb(i);
			a[i] -= 2;
		}
		else{
			vec.pb(i);
			a[i] --;
		}
		cnt += a[i]/2;
	}
	
	for(int i = 0 ; i+1 < vec.size() ;){
		if(vec[i+1] <= vec[i]+1){
			cnt ++;
			i += 2;
		}
		else i ++;
	}
	cout << cnt << endl;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User yokozuna57
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1452 Byte
Status AC
Exec Time 35 ms
Memory 3188 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:42:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&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 33 ms 3188 KB
02.txt AC 34 ms 3188 KB
03.txt AC 33 ms 3188 KB
04.txt AC 27 ms 2168 KB
05.txt AC 27 ms 2168 KB
06.txt AC 27 ms 2168 KB
07.txt AC 30 ms 2168 KB
08.txt AC 29 ms 2168 KB
09.txt AC 33 ms 3188 KB
10.txt AC 33 ms 3188 KB
11.txt AC 18 ms 1024 KB
12.txt AC 35 ms 3188 KB
13.txt AC 29 ms 2168 KB
14.txt AC 29 ms 2168 KB
15.txt AC 20 ms 1660 KB
16.txt AC 34 ms 3188 KB
17.txt AC 33 ms 3188 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