oj.uz

Submission #680285

# Submission time Handle Problem Language Result Execution time Memory
680285 2023-01-10T13:16:07 Z mjhmjh1104 Tortoise (CEOI21_tortoise) C++17
18 / 100
 33 ms 4260 KB 
#include <map>
#include <tuple>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int n, a[500006], dist[500006], res;
vector<int> playgrounds;
int pv[500006], nx[500006];

map<tuple<int, int, int, int, int>, int> mem;

int f(int x, int y, int z, int w, int p) {
    if (y > 2 * n - 2) return 0;
    if (mem.find({ x, y, z, w, p }) != mem.end()) return mem[{ x, y, z, w, p }];
    if (w && a[x] == -1) return f(x, y, z, 0, p);
    int res = 0;
    if (w && a[x] != -1) res = max(res, f(x + 1, y - 1, min(n, max(a[x + 1], 0)), 1, p));
    if (x < n - 1) res = max(res, f(x + 1, y + 1, min(n, max(a[x + 1], 0)), 0, p));
    if (pv[x] != -1 && z > 0 && y <= 2 * x) {
        int dist = x - pv[x];
        int N = min(z, (2 * x - y) / (2 * dist) + 1);
        res = max(res, f(x, y + 2 * dist * N, z - N, 0, p) + N);
        //if (!p) for (int i = 1; i <= N; i++) res = max(res, f(x, y + 2 * dist * i, z - i, 0, 1) + i);
    }
    if (nx[x] != -1 && z > 0 && y <= 2 * x) {
        int dist = nx[x] - x;
        int N = min(z, (2 * x - y) / (2 * dist) + 1);
        res = max(res, f(x, y + 2 * dist * N, z - N, 1, p) + N);
        //if (!p) for (int i = 1; i <= N; i++) res = max(res, f(x, y + 2 * dist * i, z - i, 0, 1) + i);
    }
    return mem[{ x, y, z, w, p }] = res;
}

int main() {
    scanf("%d", &n);
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", a + i);
        sum += max(a[i], 0);
        dist[i] = (int)1e9;
        if (a[i] < 0) playgrounds.push_back(i);
    }
    for (int i = 0; i < n; i++) {
        int it = lower_bound(playgrounds.begin(), playgrounds.end(), i) - playgrounds.begin();
        if (it == (int)playgrounds.size()) nx[i] = -1;
        else nx[i] = playgrounds[it];
        it = upper_bound(playgrounds.begin(), playgrounds.end(), i) - playgrounds.begin() - 1;
        if (it == -1) pv[i] = -1;
        else pv[i] = playgrounds[it];
    }
    {
        int tmp = (int)1e9;
        for (int i = 0; i < n; i++) {
            if (a[i] == -1) tmp = 0;
            dist[i] = min(dist[i], tmp);
            tmp++;
        }
        tmp = (int)1e9;
        for (int i = n - 1; i >= 0; i--) {
            if (a[i] == -1) tmp = 0;
            dist[i] = min(dist[i], tmp);
            tmp++;
        }
    }
    printf("%lld", sum - f(0, 0, min(n, max(a[0], 0)), 0, 0));
}

Compilation message

tortoise.cpp: In function 'int main()':
tortoise.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
tortoise.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         scanf("%d", a + i);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 19 ms 2772 KB Output is correct
28 Correct 33 ms 4260 KB Output is correct
29 Correct 26 ms 3576 KB Output is correct
30 Correct 18 ms 2708 KB Output is correct
31 Correct 25 ms 3468 KB Output is correct
32 Correct 15 ms 2224 KB Output is correct
33 Correct 31 ms 3404 KB Output is correct
34 Correct 21 ms 2888 KB Output is correct
35 Correct 28 ms 3292 KB Output is correct
36 Correct 22 ms 3140 KB Output is correct
37 Correct 23 ms 3316 KB Output is correct
38 Correct 23 ms 3236 KB Output is correct
39 Correct 24 ms 3532 KB Output is correct
40 Correct 20 ms 3120 KB Output is correct
41 Correct 21 ms 3104 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 19 ms 2772 KB Output is correct
28 Correct 33 ms 4260 KB Output is correct
29 Correct 26 ms 3576 KB Output is correct
30 Correct 18 ms 2708 KB Output is correct
31 Correct 25 ms 3468 KB Output is correct
32 Correct 15 ms 2224 KB Output is correct
33 Correct 31 ms 3404 KB Output is correct
34 Correct 21 ms 2888 KB Output is correct
35 Correct 28 ms 3292 KB Output is correct
36 Correct 22 ms 3140 KB Output is correct
37 Correct 23 ms 3316 KB Output is correct
38 Correct 23 ms 3236 KB Output is correct
39 Correct 24 ms 3532 KB Output is correct
40 Correct 20 ms 3120 KB Output is correct
41 Correct 21 ms 3104 KB Output is correct
42 Correct 6 ms 1364 KB Output is correct
43 Incorrect 10 ms 1748 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 19 ms 2772 KB Output is correct
28 Correct 33 ms 4260 KB Output is correct
29 Correct 26 ms 3576 KB Output is correct
30 Correct 18 ms 2708 KB Output is correct
31 Correct 25 ms 3468 KB Output is correct
32 Correct 15 ms 2224 KB Output is correct
33 Correct 31 ms 3404 KB Output is correct
34 Correct 21 ms 2888 KB Output is correct
35 Correct 28 ms 3292 KB Output is correct
36 Correct 22 ms 3140 KB Output is correct
37 Correct 23 ms 3316 KB Output is correct
38 Correct 23 ms 3236 KB Output is correct
39 Correct 24 ms 3532 KB Output is correct
40 Correct 20 ms 3120 KB Output is correct
41 Correct 21 ms 3104 KB Output is correct
42 Correct 6 ms 1364 KB Output is correct
43 Incorrect 10 ms 1748 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 19 ms 2772 KB Output is correct
28 Correct 33 ms 4260 KB Output is correct
29 Correct 26 ms 3576 KB Output is correct
30 Correct 18 ms 2708 KB Output is correct
31 Correct 25 ms 3468 KB Output is correct
32 Correct 15 ms 2224 KB Output is correct
33 Correct 31 ms 3404 KB Output is correct
34 Correct 21 ms 2888 KB Output is correct
35 Correct 28 ms 3292 KB Output is correct
36 Correct 22 ms 3140 KB Output is correct
37 Correct 23 ms 3316 KB Output is correct
38 Correct 23 ms 3236 KB Output is correct
39 Correct 24 ms 3532 KB Output is correct
40 Correct 20 ms 3120 KB Output is correct
41 Correct 21 ms 3104 KB Output is correct
42 Correct 6 ms 1364 KB Output is correct
43 Incorrect 10 ms 1748 KB Output isn't correct
44 Halted 0 ms 0 KB -