oj.uz

Submission #560025

# Submission time Handle Problem Language Result Execution time Memory
560025 2022-05-11T03:06:11 Z ngpin04 Cave (IOI13_cave) C++14
51 / 100
 499 ms 656 KB 
#include <bits/stdc++.h>
#include "cave.h"
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

#define ask tryCombination

int d[N], q[N], s[N];
#define getbit(x, i) ((x >> i) & 1)
#define bit(x) (1LL << x);

void exploreCave(int n) {
    vector <bool> ok(n, 1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            q[j] = (ok[j]) ? 0 : d[j];

        int val = (ask(q) == i);
        cerr << val << "\n";
        int res = 0;
        for (int b = 0; b < 14; b++) {
            for (int j = 0; j < n; j++) 
                q[j] = (ok[j]) ? (getbit(j, b) ^ val) : d[j];

            if (ask(q) == i)
                res |= bit(b);
        }

        s[res] = i;
        d[res] = val;
        ok[res] = false;
    }   

    answer(d, s);
}   

//#include "grader.c"

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 340 KB Output is correct
2 Correct 336 ms 656 KB Output is correct
3 Incorrect 479 ms 540 KB too much calls on tryCombination()
4 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 499 ms 520 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 88 ms 368 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 110 ms 460 KB Output is correct
24 Correct 106 ms 368 KB Output is correct
25 Correct 107 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 82 ms 380 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 82 ms 376 KB Output is correct
31 Correct 82 ms 316 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 107 ms 340 KB Output is correct
36 Correct 105 ms 372 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 340 KB Output is correct
2 Correct 336 ms 656 KB Output is correct
3 Incorrect 479 ms 540 KB too much calls on tryCombination()
4 Halted 0 ms 0 KB -