oj.uz

Submission #122192

# Submission time Handle Problem Language Result Execution time Memory
122192 2019-06-27T19:45:18 Z duality Minerals (JOI19_minerals) C++14
80 / 100
 59 ms 2932 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 in[86001];
int test(int x) {
    in[x] ^= 1;
    int q = Query(x);
    if (p != q) {
        p = q;
        return 1;
    }
    else return 0;
}
int order[86000],ans[43000],num[1 << 15];
void Solve(int N) {
    int i,j;
    for (i = 0; i < 2*N; i++) order[i] = i+1;
    srand(1234);
    random_shuffle(order,order+2*N);
    vi a,b;
    for (i = 0; i < 2*N; i++) {
        if ((p < N) && test(order[i])) a.pb(order[i]);
        else b.pb(order[i]);
    }
    for (i = 0; (1 << i) < N; i++) {
        for (j = 0; j < b.size(); j++) {
            if (((j & (1 << i)) > 0) != in[b[j]]) test(b[j]);
        }
        fill(num,num+(1 << i),0);
        for (j = 0; j < N; j++) {
            if (j & (1 << i)) num[j & ((1 << i)-1)]++;
            order[j] = j;
        }
        random_shuffle(order,order+N);
        for (j = 0; j < a.size(); j++) {
            if (num[ans[order[j]]] == 0) continue;
            if ((1 << (i+1)) >= N) {
                if (ans[order[j]] < (N-(1 << i))) {
                    if (!test(a[order[j]])) num[ans[order[j]]]--,ans[order[j]] |= (1 << i);
                }
            }
            else if (!test(a[order[j]])) num[ans[order[j]]]--,ans[order[j]] |= (1 << i);
        }
    }
    for (i = 0; i < N; i++) Answer(a[i],b[ans[i]]);
}

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:82:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < b.size(); j++) {
                     ~~^~~~~~~~~~
minerals.cpp:91:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < a.size(); j++) {
                     ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 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 3 ms 432 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 19 ms 1280 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 13 ms 944 KB Output is correct
12 Correct 19 ms 1432 KB Output is correct
13 Correct 19 ms 1400 KB Output is correct
14 Correct 19 ms 1280 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 13 ms 944 KB Output is correct
12 Correct 19 ms 1432 KB Output is correct
13 Correct 19 ms 1400 KB Output is correct
14 Correct 19 ms 1280 KB Output is correct
15 Correct 55 ms 2832 KB Output is correct
16 Correct 55 ms 2804 KB Output is correct
17 Correct 51 ms 2852 KB Output is correct
18 Correct 55 ms 2804 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 13 ms 944 KB Output is correct
12 Correct 19 ms 1432 KB Output is correct
13 Correct 19 ms 1400 KB Output is correct
14 Correct 19 ms 1280 KB Output is correct
15 Correct 55 ms 2832 KB Output is correct
16 Correct 55 ms 2804 KB Output is correct
17 Correct 51 ms 2852 KB Output is correct
18 Correct 55 ms 2804 KB Output is correct
19 Correct 57 ms 2852 KB Output is correct
20 Correct 55 ms 2804 KB Output is correct
21 Correct 56 ms 2932 KB Output is correct
22 Correct 53 ms 2724 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 13 ms 944 KB Output is correct
12 Correct 19 ms 1432 KB Output is correct
13 Correct 19 ms 1400 KB Output is correct
14 Correct 19 ms 1280 KB Output is correct
15 Correct 55 ms 2832 KB Output is correct
16 Correct 55 ms 2804 KB Output is correct
17 Correct 51 ms 2852 KB Output is correct
18 Correct 55 ms 2804 KB Output is correct
19 Correct 57 ms 2852 KB Output is correct
20 Correct 55 ms 2804 KB Output is correct
21 Correct 56 ms 2932 KB Output is correct
22 Correct 53 ms 2724 KB Output is correct
23 Correct 59 ms 2904 KB Output is correct
24 Correct 57 ms 2928 KB Output is correct
25 Correct 57 ms 2852 KB Output is correct
26 Correct 55 ms 2868 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 13 ms 944 KB Output is correct
12 Correct 19 ms 1432 KB Output is correct
13 Correct 19 ms 1400 KB Output is correct
14 Correct 19 ms 1280 KB Output is correct
15 Correct 55 ms 2832 KB Output is correct
16 Correct 55 ms 2804 KB Output is correct
17 Correct 51 ms 2852 KB Output is correct
18 Correct 55 ms 2804 KB Output is correct
19 Correct 57 ms 2852 KB Output is correct
20 Correct 55 ms 2804 KB Output is correct
21 Correct 56 ms 2932 KB Output is correct
22 Correct 53 ms 2724 KB Output is correct
23 Correct 59 ms 2904 KB Output is correct
24 Correct 57 ms 2928 KB Output is correct
25 Correct 57 ms 2852 KB Output is correct
26 Correct 55 ms 2868 KB Output is correct
27 Incorrect 57 ms 2592 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 13 ms 944 KB Output is correct
12 Correct 19 ms 1432 KB Output is correct
13 Correct 19 ms 1400 KB Output is correct
14 Correct 19 ms 1280 KB Output is correct
15 Correct 55 ms 2832 KB Output is correct
16 Correct 55 ms 2804 KB Output is correct
17 Correct 51 ms 2852 KB Output is correct
18 Correct 55 ms 2804 KB Output is correct
19 Correct 57 ms 2852 KB Output is correct
20 Correct 55 ms 2804 KB Output is correct
21 Correct 56 ms 2932 KB Output is correct
22 Correct 53 ms 2724 KB Output is correct
23 Correct 59 ms 2904 KB Output is correct
24 Correct 57 ms 2928 KB Output is correct
25 Correct 57 ms 2852 KB Output is correct
26 Correct 55 ms 2868 KB Output is correct
27 Incorrect 57 ms 2592 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 432 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 19 ms 1280 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 13 ms 944 KB Output is correct
12 Correct 19 ms 1432 KB Output is correct
13 Correct 19 ms 1400 KB Output is correct
14 Correct 19 ms 1280 KB Output is correct
15 Correct 55 ms 2832 KB Output is correct
16 Correct 55 ms 2804 KB Output is correct
17 Correct 51 ms 2852 KB Output is correct
18 Correct 55 ms 2804 KB Output is correct
19 Correct 57 ms 2852 KB Output is correct
20 Correct 55 ms 2804 KB Output is correct
21 Correct 56 ms 2932 KB Output is correct
22 Correct 53 ms 2724 KB Output is correct
23 Correct 59 ms 2904 KB Output is correct
24 Correct 57 ms 2928 KB Output is correct
25 Correct 57 ms 2852 KB Output is correct
26 Correct 55 ms 2868 KB Output is correct
27 Incorrect 57 ms 2592 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -