oj.uz

답안 #618760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618760 2022-08-02T07:18:44 Z maomao90 Minerals (JOI19_minerals) C++17
90 / 100
 60 ms 3372 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];

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) / 2) {
        lfi.pb(fi[i]);
        inlfi[fi[i]] = 1;
    }
    REP (i, SZ(fi) / 2, SZ(se)) {
        rfi.pb(fi[i]);
    }
    int cur = -1;
    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;
    }
    assert(cur != -1);
    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(rfi, rse);
    dnc(lfi, lse);
}

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 9 ms 720 KB Output is correct
5 Correct 17 ms 1232 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 9 ms 720 KB Output is correct
9 Correct 17 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1156 KB Output is correct
12 Correct 19 ms 1220 KB Output is correct
13 Correct 21 ms 1336 KB Output is correct
14 Correct 20 ms 1288 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 9 ms 720 KB Output is correct
9 Correct 17 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1156 KB Output is correct
12 Correct 19 ms 1220 KB Output is correct
13 Correct 21 ms 1336 KB Output is correct
14 Correct 20 ms 1288 KB Output is correct
15 Correct 44 ms 3024 KB Output is correct
16 Correct 43 ms 3024 KB Output is correct
17 Correct 44 ms 2996 KB Output is correct
18 Correct 47 ms 2872 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 9 ms 720 KB Output is correct
9 Correct 17 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1156 KB Output is correct
12 Correct 19 ms 1220 KB Output is correct
13 Correct 21 ms 1336 KB Output is correct
14 Correct 20 ms 1288 KB Output is correct
15 Correct 44 ms 3024 KB Output is correct
16 Correct 43 ms 3024 KB Output is correct
17 Correct 44 ms 2996 KB Output is correct
18 Correct 47 ms 2872 KB Output is correct
19 Correct 51 ms 3044 KB Output is correct
20 Correct 51 ms 3100 KB Output is correct
21 Correct 53 ms 3016 KB Output is correct
22 Correct 43 ms 2952 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 9 ms 720 KB Output is correct
9 Correct 17 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1156 KB Output is correct
12 Correct 19 ms 1220 KB Output is correct
13 Correct 21 ms 1336 KB Output is correct
14 Correct 20 ms 1288 KB Output is correct
15 Correct 44 ms 3024 KB Output is correct
16 Correct 43 ms 3024 KB Output is correct
17 Correct 44 ms 2996 KB Output is correct
18 Correct 47 ms 2872 KB Output is correct
19 Correct 51 ms 3044 KB Output is correct
20 Correct 51 ms 3100 KB Output is correct
21 Correct 53 ms 3016 KB Output is correct
22 Correct 43 ms 2952 KB Output is correct
23 Correct 49 ms 3172 KB Output is correct
24 Correct 46 ms 3156 KB Output is correct
25 Correct 60 ms 3156 KB Output is correct
26 Correct 56 ms 2988 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 9 ms 720 KB Output is correct
9 Correct 17 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1156 KB Output is correct
12 Correct 19 ms 1220 KB Output is correct
13 Correct 21 ms 1336 KB Output is correct
14 Correct 20 ms 1288 KB Output is correct
15 Correct 44 ms 3024 KB Output is correct
16 Correct 43 ms 3024 KB Output is correct
17 Correct 44 ms 2996 KB Output is correct
18 Correct 47 ms 2872 KB Output is correct
19 Correct 51 ms 3044 KB Output is correct
20 Correct 51 ms 3100 KB Output is correct
21 Correct 53 ms 3016 KB Output is correct
22 Correct 43 ms 2952 KB Output is correct
23 Correct 49 ms 3172 KB Output is correct
24 Correct 46 ms 3156 KB Output is correct
25 Correct 60 ms 3156 KB Output is correct
26 Correct 56 ms 2988 KB Output is correct
27 Correct 46 ms 3232 KB Output is correct
28 Correct 55 ms 3220 KB Output is correct
29 Correct 46 ms 3196 KB Output is correct
30 Correct 52 ms 2988 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 9 ms 720 KB Output is correct
9 Correct 17 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1156 KB Output is correct
12 Correct 19 ms 1220 KB Output is correct
13 Correct 21 ms 1336 KB Output is correct
14 Correct 20 ms 1288 KB Output is correct
15 Correct 44 ms 3024 KB Output is correct
16 Correct 43 ms 3024 KB Output is correct
17 Correct 44 ms 2996 KB Output is correct
18 Correct 47 ms 2872 KB Output is correct
19 Correct 51 ms 3044 KB Output is correct
20 Correct 51 ms 3100 KB Output is correct
21 Correct 53 ms 3016 KB Output is correct
22 Correct 43 ms 2952 KB Output is correct
23 Correct 49 ms 3172 KB Output is correct
24 Correct 46 ms 3156 KB Output is correct
25 Correct 60 ms 3156 KB Output is correct
26 Correct 56 ms 2988 KB Output is correct
27 Correct 46 ms 3232 KB Output is correct
28 Correct 55 ms 3220 KB Output is correct
29 Correct 46 ms 3196 KB Output is correct
30 Correct 52 ms 2988 KB Output is correct
31 Correct 49 ms 3268 KB Output is correct
32 Correct 48 ms 3284 KB Output is correct
33 Correct 52 ms 3184 KB Output is correct
34 Correct 59 ms 3108 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 9 ms 720 KB Output is correct
9 Correct 17 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 12 ms 1156 KB Output is correct
12 Correct 19 ms 1220 KB Output is correct
13 Correct 21 ms 1336 KB Output is correct
14 Correct 20 ms 1288 KB Output is correct
15 Correct 44 ms 3024 KB Output is correct
16 Correct 43 ms 3024 KB Output is correct
17 Correct 44 ms 2996 KB Output is correct
18 Correct 47 ms 2872 KB Output is correct
19 Correct 51 ms 3044 KB Output is correct
20 Correct 51 ms 3100 KB Output is correct
21 Correct 53 ms 3016 KB Output is correct
22 Correct 43 ms 2952 KB Output is correct
23 Correct 49 ms 3172 KB Output is correct
24 Correct 46 ms 3156 KB Output is correct
25 Correct 60 ms 3156 KB Output is correct
26 Correct 56 ms 2988 KB Output is correct
27 Correct 46 ms 3232 KB Output is correct
28 Correct 55 ms 3220 KB Output is correct
29 Correct 46 ms 3196 KB Output is correct
30 Correct 52 ms 2988 KB Output is correct
31 Correct 49 ms 3268 KB Output is correct
32 Correct 48 ms 3284 KB Output is correct
33 Correct 52 ms 3184 KB Output is correct
34 Correct 59 ms 3108 KB Output is correct
35 Incorrect 50 ms 3372 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -