oj.uz

Submission #796791

# Submission time Handle Problem Language Result Execution time Memory
796791 2023-07-28T18:18:01 Z SlavicG Minerals (JOI19_minerals) C++17
100 / 100
 58 ms 6428 KB 
#include <bits/stdc++.h>
#include "minerals.h"
using namespace std;
 
#define sz(a) (int)a.size()
mt19937 rng(69);
//b - valoarea elementului, stateul (aprins/stins)
int ans = 0, prevans = -1;
const int N = 1e5 + 69;
int in[N], added[N];
map<pair<int, int>, int> cant_be;

void rec(vector<int> a, vector<pair<int, int>> b, int offset) {
    if(b.empty() || a.empty()) return;
    if(sz(b) == 1) {
        for(auto x: a) Answer(x, b[0].first);
        return;
    }
    vector<int> first_half, second_half;
    int mid = (sz(b) < 10 ? sz(b) / 2 : min(sz(b) - 1, (int)(sz(b) * 0.369)));
    vector<pair<int, int>> left, right;
    for(auto& x: a) {
        if(added[x]) continue;
        if(in[x] <= mid + offset) {
            first_half.push_back(x);
            x = -1;
        }
        else added[x] = 1;
    }

    for(int i = 0; i < sz(b); ++i) {
        if(i < mid) left.push_back(b[i]);
        else right.push_back(b[i]);
    }
    int offset2 = offset + sz(left);
    {
        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), swap(first_half, second_half), swap(offset, offset2);
    }
 
    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;
        }
    }
 
    shuffle(a.begin(), a.end(), rng);
    for(auto x: a) {
        if(x == -1) continue;
        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, offset2);
    rec(first_half, left, offset);
}
 
