oj.uz

Submission #622538

# Submission time Handle Problem Language Result Execution time Memory
622538 2022-08-04T11:06:35 Z maomao90 Minerals (JOI19_minerals) C++17
100 / 100
 53 ms 4804 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "minerals.h"
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 86005;

int n;
vi lft, rht;
bool state[MAXN];

int cur;
bool inlfi[MAXN];
void dnc(vi fi, vi se) {
    REP (i, 1, 2 * n + 1) {
        cerr << state[i];
    }
    cerr << '\n';
    cerr << "fi:";
    for (int i : fi) {
        cerr << ' ' << i;
    }
    cerr << '\n';
    cerr << "se:";
    for (int i : se) {
        cerr << ' ' << i;
    }
    cerr << '\n';
    assert(SZ(fi) == SZ(se));
    if (SZ(fi) == 1) {
        Answer(fi[0], se[0]);
        return;
    }
    vi lfi, rfi;
    REP (i, 0, (SZ(fi) - 1) / 3 + 1) {
        lfi.pb(fi[i]);
        inlfi[fi[i]] = 1;
    }
    REP (i, (SZ(fi) - 1) / 3 + 1, SZ(se)) {
        rfi.pb(fi[i]);
    }
    int cnt = 0;
    for (int i : fi) {
        if (inlfi[i] ^ state[i]) {
            cnt++;
        }
    }
    if (cnt * 2 > SZ(fi)) {
        for (int i : fi) {
            inlfi[i] ^= 1;
        }
        swap(lfi, rfi);
    }
    for (int i : fi) {
        if (inlfi[i] ^ state[i]) {
            cur = Query(i);
            cerr << "? " << i << '\n';
            state[i] ^= 1;
        }
    }
    for (int i : lfi) {
        inlfi[i] = 0;
    }
    vi lse, rse;
    for (int i : se) {
        if (SZ(lse) == SZ(lfi)) {
            rse.pb(i);
            continue;
        } else if (SZ(rse) == SZ(rfi)) {
            lse.pb(i);
            continue;
        }
        int nxt = Query(i);
        state[i] ^= 1;
        cerr << "? " << i << '\n';
        if (nxt == cur) {
            lse.pb(i);
        } else {
            rse.pb(i);
        }
        cur = nxt;
    }
    dnc(lfi, lse);
    dnc(rfi, rse);
}

void Solve(int N) {
    n = N;
    vi id(2 * n, 0);
    iota(ALL(id), 1);
    for (int i : id) {
        int nxt = Query(i);
        state[i] = 1;
        cerr << "? " << i << '\n';
        if (nxt > cur) {
            lft.pb(i);
        } else {
            rht.pb(i);
        }
        cur = nxt;
    }
    assert(SZ(lft) == n);
    dnc(lft, rht);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 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 3 ms 532 KB Output is correct
3 Correct 5 ms 720 KB Output is correct
4 Correct 8 ms 1124 KB Output is correct
5 Correct 16 ms 1764 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 8 ms 1124 KB Output is correct
9 Correct 16 ms 1764 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1360 KB Output is correct
12 Correct 18 ms 1872 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 13 ms 1744 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 8 ms 1124 KB Output is correct
9 Correct 16 ms 1764 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1360 KB Output is correct
12 Correct 18 ms 1872 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 13 ms 1744 KB Output is correct
15 Correct 46 ms 4228 KB Output is correct
16 Correct 44 ms 4248 KB Output is correct
17 Correct 37 ms 4220 KB Output is correct
18 Correct 40 ms 4056 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 8 ms 1124 KB Output is correct
9 Correct 16 ms 1764 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1360 KB Output is correct
12 Correct 18 ms 1872 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 13 ms 1744 KB Output is correct
15 Correct 46 ms 4228 KB Output is correct
16 Correct 44 ms 4248 KB Output is correct
17 Correct 37 ms 4220 KB Output is correct
18 Correct 40 ms 4056 KB Output is correct
19 Correct 44 ms 4264 KB Output is correct
20 Correct 43 ms 4248 KB Output is correct
21 Correct 34 ms 4388 KB Output is correct
22 Correct 40 ms 4024 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 8 ms 1124 KB Output is correct
9 Correct 16 ms 1764 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1360 KB Output is correct
12 Correct 18 ms 1872 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 13 ms 1744 KB Output is correct
15 Correct 46 ms 4228 KB Output is correct
16 Correct 44 ms 4248 KB Output is correct
17 Correct 37 ms 4220 KB Output is correct
18 Correct 40 ms 4056 KB Output is correct
19 Correct 44 ms 4264 KB Output is correct
20 Correct 43 ms 4248 KB Output is correct
21 Correct 34 ms 4388 KB Output is correct
22 Correct 40 ms 4024 KB Output is correct
23 Correct 44 ms 4348 KB Output is correct
24 Correct 45 ms 4412 KB Output is correct
25 Correct 36 ms 4416 KB Output is correct
26 Correct 37 ms 4208 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 8 ms 1124 KB Output is correct
9 Correct 16 ms 1764 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1360 KB Output is correct
12 Correct 18 ms 1872 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 13 ms 1744 KB Output is correct
15 Correct 46 ms 4228 KB Output is correct
16 Correct 44 ms 4248 KB Output is correct
17 Correct 37 ms 4220 KB Output is correct
18 Correct 40 ms 4056 KB Output is correct
19 Correct 44 ms 4264 KB Output is correct
20 Correct 43 ms 4248 KB Output is correct
21 Correct 34 ms 4388 KB Output is correct
22 Correct 40 ms 4024 KB Output is correct
23 Correct 44 ms 4348 KB Output is correct
24 Correct 45 ms 4412 KB Output is correct
25 Correct 36 ms 4416 KB Output is correct
26 Correct 37 ms 4208 KB Output is correct
27 Correct 46 ms 4540 KB Output is correct
28 Correct 46 ms 4456 KB Output is correct
29 Correct 36 ms 4508 KB Output is correct
30 Correct 38 ms 4232 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 8 ms 1124 KB Output is correct
9 Correct 16 ms 1764 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1360 KB Output is correct
12 Correct 18 ms 1872 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 13 ms 1744 KB Output is correct
15 Correct 46 ms 4228 KB Output is correct
16 Correct 44 ms 4248 KB Output is correct
17 Correct 37 ms 4220 KB Output is correct
18 Correct 40 ms 4056 KB Output is correct
19 Correct 44 ms 4264 KB Output is correct
20 Correct 43 ms 4248 KB Output is correct
21 Correct 34 ms 4388 KB Output is correct
22 Correct 40 ms 4024 KB Output is correct
23 Correct 44 ms 4348 KB Output is correct
24 Correct 45 ms 4412 KB Output is correct
25 Correct 36 ms 4416 KB Output is correct
26 Correct 37 ms 4208 KB Output is correct
27 Correct 46 ms 4540 KB Output is correct
28 Correct 46 ms 4456 KB Output is correct
29 Correct 36 ms 4508 KB Output is correct
30 Correct 38 ms 4232 KB Output is correct
31 Correct 53 ms 4720 KB Output is correct
32 Correct 46 ms 4596 KB Output is correct
33 Correct 38 ms 4676 KB Output is correct
34 Correct 39 ms 4424 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 5 ms 720 KB Output is correct
8 Correct 8 ms 1124 KB Output is correct
9 Correct 16 ms 1764 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1360 KB Output is correct
12 Correct 18 ms 1872 KB Output is correct
13 Correct 15 ms 1872 KB Output is correct
14 Correct 13 ms 1744 KB Output is correct
15 Correct 46 ms 4228 KB Output is correct
16 Correct 44 ms 4248 KB Output is correct
17 Correct 37 ms 4220 KB Output is correct
18 Correct 40 ms 4056 KB Output is correct
19 Correct 44 ms 4264 KB Output is correct
20 Correct 43 ms 4248 KB Output is correct
21 Correct 34 ms 4388 KB Output is correct
22 Correct 40 ms 4024 KB Output is correct
23 Correct 44 ms 4348 KB Output is correct
24 Correct 45 ms 4412 KB Output is correct
25 Correct 36 ms 4416 KB Output is correct
26 Correct 37 ms 4208 KB Output is correct
27 Correct 46 ms 4540 KB Output is correct
28 Correct 46 ms 4456 KB Output is correct
29 Correct 36 ms 4508 KB Output is correct
30 Correct 38 ms 4232 KB Output is correct
31 Correct 53 ms 4720 KB Output is correct
32 Correct 46 ms 4596 KB Output is correct
33 Correct 38 ms 4676 KB Output is correct
34 Correct 39 ms 4424 KB Output is correct
35 Correct 48 ms 4756 KB Output is correct
36 Correct 48 ms 4652 KB Output is correct
37 Correct 44 ms 4804 KB Output is correct
38 Correct 43 ms 4480 KB Output is correct