Submission #5094720
Source Code Expand
#include <algorithm> #include <iostream> #include <cstdio> #include <cmath> using namespace std; const int mod = 1e9 + 7; const int N = 2e5 + 10; long long f[N][5]; int n, a[N]; int main() { scanf("%d", &n); for (int i = 1; i <= n ; i ++) scanf("%d", &a[i]); for (int i = 0; i < n ; i ++) { for (int j = 0; j < 5; j ++) f[i + 1][j] = 1e18; for (int j = 0; j < 5; j ++) for (int k = j; k < 5; k ++) if (k == 0 || k == 4) f[i + 1][k] = min(f[i + 1][k], f[i][j] + a[i + 1]); else if (k == 1 || k == 3) { if (a[i + 1] == 0) f[i + 1][k] = min(f[i + 1][k], f[i][j] + 2); else f[i + 1][k] = min(f[i + 1][k], f[i][j] + (a[i + 1] & 1)); } else f[i + 1][k] = min(f[i + 1][k], f[i][j] + ((a[i + 1] & 1) == 0)); } long long ans = 1e18; for (int i = 0; i < 5; i++) ans = min(ans, f[n][i]); printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Ears |
User | emengdeath |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 1180 Byte |
Status | RE |
Exec Time | 17 ms |
Memory | 2940 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.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, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | RE | 17 ms | 2940 KB |
02.txt | RE | 17 ms | 2940 KB |
03.txt | RE | 17 ms | 2940 KB |
04.txt | RE | 17 ms | 2940 KB |
05.txt | RE | 17 ms | 2940 KB |
06.txt | RE | 16 ms | 2940 KB |
07.txt | RE | 17 ms | 2940 KB |
08.txt | RE | 17 ms | 2940 KB |
09.txt | RE | 17 ms | 2940 KB |
10.txt | RE | 17 ms | 2940 KB |
11.txt | RE | 17 ms | 2940 KB |
12.txt | RE | 17 ms | 2940 KB |
13.txt | RE | 17 ms | 2940 KB |
14.txt | RE | 17 ms | 2940 KB |
15.txt | RE | 16 ms | 2940 KB |
16.txt | RE | 16 ms | 2940 KB |
17.txt | RE | 16 ms | 2940 KB |
18.txt | RE | 17 ms | 2940 KB |
19.txt | RE | 17 ms | 2940 KB |
20.txt | RE | 17 ms | 2940 KB |
21.txt | RE | 16 ms | 2940 KB |
22.txt | RE | 17 ms | 2940 KB |
23.txt | RE | 17 ms | 2940 KB |
24.txt | RE | 16 ms | 2940 KB |
25.txt | RE | 17 ms | 2940 KB |
26.txt | RE | 17 ms | 2940 KB |
27.txt | RE | 17 ms | 2940 KB |
28.txt | RE | 17 ms | 2940 KB |
29.txt | RE | 17 ms | 2940 KB |
30.txt | RE | 17 ms | 2940 KB |
31.txt | RE | 17 ms | 2940 KB |
32.txt | RE | 17 ms | 2940 KB |
33.txt | RE | 17 ms | 2940 KB |
34.txt | RE | 17 ms | 2940 KB |
35.txt | RE | 17 ms | 2940 KB |
36.txt | RE | 17 ms | 2940 KB |
37.txt | RE | 16 ms | 2940 KB |
38.txt | RE | 17 ms | 2940 KB |
39.txt | RE | 17 ms | 2940 KB |
40.txt | RE | 17 ms | 2940 KB |
41.txt | RE | 17 ms | 2940 KB |
42.txt | RE | 16 ms | 2940 KB |
s1.txt | RE | 17 ms | 2940 KB |
s2.txt | RE | 17 ms | 2940 KB |
s3.txt | RE | 17 ms | 2940 KB |