oj.uz

Submission #796644

# Submission time Handle Problem Language Result Execution time Memory
796644 2023-07-28T15:11:28 Z SlavicG Minerals (JOI19_minerals) C++17
90 / 100
 52 ms 4920 KB 
#include <bits/stdc++.h>
#include "minerals.h"
using namespace std;
 
#define sz(a) (int)a.size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2e5 + 5;
int in[N];
//b - valoarea elementului, stateul (aprins/stins)
int ans = 0, prevans = -1;
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);
        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;
            for(auto x: p1) b.push_back({x, 1});
            rec(p2, b);
            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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 4 ms 720 KB Output is correct
4 Correct 8 ms 1020 KB Output is correct
5 Correct 15 ms 1844 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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 720 KB Output is correct
8 Correct 8 ms 1020 KB Output is correct
9 Correct 15 ms 1844 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1360 KB Output is correct
12 Correct 15 ms 1816 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 15 ms 1744 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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 720 KB Output is correct
8 Correct 8 ms 1020 KB Output is correct
9 Correct 15 ms 1844 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1360 KB Output is correct
12 Correct 15 ms 1816 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 15 ms 1744 KB Output is correct
15 Correct 43 ms 4492 KB Output is correct
16 Correct 52 ms 4552 KB Output is correct
17 Correct 42 ms 4536 KB Output is correct
18 Correct 51 ms 4248 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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 720 KB Output is correct
8 Correct 8 ms 1020 KB Output is correct
9 Correct 15 ms 1844 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1360 KB Output is correct
12 Correct 15 ms 1816 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 15 ms 1744 KB Output is correct
15 Correct 43 ms 4492 KB Output is correct
16 Correct 52 ms 4552 KB Output is correct
17 Correct 42 ms 4536 KB Output is correct
18 Correct 51 ms 4248 KB Output is correct
19 Correct 43 ms 4556 KB Output is correct
20 Correct 50 ms 4488 KB Output is correct
21 Correct 49 ms 4552 KB Output is correct
22 Correct 51 ms 4420 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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 720 KB Output is correct
8 Correct 8 ms 1020 KB Output is correct
9 Correct 15 ms 1844 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1360 KB Output is correct
12 Correct 15 ms 1816 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 15 ms 1744 KB Output is correct
15 Correct 43 ms 4492 KB Output is correct
16 Correct 52 ms 4552 KB Output is correct
17 Correct 42 ms 4536 KB Output is correct
18 Correct 51 ms 4248 KB Output is correct
19 Correct 43 ms 4556 KB Output is correct
20 Correct 50 ms 4488 KB Output is correct
21 Correct 49 ms 4552 KB Output is correct
22 Correct 51 ms 4420 KB Output is correct
23 Correct 46 ms 4688 KB Output is correct
24 Correct 49 ms 4700 KB Output is correct
25 Correct 43 ms 4684 KB Output is correct
26 Correct 44 ms 4452 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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 720 KB Output is correct
8 Correct 8 ms 1020 KB Output is correct
9 Correct 15 ms 1844 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1360 KB Output is correct
12 Correct 15 ms 1816 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 15 ms 1744 KB Output is correct
15 Correct 43 ms 4492 KB Output is correct
16 Correct 52 ms 4552 KB Output is correct
17 Correct 42 ms 4536 KB Output is correct
18 Correct 51 ms 4248 KB Output is correct
19 Correct 43 ms 4556 KB Output is correct
20 Correct 50 ms 4488 KB Output is correct
21 Correct 49 ms 4552 KB Output is correct
22 Correct 51 ms 4420 KB Output is correct
23 Correct 46 ms 4688 KB Output is correct
24 Correct 49 ms 4700 KB Output is correct
25 Correct 43 ms 4684 KB Output is correct
26 Correct 44 ms 4452 KB Output is correct
27 Correct 45 ms 4836 KB Output is correct
28 Correct 46 ms 4760 KB Output is correct
29 Correct 44 ms 4832 KB Output is correct
30 Correct 46 ms 4476 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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 720 KB Output is correct
8 Correct 8 ms 1020 KB Output is correct
9 Correct 15 ms 1844 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1360 KB Output is correct
12 Correct 15 ms 1816 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 15 ms 1744 KB Output is correct
15 Correct 43 ms 4492 KB Output is correct
16 Correct 52 ms 4552 KB Output is correct
17 Correct 42 ms 4536 KB Output is correct
18 Correct 51 ms 4248 KB Output is correct
19 Correct 43 ms 4556 KB Output is correct
20 Correct 50 ms 4488 KB Output is correct
21 Correct 49 ms 4552 KB Output is correct
22 Correct 51 ms 4420 KB Output is correct
23 Correct 46 ms 4688 KB Output is correct
24 Correct 49 ms 4700 KB Output is correct
25 Correct 43 ms 4684 KB Output is correct
26 Correct 44 ms 4452 KB Output is correct
27 Correct 45 ms 4836 KB Output is correct
28 Correct 46 ms 4760 KB Output is correct
29 Correct 44 ms 4832 KB Output is correct
30 Correct 46 ms 4476 KB Output is correct
31 Correct 52 ms 4920 KB Output is correct
32 Correct 46 ms 4892 KB Output is correct
33 Correct 45 ms 4860 KB Output is correct
34 Correct 48 ms 4772 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 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 720 KB Output is correct
8 Correct 8 ms 1020 KB Output is correct
9 Correct 15 ms 1844 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 10 ms 1360 KB Output is correct
12 Correct 15 ms 1816 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 15 ms 1744 KB Output is correct
15 Correct 43 ms 4492 KB Output is correct
16 Correct 52 ms 4552 KB Output is correct
17 Correct 42 ms 4536 KB Output is correct
18 Correct 51 ms 4248 KB Output is correct
19 Correct 43 ms 4556 KB Output is correct
20 Correct 50 ms 4488 KB Output is correct
21 Correct 49 ms 4552 KB Output is correct
22 Correct 51 ms 4420 KB Output is correct
23 Correct 46 ms 4688 KB Output is correct
24 Correct 49 ms 4700 KB Output is correct
25 Correct 43 ms 4684 KB Output is correct
26 Correct 44 ms 4452 KB Output is correct
27 Correct 45 ms 4836 KB Output is correct
28 Correct 46 ms 4760 KB Output is correct
29 Correct 44 ms 4832 KB Output is correct
30 Correct 46 ms 4476 KB Output is correct
31 Correct 52 ms 4920 KB Output is correct
32 Correct 46 ms 4892 KB Output is correct
33 Correct 45 ms 4860 KB Output is correct
34 Correct 48 ms 4772 KB Output is correct
35 Incorrect 48 ms 4872 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -