oj.uz

Submission #542434

# Submission time Handle Problem Language Result Execution time Memory
542434 2022-03-26T17:25:31 Z two_sides Minerals (JOI19_minerals) C++17
100 / 100
 51 ms 4596 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) {
        
        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]);
            else if (nx[1].size() == ny[1].size())
                ny[0].push_back(y[i]);
            else {
                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;
    }
    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 1 ms 720 KB Output is correct
2 Correct 2 ms 720 KB Output is correct
3 Correct 4 ms 976 KB Output is correct
4 Correct 8 ms 1232 KB Output is correct
5 Correct 13 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 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 8 ms 1232 KB Output is correct
9 Correct 13 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 14 ms 1940 KB Output is correct
13 Correct 10 ms 2000 KB Output is correct
14 Correct 11 ms 1872 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 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 8 ms 1232 KB Output is correct
9 Correct 13 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 14 ms 1940 KB Output is correct
13 Correct 10 ms 2000 KB Output is correct
14 Correct 11 ms 1872 KB Output is correct
15 Correct 38 ms 3980 KB Output is correct
16 Correct 35 ms 4072 KB Output is correct
17 Correct 26 ms 3952 KB Output is correct
18 Correct 29 ms 3848 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 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 8 ms 1232 KB Output is correct
9 Correct 13 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 14 ms 1940 KB Output is correct
13 Correct 10 ms 2000 KB Output is correct
14 Correct 11 ms 1872 KB Output is correct
15 Correct 38 ms 3980 KB Output is correct
16 Correct 35 ms 4072 KB Output is correct
17 Correct 26 ms 3952 KB Output is correct
18 Correct 29 ms 3848 KB Output is correct
19 Correct 37 ms 4168 KB Output is correct
20 Correct 37 ms 4072 KB Output is correct
21 Correct 27 ms 4212 KB Output is correct
22 Correct 29 ms 3960 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 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 8 ms 1232 KB Output is correct
9 Correct 13 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 14 ms 1940 KB Output is correct
13 Correct 10 ms 2000 KB Output is correct
14 Correct 11 ms 1872 KB Output is correct
15 Correct 38 ms 3980 KB Output is correct
16 Correct 35 ms 4072 KB Output is correct
17 Correct 26 ms 3952 KB Output is correct
18 Correct 29 ms 3848 KB Output is correct
19 Correct 37 ms 4168 KB Output is correct
20 Correct 37 ms 4072 KB Output is correct
21 Correct 27 ms 4212 KB Output is correct
22 Correct 29 ms 3960 KB Output is correct
23 Correct 39 ms 4332 KB Output is correct
24 Correct 36 ms 4296 KB Output is correct
25 Correct 33 ms 4260 KB Output is correct
26 Correct 32 ms 4152 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 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 8 ms 1232 KB Output is correct
9 Correct 13 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 14 ms 1940 KB Output is correct
13 Correct 10 ms 2000 KB Output is correct
14 Correct 11 ms 1872 KB Output is correct
15 Correct 38 ms 3980 KB Output is correct
16 Correct 35 ms 4072 KB Output is correct
17 Correct 26 ms 3952 KB Output is correct
18 Correct 29 ms 3848 KB Output is correct
19 Correct 37 ms 4168 KB Output is correct
20 Correct 37 ms 4072 KB Output is correct
21 Correct 27 ms 4212 KB Output is correct
22 Correct 29 ms 3960 KB Output is correct
23 Correct 39 ms 4332 KB Output is correct
24 Correct 36 ms 4296 KB Output is correct
25 Correct 33 ms 4260 KB Output is correct
26 Correct 32 ms 4152 KB Output is correct
27 Correct 37 ms 4332 KB Output is correct
28 Correct 38 ms 4388 KB Output is correct
29 Correct 27 ms 4376 KB Output is correct
30 Correct 36 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 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 8 ms 1232 KB Output is correct
9 Correct 13 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 14 ms 1940 KB Output is correct
13 Correct 10 ms 2000 KB Output is correct
14 Correct 11 ms 1872 KB Output is correct
15 Correct 38 ms 3980 KB Output is correct
16 Correct 35 ms 4072 KB Output is correct
17 Correct 26 ms 3952 KB Output is correct
18 Correct 29 ms 3848 KB Output is correct
19 Correct 37 ms 4168 KB Output is correct
20 Correct 37 ms 4072 KB Output is correct
21 Correct 27 ms 4212 KB Output is correct
22 Correct 29 ms 3960 KB Output is correct
23 Correct 39 ms 4332 KB Output is correct
24 Correct 36 ms 4296 KB Output is correct
25 Correct 33 ms 4260 KB Output is correct
26 Correct 32 ms 4152 KB Output is correct
27 Correct 37 ms 4332 KB Output is correct
28 Correct 38 ms 4388 KB Output is correct
29 Correct 27 ms 4376 KB Output is correct
30 Correct 36 ms 4200 KB Output is correct
31 Correct 47 ms 4472 KB Output is correct
32 Correct 46 ms 4584 KB Output is correct
33 Correct 31 ms 4500 KB Output is correct
34 Correct 32 ms 4292 KB Output is correct

Subtask #9
10.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 1 ms 720 KB Output is correct
6 Correct 2 ms 720 KB Output is correct
7 Correct 4 ms 976 KB Output is correct
8 Correct 8 ms 1232 KB Output is correct
9 Correct 13 ms 1872 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 14 ms 1940 KB Output is correct
13 Correct 10 ms 2000 KB Output is correct
14 Correct 11 ms 1872 KB Output is correct
15 Correct 38 ms 3980 KB Output is correct
16 Correct 35 ms 4072 KB Output is correct
17 Correct 26 ms 3952 KB Output is correct
18 Correct 29 ms 3848 KB Output is correct
19 Correct 37 ms 4168 KB Output is correct
20 Correct 37 ms 4072 KB Output is correct
21 Correct 27 ms 4212 KB Output is correct
22 Correct 29 ms 3960 KB Output is correct
23 Correct 39 ms 4332 KB Output is correct
24 Correct 36 ms 4296 KB Output is correct
25 Correct 33 ms 4260 KB Output is correct
26 Correct 32 ms 4152 KB Output is correct
27 Correct 37 ms 4332 KB Output is correct
28 Correct 38 ms 4388 KB Output is correct
29 Correct 27 ms 4376 KB Output is correct
30 Correct 36 ms 4200 KB Output is correct
31 Correct 47 ms 4472 KB Output is correct
32 Correct 46 ms 4584 KB Output is correct
33 Correct 31 ms 4500 KB Output is correct
34 Correct 32 ms 4292 KB Output is correct
35 Correct 51 ms 4484 KB Output is correct
36 Correct 48 ms 4596 KB Output is correct
37 Correct 31 ms 4504 KB Output is correct
38 Correct 32 ms 4404 KB Output is correct