oj.uz

Submission #44717

# Submission time Handle Problem Language Result Execution time Memory
44717 2018-04-05T12:25:43 Z Mamnoon_Siam Cave (IOI13_cave) C++17
100 / 100
 796 ms 692 KB 
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

#define LEFT 656
#define RIGHT 564

const int maxn = 5005;

int n;
int off[maxn];
int to[maxn];
int pass[maxn];
int assigned[maxn];
vector<int> v;
int at;

int bs(int l, int r) {
	if(l == r) {
		return v[l];
	}
	int m = l + r >> 1;
	for(int i = 0; i<=m; i++) {
		pass[v[i]] = 1;
	}
	for(int i = m + 1; i <= r; i++) {
		pass[v[i]] = 0;
	}
	int side;
	if(off[at] == -1) {
		int prev = tryCombination(pass);
		int updown = prev == at;
		if(updown == 0) { // khola ace
			for(int i=l; i<=m; i++) {
				pass[v[i]] = 0;
			}
			int now = tryCombination(pass);
			if(now == at) { // bondho hoice
				side = LEFT;
				off[at] = 0;
			}
			else { // ekhono khula ace
				side = RIGHT;
				off[at] = 1;
			}
		}
		else { // bodho ace
			for(int i=l; i<=m; i++) {
				pass[v[i]] = 0;
			}
			int now = tryCombination(pass);
			if(now == at) { // ekhono bondho ace
				side = RIGHT;
				off[at] = 0;
			}
			else { // khule gece
				side = LEFT;
				off[at] = 1;
			}
		}
	}
	else {
		for(int i=l; i<=m; i++) {
			pass[v[i]] = off[at];
		}
		for(int i=m+1; i<=r; i++) {
			pass[v[i]] = off[at] ? 0 : 1;
		}
		int now = tryCombination(pass);
		if(now == at) {
			side = LEFT;
		}
		else {
			side = RIGHT;
		}
	}
	if(side == LEFT) {
		return bs(l, m);
	}
	else {
		return bs(m+1, r);
	}
}

int ans[maxn];
int sw[maxn];

void exploreCave(int N) {
    n = N;
    memset(off, -1, sizeof off);
    for(int i=0; i<n; i++) {
    	at = i;
    	v.clear();
    	for(int j=0; j<n; j++) {
    		if(assigned[j]) continue;
    		v.push_back(j);
    	}
    	for(int j=0; j<i; j++) {
    		pass[to[j]] = off[j] ? 0 : 1;
    	}
    	to[i] = bs(0, v.size()-1);
    	assigned[to[i]] = 1;
    }
    memset(pass, -1, sizeof pass);
    for(int i=0; i<n-1; i++) {
    	pass[to[i]] = off[i] ? 0 : 1;
    }
    for(int i=0; i<n; i++) {
    	if(pass[i] == -1) {
    		pass[i] = 1;
    	}
    }
    int temp = tryCombination(pass);
    if(temp == -1) {
    	off[n-1] = 0;
    }
    else {
    	off[n-1] = 1;
    }
    for(int i=0; i<n; i++) {
    	ans[to[i]] = i;
    }
    for(int i=0; i<n; i++) {
    	sw[to[i]] = off[i];
    }
    for(int i=0; i<n; i++) {
    	sw[i] = !sw[i];
    }
    answer(sw, ans);
}

Compilation message

cave.cpp: In function 'int bs(int, int)':
cave.cpp:22:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = l + r >> 1;
          ~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 536 KB Output is correct
2 Correct 271 ms 520 KB Output is correct
3 Correct 392 ms 552 KB Output is correct
4 Correct 300 ms 512 KB Output is correct
5 Correct 439 ms 664 KB Output is correct
6 Correct 395 ms 660 KB Output is correct
7 Correct 449 ms 532 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 432 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 434 ms 568 KB Output is correct
13 Correct 398 ms 664 KB Output is correct
14 Correct 406 ms 536 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 632 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 647 ms 552 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 426 ms 568 KB Output is correct
7 Correct 785 ms 552 KB Output is correct
8 Correct 677 ms 556 KB Output is correct
9 Correct 665 ms 584 KB Output is correct
10 Correct 534 ms 552 KB Output is correct
11 Correct 796 ms 556 KB Output is correct

Subtask #3
21.0 / 21.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 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 432 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 5 ms 416 KB Output is correct
12 Correct 5 ms 360 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 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 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 432 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 5 ms 416 KB Output is correct
12 Correct 5 ms 360 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 436 KB Output is correct
20 Correct 108 ms 468 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 97 ms 504 KB Output is correct
24 Correct 100 ms 480 KB Output is correct
25 Correct 92 ms 504 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 65 ms 496 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 114 ms 504 KB Output is correct
31 Correct 111 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 91 ms 468 KB Output is correct
36 Correct 97 ms 472 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 286 ms 536 KB Output is correct
2 Correct 271 ms 520 KB Output is correct
3 Correct 392 ms 552 KB Output is correct
4 Correct 300 ms 512 KB Output is correct
5 Correct 439 ms 664 KB Output is correct
6 Correct 395 ms 660 KB Output is correct
7 Correct 449 ms 532 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 432 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 434 ms 568 KB Output is correct
13 Correct 398 ms 664 KB Output is correct
14 Correct 406 ms 536 KB Output is correct
15 Correct 414 ms 632 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 647 ms 552 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 426 ms 568 KB Output is correct
21 Correct 785 ms 552 KB Output is correct
22 Correct 677 ms 556 KB Output is correct
23 Correct 665 ms 584 KB Output is correct
24 Correct 534 ms 552 KB Output is correct
25 Correct 796 ms 556 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 432 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 9 ms 384 KB Output is correct
36 Correct 5 ms 416 KB Output is correct
37 Correct 5 ms 360 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 6 ms 384 KB Output is correct
44 Correct 6 ms 436 KB Output is correct
45 Correct 108 ms 468 KB Output is correct
46 Correct 6 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 97 ms 504 KB Output is correct
49 Correct 100 ms 480 KB Output is correct
50 Correct 92 ms 504 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 65 ms 496 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 114 ms 504 KB Output is correct
56 Correct 111 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 91 ms 468 KB Output is correct
61 Correct 97 ms 472 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 265 ms 608 KB Output is correct
64 Correct 290 ms 524 KB Output is correct
65 Correct 461 ms 552 KB Output is correct
66 Correct 291 ms 556 KB Output is correct
67 Correct 488 ms 556 KB Output is correct
68 Correct 422 ms 552 KB Output is correct
69 Correct 410 ms 536 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 407 ms 536 KB Output is correct
73 Correct 420 ms 680 KB Output is correct
74 Correct 410 ms 512 KB Output is correct
75 Correct 572 ms 608 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 5 ms 384 KB Output is correct
78 Correct 438 ms 680 KB Output is correct
79 Correct 656 ms 664 KB Output is correct
80 Correct 652 ms 676 KB Output is correct
81 Correct 622 ms 556 KB Output is correct
82 Correct 674 ms 552 KB Output is correct
83 Correct 637 ms 536 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 96 ms 384 KB Output is correct
86 Correct 631 ms 560 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 6 ms 384 KB Output is correct
89 Correct 93 ms 384 KB Output is correct
90 Correct 118 ms 384 KB Output is correct
91 Correct 92 ms 504 KB Output is correct
92 Correct 592 ms 672 KB Output is correct
93 Correct 597 ms 564 KB Output is correct
94 Correct 651 ms 692 KB Output is correct
95 Correct 5 ms 384 KB Output is correct
96 Correct 5 ms 384 KB Output is correct
97 Correct 548 ms 564 KB Output is correct
98 Correct 61 ms 512 KB Output is correct
99 Correct 403 ms 688 KB Output is correct
100 Correct 5 ms 384 KB Output is correct
101 Correct 119 ms 504 KB Output is correct
102 Correct 109 ms 480 KB Output is correct
103 Correct 698 ms 488 KB Output is correct
104 Correct 5 ms 384 KB Output is correct
105 Correct 6 ms 384 KB Output is correct
106 Correct 6 ms 384 KB Output is correct
107 Correct 97 ms 384 KB Output is correct
108 Correct 115 ms 480 KB Output is correct
109 Correct 556 ms 564 KB Output is correct
110 Correct 611 ms 560 KB Output is correct
111 Correct 5 ms 384 KB Output is correct