oj.uz

Submission #120686

# Submission time Handle Problem Language Result Execution time Memory
120686 2019-06-25T08:20:31 Z 이온조(#2959) Minerals (JOI19_minerals) C++14
90 / 100
 69 ms 2900 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) {
    //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(!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]);
        int i;
        for(i=0; i<N; i++) {
            int Q = query(B[i]);
            if(pr != Q) RB.push_back(B[i]);
            else LB.push_back(B[i]);
            if(RB.size() == RA.size()) break;
            if(LB.size() == LA.size()) break;
            pr = Q;
        }
        if(RB.size() == RA.size()) for(++i; i<N; i++) LB.push_back(B[i]);
        else for(++i; i<N; i++) RB.push_back(B[i]);
        go(LA, LB, 1);
        go(RA, RB, 0);
    }
    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]);
        int i;
        for(i=0; i<N; i++) {
            int Q = query(B[i]);
            if(pr != Q) LB.push_back(B[i]);
            else RB.push_back(B[i]);
            if(RB.size() == RA.size()) break;
            if(LB.size() == LA.size()) break;
            pr = Q;
        }
        if(RB.size() == RA.size()) for(++i; i<N; i++) LB.push_back(B[i]);
        else for(++i; i<N; i++) RB.push_back(B[i]);
        go(LA, LB, 0);
        go(RA, RB, 1);
    }
}

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

Compilation message

minerals.cpp: In function 'void go(std::vector<int>&, std::vector<int>&, bool)':
minerals.cpp:73:13: warning: 'pr' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if(pr != Q) LB.push_back(B[i]);
             ^~
minerals.cpp:51: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 284 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 636 KB Output is correct
5 Correct 16 ms 1084 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 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 636 KB Output is correct
9 Correct 16 ms 1084 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 12 ms 1064 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 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 636 KB Output is correct
9 Correct 16 ms 1084 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 12 ms 1064 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 42 ms 2672 KB Output is correct
17 Correct 31 ms 2624 KB Output is correct
18 Correct 31 ms 2620 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 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 636 KB Output is correct
9 Correct 16 ms 1084 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 12 ms 1064 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 42 ms 2672 KB Output is correct
17 Correct 31 ms 2624 KB Output is correct
18 Correct 31 ms 2620 KB Output is correct
19 Correct 43 ms 2748 KB Output is correct
20 Correct 69 ms 2844 KB Output is correct
21 Correct 33 ms 2620 KB Output is correct
22 Correct 30 ms 2512 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 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 636 KB Output is correct
9 Correct 16 ms 1084 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 12 ms 1064 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 42 ms 2672 KB Output is correct
17 Correct 31 ms 2624 KB Output is correct
18 Correct 31 ms 2620 KB Output is correct
19 Correct 43 ms 2748 KB Output is correct
20 Correct 69 ms 2844 KB Output is correct
21 Correct 33 ms 2620 KB Output is correct
22 Correct 30 ms 2512 KB Output is correct
23 Correct 46 ms 2748 KB Output is correct
24 Correct 43 ms 2740 KB Output is correct
25 Correct 31 ms 2696 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 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 636 KB Output is correct
9 Correct 16 ms 1084 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 12 ms 1064 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 42 ms 2672 KB Output is correct
17 Correct 31 ms 2624 KB Output is correct
18 Correct 31 ms 2620 KB Output is correct
19 Correct 43 ms 2748 KB Output is correct
20 Correct 69 ms 2844 KB Output is correct
21 Correct 33 ms 2620 KB Output is correct
22 Correct 30 ms 2512 KB Output is correct
23 Correct 46 ms 2748 KB Output is correct
24 Correct 43 ms 2740 KB Output is correct
25 Correct 31 ms 2696 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct
27 Correct 46 ms 2836 KB Output is correct
28 Correct 47 ms 2840 KB Output is correct
29 Correct 33 ms 2732 KB Output is correct
30 Correct 33 ms 2524 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 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 636 KB Output is correct
9 Correct 16 ms 1084 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 12 ms 1064 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 42 ms 2672 KB Output is correct
17 Correct 31 ms 2624 KB Output is correct
18 Correct 31 ms 2620 KB Output is correct
19 Correct 43 ms 2748 KB Output is correct
20 Correct 69 ms 2844 KB Output is correct
21 Correct 33 ms 2620 KB Output is correct
22 Correct 30 ms 2512 KB Output is correct
23 Correct 46 ms 2748 KB Output is correct
24 Correct 43 ms 2740 KB Output is correct
25 Correct 31 ms 2696 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct
27 Correct 46 ms 2836 KB Output is correct
28 Correct 47 ms 2840 KB Output is correct
29 Correct 33 ms 2732 KB Output is correct
30 Correct 33 ms 2524 KB Output is correct
31 Correct 48 ms 2900 KB Output is correct
32 Correct 46 ms 2852 KB Output is correct
33 Correct 34 ms 2724 KB Output is correct
34 Correct 33 ms 2596 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 284 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 636 KB Output is correct
9 Correct 16 ms 1084 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 15 ms 1152 KB Output is correct
13 Correct 13 ms 1280 KB Output is correct
14 Correct 12 ms 1064 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 42 ms 2672 KB Output is correct
17 Correct 31 ms 2624 KB Output is correct
18 Correct 31 ms 2620 KB Output is correct
19 Correct 43 ms 2748 KB Output is correct
20 Correct 69 ms 2844 KB Output is correct
21 Correct 33 ms 2620 KB Output is correct
22 Correct 30 ms 2512 KB Output is correct
23 Correct 46 ms 2748 KB Output is correct
24 Correct 43 ms 2740 KB Output is correct
25 Correct 31 ms 2696 KB Output is correct
26 Correct 32 ms 2488 KB Output is correct
27 Correct 46 ms 2836 KB Output is correct
28 Correct 47 ms 2840 KB Output is correct
29 Correct 33 ms 2732 KB Output is correct
30 Correct 33 ms 2524 KB Output is correct
31 Correct 48 ms 2900 KB Output is correct
32 Correct 46 ms 2852 KB Output is correct
33 Correct 34 ms 2724 KB Output is correct
34 Correct 33 ms 2596 KB Output is correct
35 Incorrect 47 ms 2852 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -