oj.uz

Submission #796684

# Submission time Handle Problem Language Result Execution time Memory
796684 2023-07-28T15:39:30 Z SlavicG Minerals (JOI19_minerals) C++17
90 / 100
 58 ms 5624 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];

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]);
    }

    vector<int> first_half, second_half;
    for(auto& x: a) {
        if(added[x]) continue;
        if(in[x] < mid) {
            first_half.push_back(x);
            x = -1;
        }
        else added[x] = 1;
    }

    {
        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);
    }
 
    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);
    rec(first_half, left);
}
 
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);
}
/*
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 720 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 1 ms 720 KB Output is correct
2 Correct 3 ms 848 KB Output is correct
3 Correct 5 ms 1124 KB Output is correct
4 Correct 8 ms 1528 KB Output is correct
5 Correct 16 ms 2224 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 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 5 ms 1124 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 16 ms 2224 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 10 ms 1872 KB Output is correct
12 Correct 15 ms 2384 KB Output is correct
13 Correct 15 ms 2404 KB Output is correct
14 Correct 15 ms 2324 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 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 5 ms 1124 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 16 ms 2224 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 10 ms 1872 KB Output is correct
12 Correct 15 ms 2384 KB Output is correct
13 Correct 15 ms 2404 KB Output is correct
14 Correct 15 ms 2324 KB Output is correct
15 Correct 45 ms 5124 KB Output is correct
16 Correct 46 ms 5204 KB Output is correct
17 Correct 43 ms 5072 KB Output is correct
18 Correct 44 ms 5092 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 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 5 ms 1124 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 16 ms 2224 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 10 ms 1872 KB Output is correct
12 Correct 15 ms 2384 KB Output is correct
13 Correct 15 ms 2404 KB Output is correct
14 Correct 15 ms 2324 KB Output is correct
15 Correct 45 ms 5124 KB Output is correct
16 Correct 46 ms 5204 KB Output is correct
17 Correct 43 ms 5072 KB Output is correct
18 Correct 44 ms 5092 KB Output is correct
19 Correct 49 ms 5372 KB Output is correct
20 Correct 44 ms 5228 KB Output is correct
21 Correct 44 ms 5188 KB Output is correct
22 Correct 53 ms 5380 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 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 5 ms 1124 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 16 ms 2224 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 10 ms 1872 KB Output is correct
12 Correct 15 ms 2384 KB Output is correct
13 Correct 15 ms 2404 KB Output is correct
14 Correct 15 ms 2324 KB Output is correct
15 Correct 45 ms 5124 KB Output is correct
16 Correct 46 ms 5204 KB Output is correct
17 Correct 43 ms 5072 KB Output is correct
18 Correct 44 ms 5092 KB Output is correct
19 Correct 49 ms 5372 KB Output is correct
20 Correct 44 ms 5228 KB Output is correct
21 Correct 44 ms 5188 KB Output is correct
22 Correct 53 ms 5380 KB Output is correct
23 Correct 52 ms 5388 KB Output is correct
24 Correct 47 ms 5424 KB Output is correct
25 Correct 49 ms 5448 KB Output is correct
26 Correct 46 ms 5220 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 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 5 ms 1124 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 16 ms 2224 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 10 ms 1872 KB Output is correct
12 Correct 15 ms 2384 KB Output is correct
13 Correct 15 ms 2404 KB Output is correct
14 Correct 15 ms 2324 KB Output is correct
15 Correct 45 ms 5124 KB Output is correct
16 Correct 46 ms 5204 KB Output is correct
17 Correct 43 ms 5072 KB Output is correct
18 Correct 44 ms 5092 KB Output is correct
19 Correct 49 ms 5372 KB Output is correct
20 Correct 44 ms 5228 KB Output is correct
21 Correct 44 ms 5188 KB Output is correct
22 Correct 53 ms 5380 KB Output is correct
23 Correct 52 ms 5388 KB Output is correct
24 Correct 47 ms 5424 KB Output is correct
25 Correct 49 ms 5448 KB Output is correct
26 Correct 46 ms 5220 KB Output is correct
27 Correct 47 ms 5412 KB Output is correct
28 Correct 53 ms 5524 KB Output is correct
29 Correct 49 ms 5448 KB Output is correct
30 Correct 58 ms 5360 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 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 5 ms 1124 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 16 ms 2224 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 10 ms 1872 KB Output is correct
12 Correct 15 ms 2384 KB Output is correct
13 Correct 15 ms 2404 KB Output is correct
14 Correct 15 ms 2324 KB Output is correct
15 Correct 45 ms 5124 KB Output is correct
16 Correct 46 ms 5204 KB Output is correct
17 Correct 43 ms 5072 KB Output is correct
18 Correct 44 ms 5092 KB Output is correct
19 Correct 49 ms 5372 KB Output is correct
20 Correct 44 ms 5228 KB Output is correct
21 Correct 44 ms 5188 KB Output is correct
22 Correct 53 ms 5380 KB Output is correct
23 Correct 52 ms 5388 KB Output is correct
24 Correct 47 ms 5424 KB Output is correct
25 Correct 49 ms 5448 KB Output is correct
26 Correct 46 ms 5220 KB Output is correct
27 Correct 47 ms 5412 KB Output is correct
28 Correct 53 ms 5524 KB Output is correct
29 Correct 49 ms 5448 KB Output is correct
30 Correct 58 ms 5360 KB Output is correct
31 Correct 49 ms 5596 KB Output is correct
32 Correct 48 ms 5612 KB Output is correct
33 Correct 49 ms 5604 KB Output is correct
34 Correct 48 ms 5456 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 720 KB Output is correct
3 Correct 1 ms 720 KB Output is correct
4 Correct 1 ms 720 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 3 ms 848 KB Output is correct
7 Correct 5 ms 1124 KB Output is correct
8 Correct 8 ms 1528 KB Output is correct
9 Correct 16 ms 2224 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 10 ms 1872 KB Output is correct
12 Correct 15 ms 2384 KB Output is correct
13 Correct 15 ms 2404 KB Output is correct
14 Correct 15 ms 2324 KB Output is correct
15 Correct 45 ms 5124 KB Output is correct
16 Correct 46 ms 5204 KB Output is correct
17 Correct 43 ms 5072 KB Output is correct
18 Correct 44 ms 5092 KB Output is correct
19 Correct 49 ms 5372 KB Output is correct
20 Correct 44 ms 5228 KB Output is correct
21 Correct 44 ms 5188 KB Output is correct
22 Correct 53 ms 5380 KB Output is correct
23 Correct 52 ms 5388 KB Output is correct
24 Correct 47 ms 5424 KB Output is correct
25 Correct 49 ms 5448 KB Output is correct
26 Correct 46 ms 5220 KB Output is correct
27 Correct 47 ms 5412 KB Output is correct
28 Correct 53 ms 5524 KB Output is correct
29 Correct 49 ms 5448 KB Output is correct
30 Correct 58 ms 5360 KB Output is correct
31 Correct 49 ms 5596 KB Output is correct
32 Correct 48 ms 5612 KB Output is correct
33 Correct 49 ms 5604 KB Output is correct
34 Correct 48 ms 5456 KB Output is correct
35 Incorrect 49 ms 5624 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -