oj.uz

Submission #250134

# Submission time Handle Problem Language Result Execution time Memory
250134 2020-07-17T04:28:18 Z dwsc Minerals (JOI19_minerals) C++14
90 / 100
 108 ms 3884 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int in[100010];
void solve(vector<int> v1,vector<int> v2,bool in1){
    random_shuffle(v1.begin(),v1.end());
    random_shuffle(v2.begin(),v2.end());
    if (v1.size() == 1){
        Answer(v1[0],v2[0]);
        return;
    }
    int stop = v1.size()/2;
    vector<int> v1a,v1b,v2a,v2b;
    int num;
    for (int i = 0; i < v1.size(); i++){
        if (i < stop){
            num = Query(v1[i]);
            //if (in[v1[i]]) cout << "Added" << " " << v1[i] << "\n";
            //else cout << "Removed" << " " << v1[i] << "\n";
            v1a.push_back(v1[i]);
        }
        else{
            v1b.push_back(v1[i]);
        }
    }
    for (int i = 0; i < v2.size(); i++){
        if (v2a.size() == stop){
            v2b.push_back(v2[i]);
            continue;
        }
        if (v2b.size() == v2.size()-stop){
            v2a.push_back(v2[i]);
            continue;
        }
        int temp = Query(v2[i]);
        if (in1 && in[v2[i]]){
            if (temp < num) v2a.push_back(v2[i]);
            else v2b.push_back(v2[i]);
        }
        else if (in1 && !in[v2[i]]){
            if (temp > num) v2a.push_back(v2[i]);
            else v2b.push_back(v2[i]);
        }
        else if (!in1 && in[v2[i]]){
            if (temp == num) v2a.push_back(v2[i]);
            else v2b.push_back(v2[i]);
        }
        else{
            if (temp == num) v2a.push_back(v2[i]);
            else v2b.push_back(v2[i]);
        }
        in[v2[i]] = 1-in[v2[i]];
        num = temp;
    }
    solve(v1a,v2a,!in1);
    solve(v1b,v2b,in1);
}
void Solve(int N) {
    n = N;
    vector<int> v1,v2;
    int num = 0;
    for (int i = 1; i <= 2*N; i++){
        int temp = Query(i);
        in[i] = 1;
        if (temp > num){
            num++;
            v1.push_back(i);
        }
        else{
            v2.push_back(i);
        }
    }
    solve(v1,v2,1);
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>, bool)':
minerals.cpp:16:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v1.size(); i++){
                     ~~^~~~~~~~~~~
minerals.cpp:27:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v2.size(); i++){
                     ~~^~~~~~~~~~~
minerals.cpp:28:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (v2a.size() == stop){
             ~~~~~~~~~~~^~~~~~~
minerals.cpp:38:13: warning: 'num' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if (temp < num) v2a.push_back(v2[i]);
             ^~

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 416 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 2 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 9 ms 640 KB Output is correct
4 Correct 15 ms 896 KB Output is correct
5 Correct 33 ms 1536 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 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 33 ms 1536 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 20 ms 1152 KB Output is correct
12 Correct 30 ms 1584 KB Output is correct
13 Correct 30 ms 1580 KB Output is correct
14 Correct 30 ms 1664 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 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 33 ms 1536 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 20 ms 1152 KB Output is correct
12 Correct 30 ms 1584 KB Output is correct
13 Correct 30 ms 1580 KB Output is correct
14 Correct 30 ms 1664 KB Output is correct
15 Correct 85 ms 3476 KB Output is correct
16 Correct 84 ms 3468 KB Output is correct
17 Correct 82 ms 3464 KB Output is correct
18 Correct 82 ms 3372 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 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 33 ms 1536 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 20 ms 1152 KB Output is correct
12 Correct 30 ms 1584 KB Output is correct
13 Correct 30 ms 1580 KB Output is correct
14 Correct 30 ms 1664 KB Output is correct
15 Correct 85 ms 3476 KB Output is correct
16 Correct 84 ms 3468 KB Output is correct
17 Correct 82 ms 3464 KB Output is correct
18 Correct 82 ms 3372 KB Output is correct
19 Correct 87 ms 3596 KB Output is correct
20 Correct 86 ms 3620 KB Output is correct
21 Correct 84 ms 3572 KB Output is correct
22 Correct 93 ms 3460 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 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 33 ms 1536 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 20 ms 1152 KB Output is correct
12 Correct 30 ms 1584 KB Output is correct
13 Correct 30 ms 1580 KB Output is correct
14 Correct 30 ms 1664 KB Output is correct
15 Correct 85 ms 3476 KB Output is correct
16 Correct 84 ms 3468 KB Output is correct
17 Correct 82 ms 3464 KB Output is correct
18 Correct 82 ms 3372 KB Output is correct
19 Correct 87 ms 3596 KB Output is correct
20 Correct 86 ms 3620 KB Output is correct
21 Correct 84 ms 3572 KB Output is correct
22 Correct 93 ms 3460 KB Output is correct
23 Correct 92 ms 3588 KB Output is correct
24 Correct 98 ms 3700 KB Output is correct
25 Correct 101 ms 3700 KB Output is correct
26 Correct 91 ms 3516 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 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 33 ms 1536 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 20 ms 1152 KB Output is correct
12 Correct 30 ms 1584 KB Output is correct
13 Correct 30 ms 1580 KB Output is correct
14 Correct 30 ms 1664 KB Output is correct
15 Correct 85 ms 3476 KB Output is correct
16 Correct 84 ms 3468 KB Output is correct
17 Correct 82 ms 3464 KB Output is correct
18 Correct 82 ms 3372 KB Output is correct
19 Correct 87 ms 3596 KB Output is correct
20 Correct 86 ms 3620 KB Output is correct
21 Correct 84 ms 3572 KB Output is correct
22 Correct 93 ms 3460 KB Output is correct
23 Correct 92 ms 3588 KB Output is correct
24 Correct 98 ms 3700 KB Output is correct
25 Correct 101 ms 3700 KB Output is correct
26 Correct 91 ms 3516 KB Output is correct
27 Correct 108 ms 3700 KB Output is correct
28 Correct 104 ms 3884 KB Output is correct
29 Correct 93 ms 3712 KB Output is correct
30 Correct 96 ms 3560 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 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 33 ms 1536 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 20 ms 1152 KB Output is correct
12 Correct 30 ms 1584 KB Output is correct
13 Correct 30 ms 1580 KB Output is correct
14 Correct 30 ms 1664 KB Output is correct
15 Correct 85 ms 3476 KB Output is correct
16 Correct 84 ms 3468 KB Output is correct
17 Correct 82 ms 3464 KB Output is correct
18 Correct 82 ms 3372 KB Output is correct
19 Correct 87 ms 3596 KB Output is correct
20 Correct 86 ms 3620 KB Output is correct
21 Correct 84 ms 3572 KB Output is correct
22 Correct 93 ms 3460 KB Output is correct
23 Correct 92 ms 3588 KB Output is correct
24 Correct 98 ms 3700 KB Output is correct
25 Correct 101 ms 3700 KB Output is correct
26 Correct 91 ms 3516 KB Output is correct
27 Correct 108 ms 3700 KB Output is correct
28 Correct 104 ms 3884 KB Output is correct
29 Correct 93 ms 3712 KB Output is correct
30 Correct 96 ms 3560 KB Output is correct
31 Correct 95 ms 3840 KB Output is correct
32 Correct 98 ms 3848 KB Output is correct
33 Correct 98 ms 3748 KB Output is correct
34 Correct 91 ms 3636 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 416 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 33 ms 1536 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 20 ms 1152 KB Output is correct
12 Correct 30 ms 1584 KB Output is correct
13 Correct 30 ms 1580 KB Output is correct
14 Correct 30 ms 1664 KB Output is correct
15 Correct 85 ms 3476 KB Output is correct
16 Correct 84 ms 3468 KB Output is correct
17 Correct 82 ms 3464 KB Output is correct
18 Correct 82 ms 3372 KB Output is correct
19 Correct 87 ms 3596 KB Output is correct
20 Correct 86 ms 3620 KB Output is correct
21 Correct 84 ms 3572 KB Output is correct
22 Correct 93 ms 3460 KB Output is correct
23 Correct 92 ms 3588 KB Output is correct
24 Correct 98 ms 3700 KB Output is correct
25 Correct 101 ms 3700 KB Output is correct
26 Correct 91 ms 3516 KB Output is correct
27 Correct 108 ms 3700 KB Output is correct
28 Correct 104 ms 3884 KB Output is correct
29 Correct 93 ms 3712 KB Output is correct
30 Correct 96 ms 3560 KB Output is correct
31 Correct 95 ms 3840 KB Output is correct
32 Correct 98 ms 3848 KB Output is correct
33 Correct 98 ms 3748 KB Output is correct
34 Correct 91 ms 3636 KB Output is correct
35 Incorrect 94 ms 3844 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -