oj.uz

Submission #122233

# Submission time Handle Problem Language Result Execution time Memory
122233 2019-06-27T22:31:48 Z duality Minerals (JOI19_minerals) C++14
90 / 100
 102 ms 4880 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "minerals.h"

int p = 0;
int test(int x) {
    int q = Query(x);
    if (p != q) {
        p = q;
        return 1;
    }
    else return 0;
}
int solve(vi a,vi b,int t) {
    if (a.size() == 1) {
        Answer(a[0],b[0]);
        return 0;
    }
    int i;
    int m = ceil(b.size()*0.3);
    vi a1,a2,b1,b2;
    random_shuffle(a.begin(),a.end());
    random_shuffle(b.begin(),b.end());
    for (i = 0; i < b.size(); i++) {
        if (i < m) test(b[i]),b1.pb(b[i]);
        else b2.pb(b[i]);
    }
    for (i = 0; i < a.size(); i++) {
        if (a1.size() == m) a2.pb(a[i]);
        else if (a2.size() == a.size()-m) a1.pb(a[i]);
        else if (test(a[i]) == t) a1.pb(a[i]);
        else a2.pb(a[i]);
    }
    solve(a1,b1,!t),solve(a2,b2,t);
    return 0;
}
void Solve(int N) {
    int i;
    srand(1234);
    vi a,b;
    for (i = 1; i <= 2*N; i++) {
        if (test(i)) a.pb(i);
        else b.pb(i);
    }
    solve(a,b,1);
}

Compilation message

minerals.cpp: In function 'int solve(vi, vi, int)':
minerals.cpp:78:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < b.size(); i++) {
                 ~~^~~~~~~~~~
minerals.cpp:82:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < a.size(); i++) {
                 ~~^~~~~~~~~~
minerals.cpp:83:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (a1.size() == m) a2.pb(a[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 384 KB Output is correct
3 Correct 3 ms 384 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 5 ms 512 KB Output is correct
3 Correct 8 ms 688 KB Output is correct
4 Correct 16 ms 1068 KB Output is correct
5 Correct 32 ms 1832 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 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 688 KB Output is correct
8 Correct 16 ms 1068 KB Output is correct
9 Correct 32 ms 1832 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1456 KB Output is correct
12 Correct 31 ms 2028 KB Output is correct
13 Correct 49 ms 1948 KB Output is correct
14 Correct 30 ms 1808 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 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 688 KB Output is correct
8 Correct 16 ms 1068 KB Output is correct
9 Correct 32 ms 1832 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1456 KB Output is correct
12 Correct 31 ms 2028 KB Output is correct
13 Correct 49 ms 1948 KB Output is correct
14 Correct 30 ms 1808 KB Output is correct
15 Correct 86 ms 4276 KB Output is correct
16 Correct 87 ms 4244 KB Output is correct
17 Correct 86 ms 4308 KB Output is correct
18 Correct 86 ms 4228 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 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 688 KB Output is correct
8 Correct 16 ms 1068 KB Output is correct
9 Correct 32 ms 1832 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1456 KB Output is correct
12 Correct 31 ms 2028 KB Output is correct
13 Correct 49 ms 1948 KB Output is correct
14 Correct 30 ms 1808 KB Output is correct
15 Correct 86 ms 4276 KB Output is correct
16 Correct 87 ms 4244 KB Output is correct
17 Correct 86 ms 4308 KB Output is correct
18 Correct 86 ms 4228 KB Output is correct
19 Correct 89 ms 4328 KB Output is correct
20 Correct 90 ms 4408 KB Output is correct
21 Correct 87 ms 4324 KB Output is correct
22 Correct 84 ms 4288 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 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 688 KB Output is correct
8 Correct 16 ms 1068 KB Output is correct
9 Correct 32 ms 1832 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1456 KB Output is correct
12 Correct 31 ms 2028 KB Output is correct
13 Correct 49 ms 1948 KB Output is correct
14 Correct 30 ms 1808 KB Output is correct
15 Correct 86 ms 4276 KB Output is correct
16 Correct 87 ms 4244 KB Output is correct
17 Correct 86 ms 4308 KB Output is correct
18 Correct 86 ms 4228 KB Output is correct
19 Correct 89 ms 4328 KB Output is correct
20 Correct 90 ms 4408 KB Output is correct
21 Correct 87 ms 4324 KB Output is correct
22 Correct 84 ms 4288 KB Output is correct
23 Correct 92 ms 4540 KB Output is correct
24 Correct 94 ms 4520 KB Output is correct
25 Correct 89 ms 4508 KB Output is correct
26 Correct 88 ms 4416 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 688 KB Output is correct
8 Correct 16 ms 1068 KB Output is correct
9 Correct 32 ms 1832 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1456 KB Output is correct
12 Correct 31 ms 2028 KB Output is correct
13 Correct 49 ms 1948 KB Output is correct
14 Correct 30 ms 1808 KB Output is correct
15 Correct 86 ms 4276 KB Output is correct
16 Correct 87 ms 4244 KB Output is correct
17 Correct 86 ms 4308 KB Output is correct
18 Correct 86 ms 4228 KB Output is correct
19 Correct 89 ms 4328 KB Output is correct
20 Correct 90 ms 4408 KB Output is correct
21 Correct 87 ms 4324 KB Output is correct
22 Correct 84 ms 4288 KB Output is correct
23 Correct 92 ms 4540 KB Output is correct
24 Correct 94 ms 4520 KB Output is correct
25 Correct 89 ms 4508 KB Output is correct
26 Correct 88 ms 4416 KB Output is correct
27 Correct 93 ms 4744 KB Output is correct
28 Correct 93 ms 4580 KB Output is correct
29 Correct 92 ms 4604 KB Output is correct
30 Correct 99 ms 4404 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 688 KB Output is correct
8 Correct 16 ms 1068 KB Output is correct
9 Correct 32 ms 1832 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1456 KB Output is correct
12 Correct 31 ms 2028 KB Output is correct
13 Correct 49 ms 1948 KB Output is correct
14 Correct 30 ms 1808 KB Output is correct
15 Correct 86 ms 4276 KB Output is correct
16 Correct 87 ms 4244 KB Output is correct
17 Correct 86 ms 4308 KB Output is correct
18 Correct 86 ms 4228 KB Output is correct
19 Correct 89 ms 4328 KB Output is correct
20 Correct 90 ms 4408 KB Output is correct
21 Correct 87 ms 4324 KB Output is correct
22 Correct 84 ms 4288 KB Output is correct
23 Correct 92 ms 4540 KB Output is correct
24 Correct 94 ms 4520 KB Output is correct
25 Correct 89 ms 4508 KB Output is correct
26 Correct 88 ms 4416 KB Output is correct
27 Correct 93 ms 4744 KB Output is correct
28 Correct 93 ms 4580 KB Output is correct
29 Correct 92 ms 4604 KB Output is correct
30 Correct 99 ms 4404 KB Output is correct
31 Correct 95 ms 4740 KB Output is correct
32 Correct 96 ms 4736 KB Output is correct
33 Correct 94 ms 4752 KB Output is correct
34 Correct 95 ms 4576 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 688 KB Output is correct
8 Correct 16 ms 1068 KB Output is correct
9 Correct 32 ms 1832 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1456 KB Output is correct
12 Correct 31 ms 2028 KB Output is correct
13 Correct 49 ms 1948 KB Output is correct
14 Correct 30 ms 1808 KB Output is correct
15 Correct 86 ms 4276 KB Output is correct
16 Correct 87 ms 4244 KB Output is correct
17 Correct 86 ms 4308 KB Output is correct
18 Correct 86 ms 4228 KB Output is correct
19 Correct 89 ms 4328 KB Output is correct
20 Correct 90 ms 4408 KB Output is correct
21 Correct 87 ms 4324 KB Output is correct
22 Correct 84 ms 4288 KB Output is correct
23 Correct 92 ms 4540 KB Output is correct
24 Correct 94 ms 4520 KB Output is correct
25 Correct 89 ms 4508 KB Output is correct
26 Correct 88 ms 4416 KB Output is correct
27 Correct 93 ms 4744 KB Output is correct
28 Correct 93 ms 4580 KB Output is correct
29 Correct 92 ms 4604 KB Output is correct
30 Correct 99 ms 4404 KB Output is correct
31 Correct 95 ms 4740 KB Output is correct
32 Correct 96 ms 4736 KB Output is correct
33 Correct 94 ms 4752 KB Output is correct
34 Correct 95 ms 4576 KB Output is correct
35 Correct 102 ms 4800 KB Output is correct
36 Correct 99 ms 4880 KB Output is correct
37 Incorrect 98 ms 4788 KB Wrong Answer [2]
38 Halted 0 ms 0 KB -