Submission #844835
Source Code Expand
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include<list>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(i = 0; i < n; i++)
#define FORAB(i, a, b) for(i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C) ((B) <= (A) && (A) <= (C))
typedef pair<int,int> PII;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<PII > VP;
#define AIN(A, B, C) assert(IN(A, B, C))
//typedef int LL;
typedef long long int LL;
//typedef __int64 LL;
LL A[100005];
int main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lld", &A[i]);
LL ans = 0;
int last = 0;
for (int i = 1; i <= n; i++) {
if (last) {
if (A[i]) {
A[i]--;
last = 0;
ans++;
}
}
ans += A[i] / 2;
last = A[i] % 2;
}
printf("%lld\n", ans);
return 0;
}
Submission Info
Submission Time
2016-08-21 21:07:51+0900
Task
B - Simplified mahjong
User
dragoon
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
1461 Byte
Status
AC
Exec Time
30 ms
Memory
1024 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:52:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:53:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for (int i = 1; i <= n; i++) scanf("%lld", &A[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
400 / 400
Status
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
27 ms
1024 KB
02.txt
AC
27 ms
1024 KB
03.txt
AC
28 ms
1024 KB
04.txt
AC
25 ms
1024 KB
05.txt
AC
23 ms
1024 KB
06.txt
AC
23 ms
1024 KB
07.txt
AC
27 ms
1024 KB
08.txt
AC
26 ms
1024 KB
09.txt
AC
27 ms
1024 KB
10.txt
AC
26 ms
1024 KB
11.txt
AC
17 ms
1024 KB
12.txt
AC
27 ms
1024 KB
13.txt
AC
26 ms
1024 KB
14.txt
AC
26 ms
1024 KB
15.txt
AC
18 ms
1024 KB
16.txt
AC
27 ms
1024 KB
17.txt
AC
30 ms
1024 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