oj.uz

Submission #10427

# Submission time Handle Problem Language Result Execution time Memory
10427 2014-10-27T23:39:15 Z gs14004 Cave (IOI13_cave) C++
100 / 100
 479 ms 616 KB 
#include "cave.h"
#include <cstdio>
#include <cstdlib>

int S[5005], D[5005];
int visited[5005];

void change(int s, int e){
    for(int i=s; i<=e; i++){
        if(!visited[i]) S[i] ^= 1;
    }
}

int find(int pos, int n){
    int s = 0, e = n-1;
    if(tryCombination(S) != pos) change(0,n-1);
    while (s != e) {
        int m = (s+e)/2;
        change(s,m);
        int t = tryCombination(S);
        change(s,m);
        if(pos != t) e = m;
        else s = m+1;
    }
    return s;
}

void exploreCave(int n){
    for (int i=0; i<n; i++) {
        int pos = find(i,n);
        D[pos] = i;
        visited[pos] = 1;
        S[pos] ^= 1;
    }
    answer(S,D);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 512 KB Output is correct
2 Correct 170 ms 496 KB Output is correct
3 Correct 305 ms 496 KB Output is correct
4 Correct 207 ms 492 KB Output is correct
5 Correct 302 ms 504 KB Output is correct
6 Correct 245 ms 488 KB Output is correct
7 Correct 269 ms 496 KB Output is correct
8 Correct 5 ms 420 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 396 KB Output is correct
12 Correct 295 ms 384 KB Output is correct
13 Correct 372 ms 512 KB Output is correct
14 Correct 319 ms 384 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 444 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 294 ms 488 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 251 ms 512 KB Output is correct
7 Correct 273 ms 516 KB Output is correct
8 Correct 299 ms 492 KB Output is correct
9 Correct 372 ms 512 KB Output is correct
10 Correct 362 ms 512 KB Output is correct
11 Correct 279 ms 472 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 396 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 452 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 6 ms 332 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 53 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 58 ms 512 KB Output is correct
10 Correct 57 ms 512 KB Output is correct
11 Correct 69 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 49 ms 512 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 54 ms 512 KB Output is correct
17 Correct 52 ms 584 KB Output is correct
18 Correct 5 ms 452 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 57 ms 512 KB Output is correct
22 Correct 56 ms 460 KB Output is correct
23 Correct 5 ms 420 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 480 KB Output is correct
2 Correct 147 ms 472 KB Output is correct
3 Correct 258 ms 516 KB Output is correct
4 Correct 164 ms 468 KB Output is correct
5 Correct 292 ms 472 KB Output is correct
6 Correct 273 ms 516 KB Output is correct
7 Correct 256 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 268 ms 512 KB Output is correct
11 Correct 259 ms 384 KB Output is correct
12 Correct 245 ms 384 KB Output is correct
13 Correct 261 ms 492 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 261 ms 512 KB Output is correct
17 Correct 250 ms 616 KB Output is correct
18 Correct 349 ms 516 KB Output is correct
19 Correct 382 ms 496 KB Output is correct
20 Correct 479 ms 512 KB Output is correct
21 Correct 257 ms 512 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 59 ms 512 KB Output is correct
24 Correct 248 ms 476 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 68 ms 444 KB Output is correct
28 Correct 55 ms 444 KB Output is correct
29 Correct 67 ms 444 KB Output is correct
30 Correct 350 ms 496 KB Output is correct
31 Correct 443 ms 496 KB Output is correct
32 Correct 419 ms 496 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 6 ms 396 KB Output is correct
35 Correct 292 ms 512 KB Output is correct
36 Correct 62 ms 440 KB Output is correct
37 Correct 270 ms 476 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 36 ms 396 KB Output is correct
40 Correct 40 ms 384 KB Output is correct
41 Correct 353 ms 500 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 68 ms 512 KB Output is correct
46 Correct 55 ms 384 KB Output is correct
47 Correct 397 ms 492 KB Output is correct
48 Correct 348 ms 496 KB Output is correct
49 Correct 5 ms 384 KB Output is correct