oj.uz

답안 #618796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618796 2022-08-02T07:32:38 Z maomao90 Minerals (JOI19_minerals) C++17
90 / 100
 60 ms 3964 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) / 2) {
        lfi.pb(fi[i]);
        inlfi[fi[i]] = 1;
    }
    REP (i, SZ(fi) / 2, SZ(se)) {
        rfi.pb(fi[i]);
    }
    int cnt = 0;
    for (int i : fi) {
        if (inlfi[i] ^ state[i]) {
            cnt++;
        }
    }
    for (int i : fi) {
        if (inlfi[i] ^ state[i] ^ (cnt * 2 > SZ(fi) && 0)) {
            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

# 결과 실행 시간 메모리 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 336 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 464 KB Output is correct
3 Correct 4 ms 592 KB Output is correct
4 Correct 12 ms 884 KB Output is correct
5 Correct 17 ms 1484 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 17 ms 1484 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 17 ms 1576 KB Output is correct
13 Correct 15 ms 1616 KB Output is correct
14 Correct 16 ms 1488 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 17 ms 1484 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 17 ms 1576 KB Output is correct
13 Correct 15 ms 1616 KB Output is correct
14 Correct 16 ms 1488 KB Output is correct
15 Correct 60 ms 3648 KB Output is correct
16 Correct 51 ms 3648 KB Output is correct
17 Correct 34 ms 3508 KB Output is correct
18 Correct 34 ms 3348 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 17 ms 1484 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 17 ms 1576 KB Output is correct
13 Correct 15 ms 1616 KB Output is correct
14 Correct 16 ms 1488 KB Output is correct
15 Correct 60 ms 3648 KB Output is correct
16 Correct 51 ms 3648 KB Output is correct
17 Correct 34 ms 3508 KB Output is correct
18 Correct 34 ms 3348 KB Output is correct
19 Correct 43 ms 3656 KB Output is correct
20 Correct 44 ms 3680 KB Output is correct
21 Correct 37 ms 3588 KB Output is correct
22 Correct 34 ms 3344 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 17 ms 1484 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 17 ms 1576 KB Output is correct
13 Correct 15 ms 1616 KB Output is correct
14 Correct 16 ms 1488 KB Output is correct
15 Correct 60 ms 3648 KB Output is correct
16 Correct 51 ms 3648 KB Output is correct
17 Correct 34 ms 3508 KB Output is correct
18 Correct 34 ms 3348 KB Output is correct
19 Correct 43 ms 3656 KB Output is correct
20 Correct 44 ms 3680 KB Output is correct
21 Correct 37 ms 3588 KB Output is correct
22 Correct 34 ms 3344 KB Output is correct
23 Correct 44 ms 3796 KB Output is correct
24 Correct 42 ms 3804 KB Output is correct
25 Correct 38 ms 3656 KB Output is correct
26 Correct 36 ms 3400 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 17 ms 1484 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 17 ms 1576 KB Output is correct
13 Correct 15 ms 1616 KB Output is correct
14 Correct 16 ms 1488 KB Output is correct
15 Correct 60 ms 3648 KB Output is correct
16 Correct 51 ms 3648 KB Output is correct
17 Correct 34 ms 3508 KB Output is correct
18 Correct 34 ms 3348 KB Output is correct
19 Correct 43 ms 3656 KB Output is correct
20 Correct 44 ms 3680 KB Output is correct
21 Correct 37 ms 3588 KB Output is correct
22 Correct 34 ms 3344 KB Output is correct
23 Correct 44 ms 3796 KB Output is correct
24 Correct 42 ms 3804 KB Output is correct
25 Correct 38 ms 3656 KB Output is correct
26 Correct 36 ms 3400 KB Output is correct
27 Correct 46 ms 3784 KB Output is correct
28 Correct 49 ms 3820 KB Output is correct
29 Correct 40 ms 3812 KB Output is correct
30 Correct 36 ms 3596 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 17 ms 1484 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 17 ms 1576 KB Output is correct
13 Correct 15 ms 1616 KB Output is correct
14 Correct 16 ms 1488 KB Output is correct
15 Correct 60 ms 3648 KB Output is correct
16 Correct 51 ms 3648 KB Output is correct
17 Correct 34 ms 3508 KB Output is correct
18 Correct 34 ms 3348 KB Output is correct
19 Correct 43 ms 3656 KB Output is correct
20 Correct 44 ms 3680 KB Output is correct
21 Correct 37 ms 3588 KB Output is correct
22 Correct 34 ms 3344 KB Output is correct
23 Correct 44 ms 3796 KB Output is correct
24 Correct 42 ms 3804 KB Output is correct
25 Correct 38 ms 3656 KB Output is correct
26 Correct 36 ms 3400 KB Output is correct
27 Correct 46 ms 3784 KB Output is correct
28 Correct 49 ms 3820 KB Output is correct
29 Correct 40 ms 3812 KB Output is correct
30 Correct 36 ms 3596 KB Output is correct
31 Correct 45 ms 3932 KB Output is correct
32 Correct 54 ms 3952 KB Output is correct
33 Correct 36 ms 3964 KB Output is correct
34 Correct 39 ms 3644 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 4 ms 592 KB Output is correct
8 Correct 12 ms 884 KB Output is correct
9 Correct 17 ms 1484 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 12 ms 1104 KB Output is correct
12 Correct 17 ms 1576 KB Output is correct
13 Correct 15 ms 1616 KB Output is correct
14 Correct 16 ms 1488 KB Output is correct
15 Correct 60 ms 3648 KB Output is correct
16 Correct 51 ms 3648 KB Output is correct
17 Correct 34 ms 3508 KB Output is correct
18 Correct 34 ms 3348 KB Output is correct
19 Correct 43 ms 3656 KB Output is correct
20 Correct 44 ms 3680 KB Output is correct
21 Correct 37 ms 3588 KB Output is correct
22 Correct 34 ms 3344 KB Output is correct
23 Correct 44 ms 3796 KB Output is correct
24 Correct 42 ms 3804 KB Output is correct
25 Correct 38 ms 3656 KB Output is correct
26 Correct 36 ms 3400 KB Output is correct
27 Correct 46 ms 3784 KB Output is correct
28 Correct 49 ms 3820 KB Output is correct
29 Correct 40 ms 3812 KB Output is correct
30 Correct 36 ms 3596 KB Output is correct
31 Correct 45 ms 3932 KB Output is correct
32 Correct 54 ms 3952 KB Output is correct
33 Correct 36 ms 3964 KB Output is correct
34 Correct 39 ms 3644 KB Output is correct
35 Incorrect 50 ms 3960 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -