oj.uz

Submission #872422

# Submission time Handle Problem Language Result Execution time Memory
872422 2023-11-13T05:13:54 Z browntoad Minerals (JOI19_minerals) C++14
85 / 100
 30 ms 3556 KB 
#include <bits/stdc++.h>
#include <minerals.h>
using namespace std;
#define ll long long
// #define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define RREP1(i, n) for (int i = (n); i >= 1; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define pb push_back
#define pii pair<int, int>
#define f first
#define s second

const ll maxn = 5e5+5;
const ll inf = (1ll<<60);
const ll mod = 1000992299;

const long double p = 0.38;

int ou;
void run(vector<int> &L, vector<int> &R, bool x){
    if (SZ(L) == 1 && SZ(R) == 1){
        Answer(L[0], R[0]);
        return;
    }
    int mid = SZ(L)*p, ret;
    vector<int> lll, lr, rl, rr;
    if (SZ(L) == 2 && SZ(R) == 2){
        if (x == 0){
            ou = Query(L[0]);
            ret = Query(R[0]);
            if (ret != ou){
                Answer(L[0], R[1]);
                Answer(L[1], R[0]);
            }
            else{
                Answer(L[0], R[0]);
                Answer(L[1], R[1]);
            }
        }
        else {
            ou = Query(L[0]);
            ret = Query(R[0]);
            if (ret == ou){
                Answer(L[0], R[1]);
                Answer(L[1], R[0]);
            }
            else{
                Answer(L[0], R[0]);
                Answer(L[1], R[1]);
            }
        }
        return;
    }
    REP(i, mid){
        ou = Query(L[i]);
        lll.pb(L[i]);
    }
    FOR(i, mid, SZ(L)){
        rl.pb(L[i]);
    }
    if (x == 0){
        REP(i, SZ(R)){
            /*if (SZ(lll) == SZ(lr)){
                rr.pb(R[i]);
                continue;
            }
            if (SZ(rl) == SZ(rr)){
                lr.pb(R[i]);
                continue;
            }
            */
            ret = Query(R[i]);
            if (ret == ou) lr.pb(R[i]);
            else rr.pb(R[i]);
            ou = ret;
        }
        run(lll, lr, 1);
        run(rl, rr, 0);
    }
    else {
        REP(i, SZ(R)){
            /*if (SZ(lll) == SZ(lr)){
                rr.pb(R[i]);
                continue;
            }
            if (SZ(rl) == SZ(rr)){
                lr.pb(R[i]);
                continue;
            }
            */
            ret = Query(R[i]);
            if (ret != ou) lr.pb(R[i]);
            else rr.pb(R[i]);
            ou = ret;
        }
        run(lll, lr, 0);
        run(rl, rr, 1);
    }
}
void Solve(int N){
    vector<int> a, b;
    //REP1(i, N) a.pb(i);
    //FOR(i, N+1, 2*N+1) b.pb(i);
    int ret, prev = 0;
    REP1(i, 2*N){
        ret = Query(i);
        if (ret != prev) {
            a.pb(i);
            prev = ret;
        }
        else {
            b.pb(i);
        }
    }
    ou = prev;
    random_shuffle(ALL(a));
    random_shuffle(ALL(b));
    //REP(i, SZ(a)) Query(a[i]);
    run(a, b, 1);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 5 ms 856 KB Output is correct
5 Correct 10 ms 1340 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1028 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 9 ms 1532 KB Output is correct
14 Correct 9 ms 1568 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1028 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 9 ms 1532 KB Output is correct
14 Correct 9 ms 1568 KB Output is correct
15 Correct 26 ms 2864 KB Output is correct
16 Correct 26 ms 2808 KB Output is correct
17 Correct 24 ms 3048 KB Output is correct
18 Correct 25 ms 2916 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1028 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 9 ms 1532 KB Output is correct
14 Correct 9 ms 1568 KB Output is correct
15 Correct 26 ms 2864 KB Output is correct
16 Correct 26 ms 2808 KB Output is correct
17 Correct 24 ms 3048 KB Output is correct
18 Correct 25 ms 2916 KB Output is correct
19 Correct 26 ms 2860 KB Output is correct
20 Correct 26 ms 2756 KB Output is correct
21 Correct 25 ms 3384 KB Output is correct
22 Correct 25 ms 2872 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1028 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 9 ms 1532 KB Output is correct
14 Correct 9 ms 1568 KB Output is correct
15 Correct 26 ms 2864 KB Output is correct
16 Correct 26 ms 2808 KB Output is correct
17 Correct 24 ms 3048 KB Output is correct
18 Correct 25 ms 2916 KB Output is correct
19 Correct 26 ms 2860 KB Output is correct
20 Correct 26 ms 2756 KB Output is correct
21 Correct 25 ms 3384 KB Output is correct
22 Correct 25 ms 2872 KB Output is correct
23 Correct 28 ms 2900 KB Output is correct
24 Correct 26 ms 3152 KB Output is correct
25 Correct 25 ms 3020 KB Output is correct
26 Correct 26 ms 3160 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1028 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 9 ms 1532 KB Output is correct
14 Correct 9 ms 1568 KB Output is correct
15 Correct 26 ms 2864 KB Output is correct
16 Correct 26 ms 2808 KB Output is correct
17 Correct 24 ms 3048 KB Output is correct
18 Correct 25 ms 2916 KB Output is correct
19 Correct 26 ms 2860 KB Output is correct
20 Correct 26 ms 2756 KB Output is correct
21 Correct 25 ms 3384 KB Output is correct
22 Correct 25 ms 2872 KB Output is correct
23 Correct 28 ms 2900 KB Output is correct
24 Correct 26 ms 3152 KB Output is correct
25 Correct 25 ms 3020 KB Output is correct
26 Correct 26 ms 3160 KB Output is correct
27 Correct 27 ms 2892 KB Output is correct
28 Correct 30 ms 2932 KB Output is correct
29 Correct 26 ms 3556 KB Output is correct
30 Correct 29 ms 2852 KB Output is correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1028 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 9 ms 1532 KB Output is correct
14 Correct 9 ms 1568 KB Output is correct
15 Correct 26 ms 2864 KB Output is correct
16 Correct 26 ms 2808 KB Output is correct
17 Correct 24 ms 3048 KB Output is correct
18 Correct 25 ms 2916 KB Output is correct
19 Correct 26 ms 2860 KB Output is correct
20 Correct 26 ms 2756 KB Output is correct
21 Correct 25 ms 3384 KB Output is correct
22 Correct 25 ms 2872 KB Output is correct
23 Correct 28 ms 2900 KB Output is correct
24 Correct 26 ms 3152 KB Output is correct
25 Correct 25 ms 3020 KB Output is correct
26 Correct 26 ms 3160 KB Output is correct
27 Correct 27 ms 2892 KB Output is correct
28 Correct 30 ms 2932 KB Output is correct
29 Correct 26 ms 3556 KB Output is correct
30 Correct 29 ms 2852 KB Output is correct
31 Incorrect 30 ms 3152 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 10 ms 1340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1028 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 9 ms 1532 KB Output is correct
14 Correct 9 ms 1568 KB Output is correct
15 Correct 26 ms 2864 KB Output is correct
16 Correct 26 ms 2808 KB Output is correct
17 Correct 24 ms 3048 KB Output is correct
18 Correct 25 ms 2916 KB Output is correct
19 Correct 26 ms 2860 KB Output is correct
20 Correct 26 ms 2756 KB Output is correct
21 Correct 25 ms 3384 KB Output is correct
22 Correct 25 ms 2872 KB Output is correct
23 Correct 28 ms 2900 KB Output is correct
24 Correct 26 ms 3152 KB Output is correct
25 Correct 25 ms 3020 KB Output is correct
26 Correct 26 ms 3160 KB Output is correct
27 Correct 27 ms 2892 KB Output is correct
28 Correct 30 ms 2932 KB Output is correct
29 Correct 26 ms 3556 KB Output is correct
30 Correct 29 ms 2852 KB Output is correct
31 Incorrect 30 ms 3152 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -