oj.uz

Submission #120681

# Submission time Handle Problem Language Result Execution time Memory
120681 2019-06-25T08:07:34 Z 이온조(#2959) Minerals (JOI19_minerals) C++14
80 / 100
 42 ms 2868 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

bool chk[100009];

int query(int x) {
    chk[x] = !chk[x];
    //printf("query x: %d\n", x);
    return Query(x);
}

void answer(int a, int b) {
    //printf("answer: (%d, %d)\n", a, b);
    Answer(a, b);
}

pair<vi, vi> split(int N) {
    vector<int> A, B;
    int pr = 0;
    for(int i=1; i<=2*N; i++) {
        int Q = query(i);
        if(pr != Q) A.push_back(i);
        else B.push_back(i);
        pr = Q;
    }
    return {A, B};
}

void go(vector<int> &A, vector<int> &B, bool AC, bool BC) {
    //puts("AB");
    //for(auto& it: A) printf("%d ",it); puts("");
    //for(auto& it: B) printf("%d ",it); puts("");
    int N = A.size();
    if(N == 1) {
        answer(A[0], B[0]);
        return;
    }
    if(N == 2) {
        int X = query(A[0]);
        int Y = query(B[0]);
        if(!AC && !BC && X != Y) swap(A[0], A[1]);
        if(!AC && BC && X != Y) swap(A[0], A[1]);
        if(AC && !BC && X == Y) swap(A[0], A[1]);
        if(AC && BC && X == Y) swap(A[0], A[1]);
        answer(A[0], B[0]);
        answer(A[1], B[1]);
        return;
    }
    if(!AC) {
        int m = N/2, pr;
        vector<int> LA, RA, LB, RB;
        for(int i=0; i<m; i++) {
            pr = query(A[i]);
            LA.push_back(A[i]);
        }
        for(int i=m; i<N; i++) RA.push_back(A[i]);
        for(int i=0; i<N; i++) {
            int Q = query(B[i]);
            if(pr != Q) RB.push_back(B[i]);
            else LB.push_back(B[i]);
            pr = Q;
        }
        go(LA, LB, 1, !BC);
        go(RA, RB, 0, !BC);
    }
    if(AC) {
        int m = N/2, pr;
        vector<int> LA, RA, LB, RB;
        for(int i=0; i<m; i++) {
            pr = query(A[i]);
            LA.push_back(A[i]);
        }
        for(int i=m; i<N; i++) RA.push_back(A[i]);
        for(int i=0; i<N; i++) {
            int Q = query(B[i]);
            if(pr != Q) LB.push_back(B[i]);
            else RB.push_back(B[i]);
            pr = Q;
        }
        go(LA, LB, 0, !BC);
        go(RA, RB, 1, !BC);
    }
}

void Solve(int N) {
    vi A, B; tie(A, B) = split(N);
    go(A, B, 1, 1);
}

Compilation message

minerals.cpp: In function 'void go(std::vector<int>&, std::vector<int>&, bool, bool)':
minerals.cpp:78:13: warning: 'pr' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(pr != Q) LB.push_back(B[i]);
             ^~
minerals.cpp:61:13: warning: 'pr' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(pr != Q) RB.push_back(B[i]);
             ^~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 8 ms 640 KB Output is correct
5 Correct 14 ms 1152 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 14 ms 1152 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 42 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 14 ms 1152 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 42 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 39 ms 2636 KB Output is correct
16 Correct 39 ms 2628 KB Output is correct
17 Correct 29 ms 2628 KB Output is correct
18 Correct 29 ms 2508 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 14 ms 1152 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 42 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 39 ms 2636 KB Output is correct
16 Correct 39 ms 2628 KB Output is correct
17 Correct 29 ms 2628 KB Output is correct
18 Correct 29 ms 2508 KB Output is correct
19 Correct 40 ms 2728 KB Output is correct
20 Correct 39 ms 2736 KB Output is correct
21 Correct 29 ms 2580 KB Output is correct
22 Correct 29 ms 2492 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 14 ms 1152 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 42 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 39 ms 2636 KB Output is correct
16 Correct 39 ms 2628 KB Output is correct
17 Correct 29 ms 2628 KB Output is correct
18 Correct 29 ms 2508 KB Output is correct
19 Correct 40 ms 2728 KB Output is correct
20 Correct 39 ms 2736 KB Output is correct
21 Correct 29 ms 2580 KB Output is correct
22 Correct 29 ms 2492 KB Output is correct
23 Correct 41 ms 2868 KB Output is correct
24 Correct 40 ms 2796 KB Output is correct
25 Correct 30 ms 2740 KB Output is correct
26 Correct 31 ms 2572 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 14 ms 1152 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 42 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 39 ms 2636 KB Output is correct
16 Correct 39 ms 2628 KB Output is correct
17 Correct 29 ms 2628 KB Output is correct
18 Correct 29 ms 2508 KB Output is correct
19 Correct 40 ms 2728 KB Output is correct
20 Correct 39 ms 2736 KB Output is correct
21 Correct 29 ms 2580 KB Output is correct
22 Correct 29 ms 2492 KB Output is correct
23 Correct 41 ms 2868 KB Output is correct
24 Correct 40 ms 2796 KB Output is correct
25 Correct 30 ms 2740 KB Output is correct
26 Correct 31 ms 2572 KB Output is correct
27 Incorrect 40 ms 2840 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 14 ms 1152 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 42 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 39 ms 2636 KB Output is correct
16 Correct 39 ms 2628 KB Output is correct
17 Correct 29 ms 2628 KB Output is correct
18 Correct 29 ms 2508 KB Output is correct
19 Correct 40 ms 2728 KB Output is correct
20 Correct 39 ms 2736 KB Output is correct
21 Correct 29 ms 2580 KB Output is correct
22 Correct 29 ms 2492 KB Output is correct
23 Correct 41 ms 2868 KB Output is correct
24 Correct 40 ms 2796 KB Output is correct
25 Correct 30 ms 2740 KB Output is correct
26 Correct 31 ms 2572 KB Output is correct
27 Incorrect 40 ms 2840 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 14 ms 1152 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 42 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 39 ms 2636 KB Output is correct
16 Correct 39 ms 2628 KB Output is correct
17 Correct 29 ms 2628 KB Output is correct
18 Correct 29 ms 2508 KB Output is correct
19 Correct 40 ms 2728 KB Output is correct
20 Correct 39 ms 2736 KB Output is correct
21 Correct 29 ms 2580 KB Output is correct
22 Correct 29 ms 2492 KB Output is correct
23 Correct 41 ms 2868 KB Output is correct
24 Correct 40 ms 2796 KB Output is correct
25 Correct 30 ms 2740 KB Output is correct
26 Correct 31 ms 2572 KB Output is correct
27 Incorrect 40 ms 2840 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -