oj.uz

Submission #250150

# Submission time Handle Problem Language Result Execution time Memory
250150 2020-07-17T04:59:43 Z dantoh000 Minerals (JOI19_minerals) C++14
90 / 100
 60 ms 3556 KB 
#include <bits/stdc++.h>
#include "minerals.h"
using namespace std;
vector<int> Q;
vector<int> P;
int ans[86005];
int ON[86005];
int last;
int query(int x){
    ON[x] ^= 1;
    return Query(x);
}
void solve(vector<int> p, int l, int r, int flag){

    if (r == l){
        Answer(Q[l],p[0]);
        return;
    }
    else if (l + 1 == r){
        //printf("last query %d\n",last);
        int q1;
        if (flag) q1 = query(Q[r]);
        else q1 = query(Q[l]);
        assert(ON[Q[l]] && !ON[Q[r]]);
        if (ON[p[0]] ^ ON[p[1]]){
            //printf("-----------------------------------------TWO\n");
            //printf("%d %d <-> %d %d\n",Q[l],Q[r],p[0],p[1]);
            //printf("flag = %d, q1 = %d, last = %d\n",flag,q1,last);
            int On = ON[p[0]]?0:1;
            int Off = 1^On;
            On = p[On], Off = p[Off];
            if ((q1 == last) ^ flag){
                Answer(Q[l],On);
                Answer(Q[r],Off);
            }
            else{
                Answer(Q[l],Off);
                Answer(Q[r],On);
            }
            last = q1;
            return;
        }
        last = q1;
        q1 = query(p[0]);
        if ((q1 == last)) ans[Q[l]] = p[0], ans[Q[r]] = p[1];
        else ans[Q[l]] = p[1], ans[Q[r]] = p[0];
        Answer(Q[l],ans[Q[l]]);
        Answer(Q[r],ans[Q[r]]);
        last = q1;
        return;
    }
#ifdef debug
    printf("new <%d,%d> %d\n",l,r,flag);
    for (auto x : p){
        printf("%d ",x);
    }
    printf("<- P\n");
    for (int i = l; i <= r; i++){
        printf("%d ",Q[i]);
    }
    printf("<- Q\n");
#endif
    //assert(p.size() == r-l+1);
    vector<int> Lp;
    vector<int> Rp;
    int n = r-l+1;
    int mid;
    mid = (l+r)/2;
    if (flag){
        for (int i = mid+1; i <= r; i++){
            last = query(Q[i]);
        }
    }
    else{
        for (int i = l; i <= mid; i++){
            last = query(Q[i]);
        }
    }

    for (int i = 0; i < n; i++){
        int q = query(p[i]);
        if (q == last){
            Lp.push_back(p[i]);
        }
        else{
            Rp.push_back(p[i]);
        }
        last = q;
        if (Lp.size() == mid-l+1 || Rp.size() == r-mid){
            //printf("ALL FILLED\n");
            for (int j = i+1; j < n; j++){
                if (Lp.size() == mid-l+1) Rp.push_back(p[j]);
                else Lp.push_back(p[j]);
            }
            break;
        }

    }
#ifdef debug
    printf("Lp: ");
    for (auto x : Lp) printf("%d ",x);
    printf("\n");
    printf("Rp: ");
    for (auto x : Rp) printf("%d ",x);
    printf("\n");
#endif

    solve(Lp, l, mid, 1);
    solve(Rp, mid+1, r, 0);


}
void Solve(int N) {
    int last = 0;
    for (int i = 1; i <= 2*N; i++){
        int q = query(i);
        if (q == last){
            Q.push_back(i);
        }
        else{
            P.push_back(i);
        }
        last = q;
        ON[i] = 1;
    }
    srand(time(NULL));
    random_shuffle(Q.begin(),Q.end());
    random_shuffle(P.begin(),P.end());
    solve(P,0,N-1,1);
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>, int, int, int)':
minerals.cpp:89:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (Lp.size() == mid-l+1 || Rp.size() == r-mid){
             ~~~~~~~~~~^~~~~~~~~~
minerals.cpp:89:47: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (Lp.size() == mid-l+1 || Rp.size() == r-mid){
                                     ~~~~~~~~~~^~~~~~~~
minerals.cpp:92:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (Lp.size() == mid-l+1) Rp.push_back(p[j]);
                     ~~~~~~~~~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 17 ms 1280 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 59 ms 3096 KB Output is correct
16 Correct 50 ms 3232 KB Output is correct
17 Correct 48 ms 3188 KB Output is correct
18 Correct 49 ms 2932 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 17 ms 1280 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 59 ms 3096 KB Output is correct
16 Correct 50 ms 3232 KB Output is correct
17 Correct 48 ms 3188 KB Output is correct
18 Correct 49 ms 2932 KB Output is correct
19 Correct 54 ms 3188 KB Output is correct
20 Correct 52 ms 3216 KB Output is correct
21 Correct 49 ms 3196 KB Output is correct
22 Correct 49 ms 2932 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 17 ms 1280 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 59 ms 3096 KB Output is correct
16 Correct 50 ms 3232 KB Output is correct
17 Correct 48 ms 3188 KB Output is correct
18 Correct 49 ms 2932 KB Output is correct
19 Correct 54 ms 3188 KB Output is correct
20 Correct 52 ms 3216 KB Output is correct
21 Correct 49 ms 3196 KB Output is correct
22 Correct 49 ms 2932 KB Output is correct
23 Correct 58 ms 3316 KB Output is correct
24 Correct 60 ms 3280 KB Output is correct
25 Correct 50 ms 3316 KB Output is correct
26 Correct 49 ms 2940 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 17 ms 1280 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 59 ms 3096 KB Output is correct
16 Correct 50 ms 3232 KB Output is correct
17 Correct 48 ms 3188 KB Output is correct
18 Correct 49 ms 2932 KB Output is correct
19 Correct 54 ms 3188 KB Output is correct
20 Correct 52 ms 3216 KB Output is correct
21 Correct 49 ms 3196 KB Output is correct
22 Correct 49 ms 2932 KB Output is correct
23 Correct 58 ms 3316 KB Output is correct
24 Correct 60 ms 3280 KB Output is correct
25 Correct 50 ms 3316 KB Output is correct
26 Correct 49 ms 2940 KB Output is correct
27 Correct 53 ms 3324 KB Output is correct
28 Correct 54 ms 3328 KB Output is correct
29 Correct 51 ms 3316 KB Output is correct
30 Correct 51 ms 3064 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 17 ms 1280 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 59 ms 3096 KB Output is correct
16 Correct 50 ms 3232 KB Output is correct
17 Correct 48 ms 3188 KB Output is correct
18 Correct 49 ms 2932 KB Output is correct
19 Correct 54 ms 3188 KB Output is correct
20 Correct 52 ms 3216 KB Output is correct
21 Correct 49 ms 3196 KB Output is correct
22 Correct 49 ms 2932 KB Output is correct
23 Correct 58 ms 3316 KB Output is correct
24 Correct 60 ms 3280 KB Output is correct
25 Correct 50 ms 3316 KB Output is correct
26 Correct 49 ms 2940 KB Output is correct
27 Correct 53 ms 3324 KB Output is correct
28 Correct 54 ms 3328 KB Output is correct
29 Correct 51 ms 3316 KB Output is correct
30 Correct 51 ms 3064 KB Output is correct
31 Correct 56 ms 3444 KB Output is correct
32 Correct 57 ms 3556 KB Output is correct
33 Correct 53 ms 3448 KB Output is correct
34 Correct 53 ms 3060 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 17 ms 1280 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct
14 Correct 16 ms 1280 KB Output is correct
15 Correct 59 ms 3096 KB Output is correct
16 Correct 50 ms 3232 KB Output is correct
17 Correct 48 ms 3188 KB Output is correct
18 Correct 49 ms 2932 KB Output is correct
19 Correct 54 ms 3188 KB Output is correct
20 Correct 52 ms 3216 KB Output is correct
21 Correct 49 ms 3196 KB Output is correct
22 Correct 49 ms 2932 KB Output is correct
23 Correct 58 ms 3316 KB Output is correct
24 Correct 60 ms 3280 KB Output is correct
25 Correct 50 ms 3316 KB Output is correct
26 Correct 49 ms 2940 KB Output is correct
27 Correct 53 ms 3324 KB Output is correct
28 Correct 54 ms 3328 KB Output is correct
29 Correct 51 ms 3316 KB Output is correct
30 Correct 51 ms 3064 KB Output is correct
31 Correct 56 ms 3444 KB Output is correct
32 Correct 57 ms 3556 KB Output is correct
33 Correct 53 ms 3448 KB Output is correct
34 Correct 53 ms 3060 KB Output is correct
35 Incorrect 55 ms 3464 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -