oj.uz

Submission #796645

# Submission time Handle Problem Language Result Execution time Memory
796645 2023-07-28T15:15:02 Z SlavicG Minerals (JOI19_minerals) C++17
90 / 100
 73 ms 6900 KB 
#include <bits/stdc++.h>
#include "minerals.h"
using namespace std;
 
#define sz(a) (int)a.size()
mt19937 rng(69);

const int N = 2e5 + 5;
int in[N];
//b - valoarea elementului, stateul (aprins/stins)
int ans = 0, prevans = -1;
map<int, int> bl;
void rec(vector<int> a, vector<pair<int, int>> b) {
    if(b.empty() || a.empty()) return;
    if(sz(b) == 1) {
        for(auto x: a) Answer(x, b[0].first), bl[b[0].first] = 1;
        return;
    }
    int mid = sz(b) / 2;
    vector<pair<int, int>> left, right;
    for(int i = 0; i < sz(b); ++i) {
        if(i < mid) left.push_back(b[i]);
        else right.push_back(b[i]);
    }

    {
        int change1 = 0, change2 = 0;
        for(auto& x: left) {
            if(!x.second) {
                ++change1;
            } else {
                ++change2;
            }
        }
        for(auto& x: right) {
            if(x.second) {
                ++change1;
            } else {
                ++change2;
            }
        }
        if(change2 < change1) swap(left, right);
    }

    for(auto& x: left) {
        if(!x.second) {
            prevans = Query(x.first);
            x.second = 1;
        }
    }
    for(auto& x: right) {
        if(x.second) {
            prevans = Query(x.first);
            x.second = 0;
        }
    }

    vector<int> first_half, second_half;
    shuffle(a.begin(), a.end(), rng);
    for(auto x: a) {
        if(sz(second_half) >= sz(right)) {
            first_half.push_back(x);
            continue;
        }
        if(sz(first_half) >= sz(left)) {
            second_half.push_back(x);
            continue;
        }
        int ans = Query(x);
        if(ans == prevans) {
            first_half.push_back(x);
        } else {
            second_half.push_back(x);
        }
        prevans = ans;
    }
    rec(second_half, right);
    rec(first_half, left);
}

void Solve(int n) {
    vector<int> p1, p2;
    vector<int> bulanea(2 * n);
    iota(bulanea.begin(), bulanea.end(), 1);
    shuffle(bulanea.begin(), bulanea.end(), rng);
    for(int i: bulanea) {
        ans = Query(i);
        if(ans == prevans) {
            p2.push_back(i);
        } else {
            p1.push_back(i);
        }
        prevans = ans;
        if(sz(p1) == sz(p2)) {
            vector<pair<int, int>> b;
            int paiu = p2.back();
            p2.pop_back();
            for(auto x: p1) b.push_back({x, 1});
            rec(p2, b);
            for(auto x: p1) {
                if(!bl[x]) Answer(paiu, x);
            }
            p2.clear();
            p1.clear();
        }
    }
}
/*
4
1 5
2 6
3 4
7 8
*/
// g++ -Wall -lm -static -DEVAL -o minerals -O2 minerals.cpp grader.cpp -std=c++17

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 3 ms 592 KB Output is correct
3 Correct 5 ms 848 KB Output is correct
4 Correct 12 ms 1476 KB Output is correct
5 Correct 19 ms 2480 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 12 ms 1476 KB Output is correct
9 Correct 19 ms 2480 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 13 ms 1928 KB Output is correct
12 Correct 20 ms 2580 KB Output is correct
13 Correct 22 ms 2592 KB Output is correct
14 Correct 20 ms 2512 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 12 ms 1476 KB Output is correct
9 Correct 19 ms 2480 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 13 ms 1928 KB Output is correct
12 Correct 20 ms 2580 KB Output is correct
13 Correct 22 ms 2592 KB Output is correct
14 Correct 20 ms 2512 KB Output is correct
15 Correct 58 ms 6256 KB Output is correct
16 Correct 69 ms 6448 KB Output is correct
17 Correct 58 ms 6236 KB Output is correct
18 Correct 61 ms 6004 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 12 ms 1476 KB Output is correct
9 Correct 19 ms 2480 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 13 ms 1928 KB Output is correct
12 Correct 20 ms 2580 KB Output is correct
13 Correct 22 ms 2592 KB Output is correct
14 Correct 20 ms 2512 KB Output is correct
15 Correct 58 ms 6256 KB Output is correct
16 Correct 69 ms 6448 KB Output is correct
17 Correct 58 ms 6236 KB Output is correct
18 Correct 61 ms 6004 KB Output is correct
19 Correct 61 ms 6344 KB Output is correct
20 Correct 63 ms 6472 KB Output is correct
21 Correct 59 ms 6356 KB Output is correct
22 Correct 62 ms 6160 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 12 ms 1476 KB Output is correct
9 Correct 19 ms 2480 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 13 ms 1928 KB Output is correct
12 Correct 20 ms 2580 KB Output is correct
13 Correct 22 ms 2592 KB Output is correct
14 Correct 20 ms 2512 KB Output is correct
15 Correct 58 ms 6256 KB Output is correct
16 Correct 69 ms 6448 KB Output is correct
17 Correct 58 ms 6236 KB Output is correct
18 Correct 61 ms 6004 KB Output is correct
19 Correct 61 ms 6344 KB Output is correct
20 Correct 63 ms 6472 KB Output is correct
21 Correct 59 ms 6356 KB Output is correct
22 Correct 62 ms 6160 KB Output is correct
23 Correct 61 ms 6600 KB Output is correct
24 Correct 61 ms 6532 KB Output is correct
25 Correct 63 ms 6524 KB Output is correct
26 Correct 68 ms 6384 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 12 ms 1476 KB Output is correct
9 Correct 19 ms 2480 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 13 ms 1928 KB Output is correct
12 Correct 20 ms 2580 KB Output is correct
13 Correct 22 ms 2592 KB Output is correct
14 Correct 20 ms 2512 KB Output is correct
15 Correct 58 ms 6256 KB Output is correct
16 Correct 69 ms 6448 KB Output is correct
17 Correct 58 ms 6236 KB Output is correct
18 Correct 61 ms 6004 KB Output is correct
19 Correct 61 ms 6344 KB Output is correct
20 Correct 63 ms 6472 KB Output is correct
21 Correct 59 ms 6356 KB Output is correct
22 Correct 62 ms 6160 KB Output is correct
23 Correct 61 ms 6600 KB Output is correct
24 Correct 61 ms 6532 KB Output is correct
25 Correct 63 ms 6524 KB Output is correct
26 Correct 68 ms 6384 KB Output is correct
27 Correct 65 ms 6612 KB Output is correct
28 Correct 62 ms 6672 KB Output is correct
29 Correct 62 ms 6616 KB Output is correct
30 Correct 61 ms 6468 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 12 ms 1476 KB Output is correct
9 Correct 19 ms 2480 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 13 ms 1928 KB Output is correct
12 Correct 20 ms 2580 KB Output is correct
13 Correct 22 ms 2592 KB Output is correct
14 Correct 20 ms 2512 KB Output is correct
15 Correct 58 ms 6256 KB Output is correct
16 Correct 69 ms 6448 KB Output is correct
17 Correct 58 ms 6236 KB Output is correct
18 Correct 61 ms 6004 KB Output is correct
19 Correct 61 ms 6344 KB Output is correct
20 Correct 63 ms 6472 KB Output is correct
21 Correct 59 ms 6356 KB Output is correct
22 Correct 62 ms 6160 KB Output is correct
23 Correct 61 ms 6600 KB Output is correct
24 Correct 61 ms 6532 KB Output is correct
25 Correct 63 ms 6524 KB Output is correct
26 Correct 68 ms 6384 KB Output is correct
27 Correct 65 ms 6612 KB Output is correct
28 Correct 62 ms 6672 KB Output is correct
29 Correct 62 ms 6616 KB Output is correct
30 Correct 61 ms 6468 KB Output is correct
31 Correct 65 ms 6820 KB Output is correct
32 Correct 71 ms 6900 KB Output is correct
33 Correct 70 ms 6828 KB Output is correct
34 Correct 62 ms 6648 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 5 ms 848 KB Output is correct
8 Correct 12 ms 1476 KB Output is correct
9 Correct 19 ms 2480 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 13 ms 1928 KB Output is correct
12 Correct 20 ms 2580 KB Output is correct
13 Correct 22 ms 2592 KB Output is correct
14 Correct 20 ms 2512 KB Output is correct
15 Correct 58 ms 6256 KB Output is correct
16 Correct 69 ms 6448 KB Output is correct
17 Correct 58 ms 6236 KB Output is correct
18 Correct 61 ms 6004 KB Output is correct
19 Correct 61 ms 6344 KB Output is correct
20 Correct 63 ms 6472 KB Output is correct
21 Correct 59 ms 6356 KB Output is correct
22 Correct 62 ms 6160 KB Output is correct
23 Correct 61 ms 6600 KB Output is correct
24 Correct 61 ms 6532 KB Output is correct
25 Correct 63 ms 6524 KB Output is correct
26 Correct 68 ms 6384 KB Output is correct
27 Correct 65 ms 6612 KB Output is correct
28 Correct 62 ms 6672 KB Output is correct
29 Correct 62 ms 6616 KB Output is correct
30 Correct 61 ms 6468 KB Output is correct
31 Correct 65 ms 6820 KB Output is correct
32 Correct 71 ms 6900 KB Output is correct
33 Correct 70 ms 6828 KB Output is correct
34 Correct 62 ms 6648 KB Output is correct
35 Incorrect 73 ms 6868 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -