oj.uz

Submission #122180

# Submission time Handle Problem Language Result Execution time Memory
122180 2019-06-27T19:13:49 Z duality Minerals (JOI19_minerals) C++14
75 / 100
 27 ms 2168 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 ans[43000];
void Solve(int N) {
    int i,j;
    vi a,b;
    for (i = 1; i <= 2*N; i++) {
        if (test(i)) a.pb(i);
        else b.pb(i);
    }
    for (i = 0; (1 << i) < N; i++) {
        for (j = 0; j < b.size(); j++) {
            if ((i == 0) && !(j & (1 << i))) test(b[j]);
            else if ((i > 0) && (((j & (1 << i)) > 0) != ((j & (1 << (i-1))) > 0))) test(b[j]);
        }
        for (j = 0; j < a.size(); j++) {
            if ((1 << (i+1)) >= N) {
                if (ans[j] < (N-(1 << i))) {
                    if (!test(a[j])) ans[j] |= (1 << i);
                }
            }
            else if (!test(a[j])) ans[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:77:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < b.size(); j++) {
                     ~~^~~~~~~~~~
minerals.cpp:81: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 256 KB Output is correct
2 Correct 2 ms 256 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 11 ms 1024 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 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 8 ms 1152 KB Output is correct
14 Correct 8 ms 1024 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 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 8 ms 1152 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 27 ms 2084 KB Output is correct
16 Correct 27 ms 2120 KB Output is correct
17 Correct 18 ms 2168 KB Output is correct
18 Correct 19 ms 1956 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 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 8 ms 1152 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 27 ms 2084 KB Output is correct
16 Correct 27 ms 2120 KB Output is correct
17 Correct 18 ms 2168 KB Output is correct
18 Correct 19 ms 1956 KB Output is correct
19 Correct 27 ms 2036 KB Output is correct
20 Correct 27 ms 2036 KB Output is correct
21 Correct 20 ms 2164 KB Output is correct
22 Correct 20 ms 1936 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 8 ms 1152 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 27 ms 2084 KB Output is correct
16 Correct 27 ms 2120 KB Output is correct
17 Correct 18 ms 2168 KB Output is correct
18 Correct 19 ms 1956 KB Output is correct
19 Correct 27 ms 2036 KB Output is correct
20 Correct 27 ms 2036 KB Output is correct
21 Correct 20 ms 2164 KB Output is correct
22 Correct 20 ms 1936 KB Output is correct
23 Incorrect 27 ms 1940 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 8 ms 1152 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 27 ms 2084 KB Output is correct
16 Correct 27 ms 2120 KB Output is correct
17 Correct 18 ms 2168 KB Output is correct
18 Correct 19 ms 1956 KB Output is correct
19 Correct 27 ms 2036 KB Output is correct
20 Correct 27 ms 2036 KB Output is correct
21 Correct 20 ms 2164 KB Output is correct
22 Correct 20 ms 1936 KB Output is correct
23 Incorrect 27 ms 1940 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 8 ms 1152 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 27 ms 2084 KB Output is correct
16 Correct 27 ms 2120 KB Output is correct
17 Correct 18 ms 2168 KB Output is correct
18 Correct 19 ms 1956 KB Output is correct
19 Correct 27 ms 2036 KB Output is correct
20 Correct 27 ms 2036 KB Output is correct
21 Correct 20 ms 2164 KB Output is correct
22 Correct 20 ms 1936 KB Output is correct
23 Incorrect 27 ms 1940 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 8 ms 1152 KB Output is correct
14 Correct 8 ms 1024 KB Output is correct
15 Correct 27 ms 2084 KB Output is correct
16 Correct 27 ms 2120 KB Output is correct
17 Correct 18 ms 2168 KB Output is correct
18 Correct 19 ms 1956 KB Output is correct
19 Correct 27 ms 2036 KB Output is correct
20 Correct 27 ms 2036 KB Output is correct
21 Correct 20 ms 2164 KB Output is correct
22 Correct 20 ms 1936 KB Output is correct
23 Incorrect 27 ms 1940 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -