oj.uz

Submission #542428

# Submission time Handle Problem Language Result Execution time Memory
542428 2022-03-26T17:18:15 Z two_sides Minerals (JOI19_minerals) C++17
90 / 100
 88 ms 4580 KB 
#include "minerals.h"
#include <bits/stdc++.h>


namespace {
    using namespace std;

    const int N = 43005;

    int cost[N], best[N], cur = 0;

    mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

    void Prepare() {
        cost[2] = 2; best[2] = 1;
        for (int i = 3; i < N; i++) {
            int j = best[i - 1];
            if (cost[i - j - 1] + cost[j + 1] +
            j + 1 < cost[i - j] + cost[j] + j) j++;
            cost[i] = cost[i - j] + cost[j] + j + i;
            best[i] = j;
        }
    }

    void Split(vector<int> x, vector<int> y, bool f) {
        shuffle(x.begin(), x.end(), rng);
        shuffle(y.begin(), y.end(), rng);
        if (x.size() == 2) {
            cur = Query(x[f]);
            int nxt = Query(y[0]);
            if (cur != nxt) {
                Answer(x[0], y[0]);
                Answer(x[1], y[1]);
            } else {
                Answer(x[0], y[1]);
                Answer(x[1], y[0]);
            }
            cur = nxt; return;
        }
        if (x.size() == 1)
            return Answer(x[0], y[0]);
        int n = x.size(), len = best[n];
        vector<int> nx[2], ny[2];
        for (int i = 0; i < len; i++) {
            nx[f ^ 1].push_back(x[i]);
            cur = Query(x[i]);
        }
        for (int i = len; i < n; i++)
            nx[f].push_back(x[i]);
        for (int i = 0; i < n; i++) {
            if (nx[0].size() == ny[0].size()) {
                ny[1].push_back(y[i]); continue;
            }
            int nxt = Query(y[i]);
            if (cur != nxt)
                ny[1].push_back(y[i]);
            else ny[0].push_back(y[i]);
            cur = nxt;
        }
        Split(nx[0], ny[0], 0);
        Split(nx[1], ny[1], 1);
    }
}

void Solve(int n) {
    Prepare(); vector<int> x, y;
    for (int i = 1; i <= 2 * n; i++) {
        int nxt = Query(i);
        if (nxt != cur) x.push_back(i);
        else y.push_back(i);
        cur = nxt;
    }
    cerr<<cost[43000];
    Split(x, y, 0);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 720 KB Output is correct
2 Correct 3 ms 720 KB Output is correct
3 Correct 6 ms 1104 KB Output is correct
4 Correct 11 ms 1332 KB Output is correct
5 Correct 22 ms 1872 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 6 ms 1104 KB Output is correct
8 Correct 11 ms 1332 KB Output is correct
9 Correct 22 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 24 ms 2000 KB Output is correct
13 Correct 25 ms 2004 KB Output is correct
14 Correct 24 ms 1944 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 6 ms 1104 KB Output is correct
8 Correct 11 ms 1332 KB Output is correct
9 Correct 22 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 24 ms 2000 KB Output is correct
13 Correct 25 ms 2004 KB Output is correct
14 Correct 24 ms 1944 KB Output is correct
15 Correct 66 ms 4096 KB Output is correct
16 Correct 64 ms 4040 KB Output is correct
17 Correct 63 ms 4076 KB Output is correct
18 Correct 58 ms 3924 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 6 ms 1104 KB Output is correct
8 Correct 11 ms 1332 KB Output is correct
9 Correct 22 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 24 ms 2000 KB Output is correct
13 Correct 25 ms 2004 KB Output is correct
14 Correct 24 ms 1944 KB Output is correct
15 Correct 66 ms 4096 KB Output is correct
16 Correct 64 ms 4040 KB Output is correct
17 Correct 63 ms 4076 KB Output is correct
18 Correct 58 ms 3924 KB Output is correct
19 Correct 67 ms 4172 KB Output is correct
20 Correct 75 ms 4288 KB Output is correct
21 Correct 61 ms 4248 KB Output is correct
22 Correct 72 ms 3984 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 6 ms 1104 KB Output is correct
8 Correct 11 ms 1332 KB Output is correct
9 Correct 22 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 24 ms 2000 KB Output is correct
13 Correct 25 ms 2004 KB Output is correct
14 Correct 24 ms 1944 KB Output is correct
15 Correct 66 ms 4096 KB Output is correct
16 Correct 64 ms 4040 KB Output is correct
17 Correct 63 ms 4076 KB Output is correct
18 Correct 58 ms 3924 KB Output is correct
19 Correct 67 ms 4172 KB Output is correct
20 Correct 75 ms 4288 KB Output is correct
21 Correct 61 ms 4248 KB Output is correct
22 Correct 72 ms 3984 KB Output is correct
23 Correct 69 ms 4328 KB Output is correct
24 Correct 68 ms 4372 KB Output is correct
25 Correct 62 ms 4340 KB Output is correct
26 Correct 62 ms 4132 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 6 ms 1104 KB Output is correct
8 Correct 11 ms 1332 KB Output is correct
9 Correct 22 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 24 ms 2000 KB Output is correct
13 Correct 25 ms 2004 KB Output is correct
14 Correct 24 ms 1944 KB Output is correct
15 Correct 66 ms 4096 KB Output is correct
16 Correct 64 ms 4040 KB Output is correct
17 Correct 63 ms 4076 KB Output is correct
18 Correct 58 ms 3924 KB Output is correct
19 Correct 67 ms 4172 KB Output is correct
20 Correct 75 ms 4288 KB Output is correct
21 Correct 61 ms 4248 KB Output is correct
22 Correct 72 ms 3984 KB Output is correct
23 Correct 69 ms 4328 KB Output is correct
24 Correct 68 ms 4372 KB Output is correct
25 Correct 62 ms 4340 KB Output is correct
26 Correct 62 ms 4132 KB Output is correct
27 Correct 88 ms 4332 KB Output is correct
28 Correct 70 ms 4332 KB Output is correct
29 Correct 62 ms 4476 KB Output is correct
30 Correct 61 ms 4200 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 6 ms 1104 KB Output is correct
8 Correct 11 ms 1332 KB Output is correct
9 Correct 22 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 24 ms 2000 KB Output is correct
13 Correct 25 ms 2004 KB Output is correct
14 Correct 24 ms 1944 KB Output is correct
15 Correct 66 ms 4096 KB Output is correct
16 Correct 64 ms 4040 KB Output is correct
17 Correct 63 ms 4076 KB Output is correct
18 Correct 58 ms 3924 KB Output is correct
19 Correct 67 ms 4172 KB Output is correct
20 Correct 75 ms 4288 KB Output is correct
21 Correct 61 ms 4248 KB Output is correct
22 Correct 72 ms 3984 KB Output is correct
23 Correct 69 ms 4328 KB Output is correct
24 Correct 68 ms 4372 KB Output is correct
25 Correct 62 ms 4340 KB Output is correct
26 Correct 62 ms 4132 KB Output is correct
27 Correct 88 ms 4332 KB Output is correct
28 Correct 70 ms 4332 KB Output is correct
29 Correct 62 ms 4476 KB Output is correct
30 Correct 61 ms 4200 KB Output is correct
31 Correct 72 ms 4424 KB Output is correct
32 Correct 85 ms 4580 KB Output is correct
33 Correct 69 ms 4532 KB Output is correct
34 Correct 65 ms 4376 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 6 ms 1104 KB Output is correct
8 Correct 11 ms 1332 KB Output is correct
9 Correct 22 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 24 ms 2000 KB Output is correct
13 Correct 25 ms 2004 KB Output is correct
14 Correct 24 ms 1944 KB Output is correct
15 Correct 66 ms 4096 KB Output is correct
16 Correct 64 ms 4040 KB Output is correct
17 Correct 63 ms 4076 KB Output is correct
18 Correct 58 ms 3924 KB Output is correct
19 Correct 67 ms 4172 KB Output is correct
20 Correct 75 ms 4288 KB Output is correct
21 Correct 61 ms 4248 KB Output is correct
22 Correct 72 ms 3984 KB Output is correct
23 Correct 69 ms 4328 KB Output is correct
24 Correct 68 ms 4372 KB Output is correct
25 Correct 62 ms 4340 KB Output is correct
26 Correct 62 ms 4132 KB Output is correct
27 Correct 88 ms 4332 KB Output is correct
28 Correct 70 ms 4332 KB Output is correct
29 Correct 62 ms 4476 KB Output is correct
30 Correct 61 ms 4200 KB Output is correct
31 Correct 72 ms 4424 KB Output is correct
32 Correct 85 ms 4580 KB Output is correct
33 Correct 69 ms 4532 KB Output is correct
34 Correct 65 ms 4376 KB Output is correct
35 Incorrect 74 ms 4524 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -