Contest Duration: - (local time) (110 minutes) Back to Home

Submission #845353

Source Code Expand

Copy
/**
*    author:  itmo1
*    created: 21.08.2016 15:05:23
**/
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define mp make_pair
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),a.end()
#define pw(x) (1LL<<(x))

using namespace std;

typedef long long ll;
typedef double dbl;
typedef vector<int> vi;
typedef pair<int, int> pi;

const int inf = 1.01e9;
const dbl eps = 1e-9;

/* --- main part --- */

const int N = 1e5 + 10;

int a[N];

int main()
{
#ifdef home
assert(freopen("1.in", "r", stdin));
assert(freopen("1.out", "w", stdout));
#endif
int n;
scanf("%d", &n);
forn(i, n) scanf("%d", a + i);
ll res = 0;
forn(i, n)
{
int cnt = max(0, (a[i] - 1) / 2);
res += cnt;
a[i] -= cnt * 2;
}
forn(i, n)
{
if (a[i] == 2)
{
res++;
a[i] = 0;
}
else if (a[i] == 1 && a[i + 1] >= 1)
{
res++;
a[i] = 0;
a[i + 1]--;
}
}
printf("%lld\n", res);
#ifdef home
eprintf("time = %d ms\n", (int)(clock() * 1000. / CLOCKS_PER_SEC));
#endif
return 0;
}

#### Submission Info

Submission Time 2016-08-21 21:15:07+0900 B - Simplified mahjong enot C++14 (GCC 5.4.1) 400 1426 Byte AC 33 ms 640 KB

#### Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:43:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
forn(i, 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 26 ms 640 KB
02.txt AC 26 ms 640 KB
03.txt AC 26 ms 640 KB
04.txt AC 23 ms 640 KB
05.txt AC 23 ms 640 KB
06.txt AC 23 ms 640 KB
07.txt AC 26 ms 640 KB
08.txt AC 28 ms 640 KB
09.txt AC 26 ms 640 KB
10.txt AC 33 ms 640 KB
11.txt AC 18 ms 640 KB
12.txt AC 27 ms 640 KB
13.txt AC 26 ms 640 KB
14.txt AC 26 ms 640 KB
15.txt AC 18 ms 640 KB
16.txt AC 26 ms 640 KB
17.txt AC 26 ms 640 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 5 ms 256 KB