Submission #34802

# Submission time Handle Problem Language Result Execution time Memory
34802 2017-11-15T19:39:45 Z SYury Cave (IOI13_cave) C++11
46 / 100
25 ms 640 KB
#include "cave.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double dbl;
typedef pair<int, int> pii;


#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define sqr(x) (x)*(x)
#define F(i, l, r) for(int i = (l); i < (r); i++)
#define DF(i, l, r) for(int i = (l); i > (r); i--)
#define I(x, a) for(auto x : (a))
#define mp make_pair
#define X first
#define Y second
#define clean(x) memset((x), 0, sizeof(x))
#define ret return
#define cont continue
#define brk break
#define ins insert
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define sync ios_base::sync_with_stdio(false);cin.tie(0)
#define pb push_back
#define fin(x) freopen(x, "r", stdin)
#define fout(x) freopen(x, "w", stdout)
#define y1 fjfg

const int maxn = 5e3 + 3;

int state[maxn], known[maxn];
int what[maxn];

void exploreCave(int n){
	F(i, 0, n)state[i] = 0;
	F(i, 0, n)known[i] = -1;
	while(true){
		int k = tryCombination(state);
      	if(k == -1)k = n;
      	bool fa = true;
		F(i, 0, n){
			if(known[i] != -1)cont;
			fa = false;
			state[i] = 1 - state[i];
			int j = tryCombination(state);
          	if(j == -1)j = n;
			state[i] = 1 - state[i];
			if(j < k){known[i] = state[i]; what[i] = j;}
			if(j > k){known[i] = 1 - state[i]; state[i] = 1 - state[i]; what[i] = k; k = j;}
           		}
		if(fa)brk;
	}
	answer(known, what);
}
# Verdict Execution time Memory Grader output
1 Correct 18 ms 384 KB Output is correct
2 Correct 16 ms 436 KB Output is correct
3 Correct 16 ms 384 KB Output is correct
4 Correct 16 ms 516 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 23 ms 512 KB Output is correct
7 Correct 21 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 360 KB Output is correct
10 Correct 5 ms 308 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 22 ms 484 KB Output is correct
13 Correct 15 ms 416 KB Output is correct
14 Correct 22 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 19 ms 512 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 23 ms 432 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 21 ms 488 KB Output is correct
7 Correct 21 ms 384 KB Output is correct
8 Correct 20 ms 640 KB Output is correct
9 Correct 25 ms 512 KB Output is correct
10 Correct 19 ms 540 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 316 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 432 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 288 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 304 KB Output is correct
14 Correct 5 ms 360 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 316 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 432 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 288 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 304 KB Output is correct
14 Correct 5 ms 360 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 368 KB Output is correct
17 Correct 5 ms 404 KB Output is correct
18 Correct 5 ms 372 KB Output is correct
19 Correct 5 ms 372 KB Output is correct
20 Incorrect 9 ms 384 KB too much calls on tryCombination()
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 18 ms 384 KB Output is correct
2 Correct 16 ms 436 KB Output is correct
3 Correct 16 ms 384 KB Output is correct
4 Correct 16 ms 516 KB Output is correct
5 Correct 21 ms 384 KB Output is correct
6 Correct 23 ms 512 KB Output is correct
7 Correct 21 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 360 KB Output is correct
10 Correct 5 ms 308 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 22 ms 484 KB Output is correct
13 Correct 15 ms 416 KB Output is correct
14 Correct 22 ms 512 KB Output is correct
15 Correct 19 ms 512 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 23 ms 432 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 21 ms 488 KB Output is correct
21 Correct 21 ms 384 KB Output is correct
22 Correct 20 ms 640 KB Output is correct
23 Correct 25 ms 512 KB Output is correct
24 Correct 19 ms 540 KB Output is correct
25 Correct 17 ms 512 KB Output is correct
26 Correct 4 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 5 ms 316 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 432 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 6 ms 384 KB Output is correct
36 Correct 5 ms 288 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 304 KB Output is correct
39 Correct 5 ms 360 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 5 ms 368 KB Output is correct
42 Correct 5 ms 404 KB Output is correct
43 Correct 5 ms 372 KB Output is correct
44 Correct 5 ms 372 KB Output is correct
45 Incorrect 9 ms 384 KB too much calls on tryCombination()
46 Halted 0 ms 0 KB -