oj.uz

답안 #122244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122244 2019-06-27T23:40:41 Z duality Minerals (JOI19_minerals) C++14
100 / 100
 96 ms 4264 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.382);
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 9 ms 768 KB Output is correct
4 Correct 16 ms 1008 KB Output is correct
5 Correct 30 ms 1604 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 16 ms 1008 KB Output is correct
9 Correct 30 ms 1604 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1216 KB Output is correct
12 Correct 31 ms 1860 KB Output is correct
13 Correct 31 ms 1676 KB Output is correct
14 Correct 32 ms 1760 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 16 ms 1008 KB Output is correct
9 Correct 30 ms 1604 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1216 KB Output is correct
12 Correct 31 ms 1860 KB Output is correct
13 Correct 31 ms 1676 KB Output is correct
14 Correct 32 ms 1760 KB Output is correct
15 Correct 83 ms 3932 KB Output is correct
16 Correct 83 ms 3792 KB Output is correct
17 Correct 83 ms 3800 KB Output is correct
18 Correct 81 ms 3688 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 16 ms 1008 KB Output is correct
9 Correct 30 ms 1604 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1216 KB Output is correct
12 Correct 31 ms 1860 KB Output is correct
13 Correct 31 ms 1676 KB Output is correct
14 Correct 32 ms 1760 KB Output is correct
15 Correct 83 ms 3932 KB Output is correct
16 Correct 83 ms 3792 KB Output is correct
17 Correct 83 ms 3800 KB Output is correct
18 Correct 81 ms 3688 KB Output is correct
19 Correct 87 ms 4056 KB Output is correct
20 Correct 85 ms 3952 KB Output is correct
21 Correct 85 ms 3972 KB Output is correct
22 Correct 83 ms 3800 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 16 ms 1008 KB Output is correct
9 Correct 30 ms 1604 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1216 KB Output is correct
12 Correct 31 ms 1860 KB Output is correct
13 Correct 31 ms 1676 KB Output is correct
14 Correct 32 ms 1760 KB Output is correct
15 Correct 83 ms 3932 KB Output is correct
16 Correct 83 ms 3792 KB Output is correct
17 Correct 83 ms 3800 KB Output is correct
18 Correct 81 ms 3688 KB Output is correct
19 Correct 87 ms 4056 KB Output is correct
20 Correct 85 ms 3952 KB Output is correct
21 Correct 85 ms 3972 KB Output is correct
22 Correct 83 ms 3800 KB Output is correct
23 Correct 88 ms 3964 KB Output is correct
24 Correct 89 ms 4048 KB Output is correct
25 Correct 87 ms 4000 KB Output is correct
26 Correct 85 ms 3908 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 16 ms 1008 KB Output is correct
9 Correct 30 ms 1604 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1216 KB Output is correct
12 Correct 31 ms 1860 KB Output is correct
13 Correct 31 ms 1676 KB Output is correct
14 Correct 32 ms 1760 KB Output is correct
15 Correct 83 ms 3932 KB Output is correct
16 Correct 83 ms 3792 KB Output is correct
17 Correct 83 ms 3800 KB Output is correct
18 Correct 81 ms 3688 KB Output is correct
19 Correct 87 ms 4056 KB Output is correct
20 Correct 85 ms 3952 KB Output is correct
21 Correct 85 ms 3972 KB Output is correct
22 Correct 83 ms 3800 KB Output is correct
23 Correct 88 ms 3964 KB Output is correct
24 Correct 89 ms 4048 KB Output is correct
25 Correct 87 ms 4000 KB Output is correct
26 Correct 85 ms 3908 KB Output is correct
27 Correct 90 ms 4016 KB Output is correct
28 Correct 92 ms 4016 KB Output is correct
29 Correct 87 ms 4096 KB Output is correct
30 Correct 88 ms 3960 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 16 ms 1008 KB Output is correct
9 Correct 30 ms 1604 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1216 KB Output is correct
12 Correct 31 ms 1860 KB Output is correct
13 Correct 31 ms 1676 KB Output is correct
14 Correct 32 ms 1760 KB Output is correct
15 Correct 83 ms 3932 KB Output is correct
16 Correct 83 ms 3792 KB Output is correct
17 Correct 83 ms 3800 KB Output is correct
18 Correct 81 ms 3688 KB Output is correct
19 Correct 87 ms 4056 KB Output is correct
20 Correct 85 ms 3952 KB Output is correct
21 Correct 85 ms 3972 KB Output is correct
22 Correct 83 ms 3800 KB Output is correct
23 Correct 88 ms 3964 KB Output is correct
24 Correct 89 ms 4048 KB Output is correct
25 Correct 87 ms 4000 KB Output is correct
26 Correct 85 ms 3908 KB Output is correct
27 Correct 90 ms 4016 KB Output is correct
28 Correct 92 ms 4016 KB Output is correct
29 Correct 87 ms 4096 KB Output is correct
30 Correct 88 ms 3960 KB Output is correct
31 Correct 94 ms 4224 KB Output is correct
32 Correct 94 ms 4184 KB Output is correct
33 Correct 92 ms 4172 KB Output is correct
34 Correct 92 ms 4108 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 16 ms 1008 KB Output is correct
9 Correct 30 ms 1604 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 21 ms 1216 KB Output is correct
12 Correct 31 ms 1860 KB Output is correct
13 Correct 31 ms 1676 KB Output is correct
14 Correct 32 ms 1760 KB Output is correct
15 Correct 83 ms 3932 KB Output is correct
16 Correct 83 ms 3792 KB Output is correct
17 Correct 83 ms 3800 KB Output is correct
18 Correct 81 ms 3688 KB Output is correct
19 Correct 87 ms 4056 KB Output is correct
20 Correct 85 ms 3952 KB Output is correct
21 Correct 85 ms 3972 KB Output is correct
22 Correct 83 ms 3800 KB Output is correct
23 Correct 88 ms 3964 KB Output is correct
24 Correct 89 ms 4048 KB Output is correct
25 Correct 87 ms 4000 KB Output is correct
26 Correct 85 ms 3908 KB Output is correct
27 Correct 90 ms 4016 KB Output is correct
28 Correct 92 ms 4016 KB Output is correct
29 Correct 87 ms 4096 KB Output is correct
30 Correct 88 ms 3960 KB Output is correct
31 Correct 94 ms 4224 KB Output is correct
32 Correct 94 ms 4184 KB Output is correct
33 Correct 92 ms 4172 KB Output is correct
34 Correct 92 ms 4108 KB Output is correct
35 Correct 96 ms 4248 KB Output is correct
36 Correct 96 ms 4224 KB Output is correct
37 Correct 95 ms 4264 KB Output is correct
38 Correct 93 ms 4004 KB Output is correct