Submission #1680116


Source Code Expand

//2017-10-13
//miaomiao
//
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>

using namespace std;

#define LL long long
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define N (100000+5)

int a[N];
bool had[N];

int main(){	
	int n;
	LL ans = 0;

	scanf("%d", &n);
	For(i, 1, n){
		scanf("%d", &a[i]);
		
		if(a[i] >= 2) had[i] = true;
		ans += a[i] >> 1; a[i] = a[i] & 1;
	}
	
	int lst = -1;

	For(i, 1, n){
		if(!a[i] && lst == -1) continue;

		if(a[i] && lst == -1){
			lst = i; continue;
		}

		if(lst != -1 && !a[i]){
			if(!had[i]) lst = -1;
			continue;
		}

		++ans; lst = -1;
	}

	printf("%lld\n", ans);

	return 0;
}

Submission Info

Submission Time
Task B - Simplified mahjong
User miaomiao
Language C++14 (GCC 5.4.1)
Score 400
Code Size 754 Byte
Status AC
Exec Time 13 ms
Memory 768 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:26:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   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 13 ms 768 KB
02.txt AC 13 ms 768 KB
03.txt AC 13 ms 768 KB
04.txt AC 12 ms 768 KB
05.txt AC 12 ms 768 KB
06.txt AC 12 ms 768 KB
07.txt AC 13 ms 768 KB
08.txt AC 12 ms 768 KB
09.txt AC 13 ms 768 KB
10.txt AC 13 ms 768 KB
11.txt AC 9 ms 640 KB
12.txt AC 13 ms 768 KB
13.txt AC 13 ms 768 KB
14.txt AC 13 ms 768 KB
15.txt AC 9 ms 640 KB
16.txt AC 13 ms 768 KB
17.txt AC 13 ms 768 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB