oj.uz

Submission #65080

# Submission time Handle Problem Language Result Execution time Memory
65080 2018-08-06T14:52:58 Z nvmdava Cave (IOI13_cave) C++17
100 / 100
 1502 ms 640 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
/*
#define MAX_N 5000
#define MAX_CALLS 70000

#define fail(s, x...) do { \
		fprintf(stderr, s "\n", ## x); \
		exit(1); \
	} while(0)
*/
/* Symbol obfuscation */
/*
#define N koala
#define realS kangaroo
#define realD possum
#define inv platypus
#define num_calls echidna
static int N;
static int realS[MAX_N];
static int realD[MAX_N];
static int inv[MAX_N];
static int num_calls;

void answer(int S[], int D[]) {
    int i;
    int correct = 1;
    for (i = 0; i < N; ++i)
        if (S[i] != realS[i] || D[i] != realD[i]) {
            correct = 0;
            break;
        }

    if (correct)
        printf("CORRECT\n");
    else
        printf("INCORRECT\n");

    for (i = 0; i < N; ++i) {
        if (i > 0)
            printf(" ");
        printf("%d", S[i]);
    }
    printf("\n");

    for (i = 0; i < N; ++i) {
        if (i > 0)
            printf(" ");
        printf("%d", D[i]);
    }
    printf("\n");

    exit(0);
}

int tryCombination(int S[]) {
    int i;

    if (num_calls >= MAX_CALLS) {
        printf("INCORRECT\nToo many calls to tryCombination().\n");
        exit(0);
    }
    ++num_calls;

    for (i = 0; i < N; ++i)
        if (S[inv[i]] != realS[inv[i]])
            return i;
    return -1;
}*/
int ans[5001], door[5001], send[5001], n;

void find(int l, int r, int id, int in){
	if(l == r){
		ans[l] = in;
		door[l] = id;
		return;
	}
	int m = (l + r) >> 1;
	memset(send, -1, sizeof(send));
	for(int i = l; i <= m; i++){
		send[i] = 1;
	}
	for(int i = 0; i < n; i++){
		if(ans[i] != -1){
			send[i] = ans[i];
		} else if(send[i] == -1){
			send[i] = 0;
		}
	}
	int k = tryCombination(send);
	if(k == -1 || k > id){
		k = 1;
	} else {
		k = 0;
	}
	
	if((in ^ k ) == 0){
		find(l, m, id, k);
	} else {
		find(m + 1, r, id, k ^ 1);
	}
}

void exploreCave(int N) {
	n = N;
	memset(ans, -1, sizeof(ans));
	memset(door, -1, sizeof(door));
	int k;
	for(int j = 0; j < n; j++){
		
		memset(send, -1, sizeof(send));
		for(int i = 0; i < n; i++){
			send[i] = max(send[i], ans[i]);
		}
		for(int i = 0; i < n; i++){
			if(send[i] == -1){
				send[i] = 1;
			}
		}
		k = tryCombination(send);
		if(k == -1 || k > j){
			k = 1;
		} else {
			k = 0;
		}
		find(0, n - 1, j, k);
	}
	
	answer(ans, door);
}
/*


int main() {
    int i, res;

	cin>>N;

    for (i = 0; i < N; ++i) {
        cin>>realS[i];
    }
    for (i = 0; i < N; ++i) {
        cin>>realD[i];
        inv[realD[i]] = i;
    }

    num_calls = 0;
    exploreCave(N);
}*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 512 KB Output is correct
2 Correct 332 ms 512 KB Output is correct
3 Correct 646 ms 588 KB Output is correct
4 Correct 349 ms 640 KB Output is correct
5 Correct 562 ms 640 KB Output is correct
6 Correct 726 ms 512 KB Output is correct
7 Correct 631 ms 640 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 583 ms 640 KB Output is correct
13 Correct 659 ms 512 KB Output is correct
14 Correct 552 ms 640 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 711 ms 640 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 568 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 622 ms 512 KB Output is correct
7 Correct 608 ms 536 KB Output is correct
8 Correct 1068 ms 532 KB Output is correct
9 Correct 1502 ms 512 KB Output is correct
10 Correct 1074 ms 640 KB Output is correct
11 Correct 682 ms 512 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 484 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 6 ms 452 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 95 ms 616 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 396 KB Output is correct
23 Correct 189 ms 484 KB Output is correct
24 Correct 127 ms 488 KB Output is correct
25 Correct 133 ms 488 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 90 ms 484 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 112 ms 492 KB Output is correct
31 Correct 112 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 7 ms 460 KB Output is correct
35 Correct 206 ms 512 KB Output is correct
36 Correct 141 ms 512 KB Output is correct
37 Correct 5 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 512 KB Output is correct
2 Correct 332 ms 512 KB Output is correct
3 Correct 646 ms 588 KB Output is correct
4 Correct 349 ms 640 KB Output is correct
5 Correct 562 ms 640 KB Output is correct
6 Correct 726 ms 512 KB Output is correct
7 Correct 631 ms 640 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 583 ms 640 KB Output is correct
13 Correct 659 ms 512 KB Output is correct
14 Correct 552 ms 640 KB Output is correct
15 Correct 711 ms 640 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 568 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 622 ms 512 KB Output is correct
21 Correct 608 ms 536 KB Output is correct
22 Correct 1068 ms 532 KB Output is correct
23 Correct 1502 ms 512 KB Output is correct
24 Correct 1074 ms 640 KB Output is correct
25 Correct 682 ms 512 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 484 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 7 ms 512 KB Output is correct
32 Correct 6 ms 452 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 7 ms 384 KB Output is correct
35 Correct 7 ms 512 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 7 ms 512 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 6 ms 512 KB Output is correct
40 Correct 6 ms 384 KB Output is correct
41 Correct 6 ms 512 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 7 ms 384 KB Output is correct
45 Correct 95 ms 616 KB Output is correct
46 Correct 7 ms 384 KB Output is correct
47 Correct 7 ms 396 KB Output is correct
48 Correct 189 ms 484 KB Output is correct
49 Correct 127 ms 488 KB Output is correct
50 Correct 133 ms 488 KB Output is correct
51 Correct 6 ms 512 KB Output is correct
52 Correct 6 ms 512 KB Output is correct
53 Correct 90 ms 484 KB Output is correct
54 Correct 6 ms 512 KB Output is correct
55 Correct 112 ms 492 KB Output is correct
56 Correct 112 ms 512 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 6 ms 512 KB Output is correct
59 Correct 7 ms 460 KB Output is correct
60 Correct 206 ms 512 KB Output is correct
61 Correct 141 ms 512 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 370 ms 512 KB Output is correct
64 Correct 388 ms 512 KB Output is correct
65 Correct 547 ms 548 KB Output is correct
66 Correct 514 ms 512 KB Output is correct
67 Correct 749 ms 580 KB Output is correct
68 Correct 597 ms 512 KB Output is correct
69 Correct 775 ms 640 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 5 ms 512 KB Output is correct
72 Correct 626 ms 512 KB Output is correct
73 Correct 560 ms 640 KB Output is correct
74 Correct 626 ms 640 KB Output is correct
75 Correct 634 ms 524 KB Output is correct
76 Correct 6 ms 384 KB Output is correct
77 Correct 5 ms 512 KB Output is correct
78 Correct 628 ms 640 KB Output is correct
79 Correct 653 ms 512 KB Output is correct
80 Correct 1067 ms 512 KB Output is correct
81 Correct 969 ms 512 KB Output is correct
82 Correct 1276 ms 640 KB Output is correct
83 Correct 574 ms 512 KB Output is correct
84 Correct 7 ms 384 KB Output is correct
85 Correct 109 ms 512 KB Output is correct
86 Correct 666 ms 516 KB Output is correct
87 Correct 6 ms 384 KB Output is correct
88 Correct 7 ms 384 KB Output is correct
89 Correct 144 ms 512 KB Output is correct
90 Correct 150 ms 384 KB Output is correct
91 Correct 152 ms 512 KB Output is correct
92 Correct 1032 ms 528 KB Output is correct
93 Correct 1008 ms 516 KB Output is correct
94 Correct 1046 ms 640 KB Output is correct
95 Correct 7 ms 512 KB Output is correct
96 Correct 6 ms 512 KB Output is correct
97 Correct 590 ms 640 KB Output is correct
98 Correct 87 ms 384 KB Output is correct
99 Correct 588 ms 640 KB Output is correct
100 Correct 9 ms 512 KB Output is correct
101 Correct 135 ms 384 KB Output is correct
102 Correct 100 ms 384 KB Output is correct
103 Correct 606 ms 640 KB Output is correct
104 Correct 7 ms 384 KB Output is correct
105 Correct 7 ms 384 KB Output is correct
106 Correct 10 ms 460 KB Output is correct
107 Correct 132 ms 488 KB Output is correct
108 Correct 158 ms 492 KB Output is correct
109 Correct 1004 ms 640 KB Output is correct
110 Correct 1041 ms 640 KB Output is correct
111 Correct 6 ms 384 KB Output is correct