oj.uz

답안 #618761

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618761 2022-08-02T07:19:17 Z maomao90 Minerals (JOI19_minerals) C++17
90 / 100
 51 ms 3304 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);
    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 0 ms 208 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 3 ms 464 KB Output is correct
4 Correct 6 ms 720 KB Output is correct
5 Correct 13 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 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 2 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 13 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 976 KB Output is correct
12 Correct 14 ms 1344 KB Output is correct
13 Correct 10 ms 1344 KB Output is correct
14 Correct 13 ms 1232 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 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 2 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 13 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 976 KB Output is correct
12 Correct 14 ms 1344 KB Output is correct
13 Correct 10 ms 1344 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 47 ms 3044 KB Output is correct
16 Correct 39 ms 3004 KB Output is correct
17 Correct 27 ms 2912 KB Output is correct
18 Correct 30 ms 2732 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 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 2 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 13 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 976 KB Output is correct
12 Correct 14 ms 1344 KB Output is correct
13 Correct 10 ms 1344 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 47 ms 3044 KB Output is correct
16 Correct 39 ms 3004 KB Output is correct
17 Correct 27 ms 2912 KB Output is correct
18 Correct 30 ms 2732 KB Output is correct
19 Correct 39 ms 3032 KB Output is correct
20 Correct 49 ms 3032 KB Output is correct
21 Correct 31 ms 2952 KB Output is correct
22 Correct 29 ms 2812 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 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 2 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 13 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 976 KB Output is correct
12 Correct 14 ms 1344 KB Output is correct
13 Correct 10 ms 1344 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 47 ms 3044 KB Output is correct
16 Correct 39 ms 3004 KB Output is correct
17 Correct 27 ms 2912 KB Output is correct
18 Correct 30 ms 2732 KB Output is correct
19 Correct 39 ms 3032 KB Output is correct
20 Correct 49 ms 3032 KB Output is correct
21 Correct 31 ms 2952 KB Output is correct
22 Correct 29 ms 2812 KB Output is correct
23 Correct 39 ms 3152 KB Output is correct
24 Correct 39 ms 3172 KB Output is correct
25 Correct 34 ms 3060 KB Output is correct
26 Correct 30 ms 2852 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 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 2 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 13 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 976 KB Output is correct
12 Correct 14 ms 1344 KB Output is correct
13 Correct 10 ms 1344 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 47 ms 3044 KB Output is correct
16 Correct 39 ms 3004 KB Output is correct
17 Correct 27 ms 2912 KB Output is correct
18 Correct 30 ms 2732 KB Output is correct
19 Correct 39 ms 3032 KB Output is correct
20 Correct 49 ms 3032 KB Output is correct
21 Correct 31 ms 2952 KB Output is correct
22 Correct 29 ms 2812 KB Output is correct
23 Correct 39 ms 3152 KB Output is correct
24 Correct 39 ms 3172 KB Output is correct
25 Correct 34 ms 3060 KB Output is correct
26 Correct 30 ms 2852 KB Output is correct
27 Correct 40 ms 3208 KB Output is correct
28 Correct 51 ms 3168 KB Output is correct
29 Correct 37 ms 3180 KB Output is correct
30 Correct 31 ms 2968 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 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 2 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 13 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 976 KB Output is correct
12 Correct 14 ms 1344 KB Output is correct
13 Correct 10 ms 1344 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 47 ms 3044 KB Output is correct
16 Correct 39 ms 3004 KB Output is correct
17 Correct 27 ms 2912 KB Output is correct
18 Correct 30 ms 2732 KB Output is correct
19 Correct 39 ms 3032 KB Output is correct
20 Correct 49 ms 3032 KB Output is correct
21 Correct 31 ms 2952 KB Output is correct
22 Correct 29 ms 2812 KB Output is correct
23 Correct 39 ms 3152 KB Output is correct
24 Correct 39 ms 3172 KB Output is correct
25 Correct 34 ms 3060 KB Output is correct
26 Correct 30 ms 2852 KB Output is correct
27 Correct 40 ms 3208 KB Output is correct
28 Correct 51 ms 3168 KB Output is correct
29 Correct 37 ms 3180 KB Output is correct
30 Correct 31 ms 2968 KB Output is correct
31 Correct 43 ms 3244 KB Output is correct
32 Correct 47 ms 3304 KB Output is correct
33 Correct 33 ms 3172 KB Output is correct
34 Correct 32 ms 3012 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 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 2 ms 336 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 13 ms 1232 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 976 KB Output is correct
12 Correct 14 ms 1344 KB Output is correct
13 Correct 10 ms 1344 KB Output is correct
14 Correct 13 ms 1232 KB Output is correct
15 Correct 47 ms 3044 KB Output is correct
16 Correct 39 ms 3004 KB Output is correct
17 Correct 27 ms 2912 KB Output is correct
18 Correct 30 ms 2732 KB Output is correct
19 Correct 39 ms 3032 KB Output is correct
20 Correct 49 ms 3032 KB Output is correct
21 Correct 31 ms 2952 KB Output is correct
22 Correct 29 ms 2812 KB Output is correct
23 Correct 39 ms 3152 KB Output is correct
24 Correct 39 ms 3172 KB Output is correct
25 Correct 34 ms 3060 KB Output is correct
26 Correct 30 ms 2852 KB Output is correct
27 Correct 40 ms 3208 KB Output is correct
28 Correct 51 ms 3168 KB Output is correct
29 Correct 37 ms 3180 KB Output is correct
30 Correct 31 ms 2968 KB Output is correct
31 Correct 43 ms 3244 KB Output is correct
32 Correct 47 ms 3304 KB Output is correct
33 Correct 33 ms 3172 KB Output is correct
34 Correct 32 ms 3012 KB Output is correct
35 Incorrect 41 ms 3264 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -