oj.uz

Submission #847809

# Submission time Handle Problem Language Result Execution time Memory
847809 2023-09-10T12:54:49 Z sentheta Cave (IOI13_cave) C++17
100 / 100
 880 ms 1072 KB 
#include "cave.h"
#ifdef VANWIJ
	#include"/home/user/code/bits/stdc++.h"
	#define DBG 1
#else
	#include"bits/stdc++.h"
	#define DBG 0
#endif
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

static mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)

#define cerr if(DBG) cout
#define dbg(x) {cerr << "?" << #x << " : " << (x) << endl << flush;}

const int N = 5005;

int n;

int ansState[N], ansDoor[N];

int q[N];
int ask(){
	int ret = tryCombination(q);
	if(ret==-1) ret = n;
	return ret;
}

bool can[N];

void exploreCave(int _n){
	n = _n;
	
	rep(i,0,n){
		ansDoor[i] = -1;
	}
	
	// find switch that link to door
	rep(door,0,n){
		dbg(door);

		// correct and wrong states
		int correct, wrong;
		
		rep(i,0,n){
			can[i] = ansDoor[i]==-1;
			if(can[i]){
				q[i] = 1;
			}
		}
		
		{
			int ret = ask();
			if(ret > door){
				correct = 1; wrong = 0;
			}
			else{
				correct = 0; wrong = 1;
			}
		}
		
		while(1){
			int cnt = 0;
			rep(i,0,n){
				cnt += can[i];
			}
			if(cnt==1) break;
			
			bool flag = 0;
			rep(i,0,n) if(can[i]){
				if(flag) q[i] = correct;
				else q[i] = wrong;
				flag ^= 1;
			}
			
			int ret = ask();
			
			if(ret > door){
				rep(i,0,n) if(can[i]){
					can[i] &= q[i]==correct;
				}
			}
			else{
				rep(i,0,n) if(can[i]){
					can[i] &= q[i]==wrong;
				}
			}
		}
		
		int x = 0;
		while(!can[x]) x++;
		q[x] = correct;
		ansState[x] = correct;
		ansDoor[x] = door;
	}
	
	
	
	answer(ansState, ansDoor);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 800 KB Output is correct
2 Correct 388 ms 344 KB Output is correct
3 Correct 584 ms 552 KB Output is correct
4 Correct 392 ms 344 KB Output is correct
5 Correct 581 ms 604 KB Output is correct
6 Correct 622 ms 808 KB Output is correct
7 Correct 589 ms 560 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 587 ms 808 KB Output is correct
13 Correct 593 ms 592 KB Output is correct
14 Correct 588 ms 592 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 581 ms 592 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 580 ms 572 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 580 ms 596 KB Output is correct
7 Correct 587 ms 572 KB Output is correct
8 Correct 859 ms 568 KB Output is correct
9 Correct 860 ms 568 KB Output is correct
10 Correct 839 ms 564 KB Output is correct
11 Correct 575 ms 344 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 83 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 116 ms 348 KB Output is correct
24 Correct 116 ms 500 KB Output is correct
25 Correct 118 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 84 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 83 ms 500 KB Output is correct
31 Correct 83 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 117 ms 344 KB Output is correct
36 Correct 116 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 800 KB Output is correct
2 Correct 388 ms 344 KB Output is correct
3 Correct 584 ms 552 KB Output is correct
4 Correct 392 ms 344 KB Output is correct
5 Correct 581 ms 604 KB Output is correct
6 Correct 622 ms 808 KB Output is correct
7 Correct 589 ms 560 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 587 ms 808 KB Output is correct
13 Correct 593 ms 592 KB Output is correct
14 Correct 588 ms 592 KB Output is correct
15 Correct 581 ms 592 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 580 ms 572 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 580 ms 596 KB Output is correct
21 Correct 587 ms 572 KB Output is correct
22 Correct 859 ms 568 KB Output is correct
23 Correct 860 ms 568 KB Output is correct
24 Correct 839 ms 564 KB Output is correct
25 Correct 575 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 83 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 116 ms 348 KB Output is correct
49 Correct 116 ms 500 KB Output is correct
50 Correct 118 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 84 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 83 ms 500 KB Output is correct
56 Correct 83 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 117 ms 344 KB Output is correct
61 Correct 116 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 381 ms 344 KB Output is correct
64 Correct 390 ms 548 KB Output is correct
65 Correct 595 ms 812 KB Output is correct
66 Correct 405 ms 800 KB Output is correct
67 Correct 580 ms 556 KB Output is correct
68 Correct 579 ms 344 KB Output is correct
69 Correct 578 ms 516 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 587 ms 596 KB Output is correct
73 Correct 589 ms 552 KB Output is correct
74 Correct 576 ms 344 KB Output is correct
75 Correct 558 ms 344 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 590 ms 344 KB Output is correct
79 Correct 583 ms 344 KB Output is correct
80 Correct 846 ms 592 KB Output is correct
81 Correct 866 ms 592 KB Output is correct
82 Correct 855 ms 568 KB Output is correct
83 Correct 586 ms 812 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 92 ms 504 KB Output is correct
86 Correct 589 ms 592 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 117 ms 508 KB Output is correct
90 Correct 117 ms 496 KB Output is correct
91 Correct 137 ms 344 KB Output is correct
92 Correct 843 ms 568 KB Output is correct
93 Correct 843 ms 344 KB Output is correct
94 Correct 858 ms 592 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 567 ms 564 KB Output is correct
98 Correct 85 ms 496 KB Output is correct
99 Correct 576 ms 600 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 84 ms 348 KB Output is correct
102 Correct 84 ms 344 KB Output is correct
103 Correct 583 ms 1072 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 119 ms 348 KB Output is correct
108 Correct 117 ms 500 KB Output is correct
109 Correct 880 ms 568 KB Output is correct
110 Correct 845 ms 568 KB Output is correct
111 Correct 1 ms 344 KB Output is correct