void Solve(int n) {
    for(int i = 0; i < N; ++i) in[i] = INT_MAX;
    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);
            in[i] = ans;
        } else {
            p1.push_back(i);
        }
        prevans = ans;
        if(sz(p1) == n) {
            for(int j = 0; j < sz(bulanea); ++j) {
                if(bulanea[j] == i) {
                    for(int f = j + 1; f < sz(bulanea); ++f) {
                        p2.push_back(bulanea[f]);
                    }
                    break;
                }
            }
            break;
        }
    }
    assert(sz(p1) == n && sz(p2) == n);
    vector<pair<int, int>> b;
    for(auto x: p1) b.push_back({x, 1});
    rec(p2, b, 0);
}
/*
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 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 848 KB Output is correct
2 Correct 2 ms 976 KB Output is correct
3 Correct 5 ms 1232 KB Output is correct
4 Correct 8 ms 1680 KB Output is correct
5 Correct 16 ms 2644 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 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 5 ms 1232 KB Output is correct
8 Correct 8 ms 1680 KB Output is correct
9 Correct 16 ms 2644 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 11 ms 2000 KB Output is correct
12 Correct 18 ms 2640 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 16 ms 2636 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 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 5 ms 1232 KB Output is correct
8 Correct 8 ms 1680 KB Output is correct
9 Correct 16 ms 2644 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 11 ms 2000 KB Output is correct
12 Correct 18 ms 2640 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 16 ms 2636 KB Output is correct
15 Correct 45 ms 5748 KB Output is correct
16 Correct 58 ms 5808 KB Output is correct
17 Correct 46 ms 5808 KB Output is correct
18 Correct 45 ms 5728 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 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 5 ms 1232 KB Output is correct
8 Correct 8 ms 1680 KB Output is correct
9 Correct 16 ms 2644 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 11 ms 2000 KB Output is correct
12 Correct 18 ms 2640 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 16 ms 2636 KB Output is correct
15 Correct 45 ms 5748 KB Output is correct
16 Correct 58 ms 5808 KB Output is correct
17 Correct 46 ms 5808 KB Output is correct
18 Correct 45 ms 5728 KB Output is correct
19 Correct 45 ms 5948 KB Output is correct
20 Correct 46 ms 5948 KB Output is correct
21 Correct 48 ms 5984 KB Output is correct
22 Correct 46 ms 5836 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 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 5 ms 1232 KB Output is correct
8 Correct 8 ms 1680 KB Output is correct
9 Correct 16 ms 2644 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 11 ms 2000 KB Output is correct
12 Correct 18 ms 2640 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 16 ms 2636 KB Output is correct
15 Correct 45 ms 5748 KB Output is correct
16 Correct 58 ms 5808 KB Output is correct
17 Correct 46 ms 5808 KB Output is correct
18 Correct 45 ms 5728 KB Output is correct
19 Correct 45 ms 5948 KB Output is correct
20 Correct 46 ms 5948 KB Output is correct
21 Correct 48 ms 5984 KB Output is correct
22 Correct 46 ms 5836 KB Output is correct
23 Correct 46 ms 6088 KB Output is correct
24 Correct 47 ms 5996 KB Output is correct
25 Correct 48 ms 6004 KB Output is correct
26 Correct 47 ms 5844 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 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 5 ms 1232 KB Output is correct
8 Correct 8 ms 1680 KB Output is correct
9 Correct 16 ms 2644 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 11 ms 2000 KB Output is correct
12 Correct 18 ms 2640 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 16 ms 2636 KB Output is correct
15 Correct 45 ms 5748 KB Output is correct
16 Correct 58 ms 5808 KB Output is correct
17 Correct 46 ms 5808 KB Output is correct
18 Correct 45 ms 5728 KB Output is correct
19 Correct 45 ms 5948 KB Output is correct
20 Correct 46 ms 5948 KB Output is correct
21 Correct 48 ms 5984 KB Output is correct
22 Correct 46 ms 5836 KB Output is correct
23 Correct 46 ms 6088 KB Output is correct
24 Correct 47 ms 5996 KB Output is correct
25 Correct 48 ms 6004 KB Output is correct
26 Correct 47 ms 5844 KB Output is correct
27 Correct 48 ms 6248 KB Output is correct
28 Correct 49 ms 6252 KB Output is correct
29 Correct 52 ms 6300 KB Output is correct
30 Correct 48 ms 6000 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 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 5 ms 1232 KB Output is correct
8 Correct 8 ms 1680 KB Output is correct
9 Correct 16 ms 2644 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 11 ms 2000 KB Output is correct
12 Correct 18 ms 2640 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 16 ms 2636 KB Output is correct
15 Correct 45 ms 5748 KB Output is correct
16 Correct 58 ms 5808 KB Output is correct
17 Correct 46 ms 5808 KB Output is correct
18 Correct 45 ms 5728 KB Output is correct
19 Correct 45 ms 5948 KB Output is correct
20 Correct 46 ms 5948 KB Output is correct
21 Correct 48 ms 5984 KB Output is correct
22 Correct 46 ms 5836 KB Output is correct
23 Correct 46 ms 6088 KB Output is correct
24 Correct 47 ms 5996 KB Output is correct
25 Correct 48 ms 6004 KB Output is correct
26 Correct 47 ms 5844 KB Output is correct
27 Correct 48 ms 6248 KB Output is correct
28 Correct 49 ms 6252 KB Output is correct
29 Correct 52 ms 6300 KB Output is correct
30 Correct 48 ms 6000 KB Output is correct
31 Correct 49 ms 6308 KB Output is correct
32 Correct 50 ms 6332 KB Output is correct
33 Correct 49 ms 6364 KB Output is correct
34 Correct 50 ms 6236 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 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 2 ms 848 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 5 ms 1232 KB Output is correct
8 Correct 8 ms 1680 KB Output is correct
9 Correct 16 ms 2644 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 11 ms 2000 KB Output is correct
12 Correct 18 ms 2640 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 16 ms 2636 KB Output is correct
15 Correct 45 ms 5748 KB Output is correct
16 Correct 58 ms 5808 KB Output is correct
17 Correct 46 ms 5808 KB Output is correct
18 Correct 45 ms 5728 KB Output is correct
19 Correct 45 ms 5948 KB Output is correct
20 Correct 46 ms 5948 KB Output is correct
21 Correct 48 ms 5984 KB Output is correct
22 Correct 46 ms 5836 KB Output is correct
23 Correct 46 ms 6088 KB Output is correct
24 Correct 47 ms 5996 KB Output is correct
25 Correct 48 ms 6004 KB Output is correct
26 Correct 47 ms 5844 KB Output is correct
27 Correct 48 ms 6248 KB Output is correct
28 Correct 49 ms 6252 KB Output is correct
29 Correct 52 ms 6300 KB Output is correct
30 Correct 48 ms 6000 KB Output is correct
31 Correct 49 ms 6308 KB Output is correct
32 Correct 50 ms 6332 KB Output is correct
33 Correct 49 ms 6364 KB Output is correct
34 Correct 50 ms 6236 KB Output is correct
35 Correct 51 ms 6428 KB Output is correct
36 Correct 51 ms 6404 KB Output is correct
37 Correct 51 ms 6364 KB Output is correct
38 Correct 52 ms 6332 KB Output is correct