답안 #34803 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
34803	2017-11-15T19:41:39 Z	SYury	동굴 (IOI13_cave)	C++11	46 / 100	24 ms	644 KB

cave

#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;
  bool w = true;
	while(true){
		int k = tryCombination(state);
      	if(k == -1)k = n;
      	bool fa = true;
		if(w)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;}
           		}
      	else DF(i, n - 1, -1){
			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;}
           		}
      	w = !w;
		if(fa)brk;
	}
	answer(known, what);
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	640 KB	Output is correct
2	Correct	15 ms	516 KB	Output is correct
3	Correct	22 ms	512 KB	Output is correct
4	Correct	17 ms	512 KB	Output is correct
5	Correct	22 ms	512 KB	Output is correct
6	Correct	20 ms	512 KB	Output is correct
7	Correct	18 ms	524 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	6 ms	396 KB	Output is correct
11	Correct	6 ms	512 KB	Output is correct
12	Correct	24 ms	512 KB	Output is correct
13	Correct	19 ms	640 KB	Output is correct
14	Correct	22 ms	512 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	19 ms	512 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	17 ms	640 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	512 KB	Output is correct
6	Correct	20 ms	524 KB	Output is correct
7	Correct	16 ms	452 KB	Output is correct
8	Correct	22 ms	512 KB	Output is correct
9	Correct	23 ms	452 KB	Output is correct
10	Correct	21 ms	580 KB	Output is correct
11	Correct	18 ms	644 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	512 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	512 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	6 ms	396 KB	Output is correct
14	Correct	5 ms	460 KB	Output is correct

Subtask #4
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	512 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	512 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	6 ms	396 KB	Output is correct
14	Correct	5 ms	460 KB	Output is correct
15	Correct	5 ms	512 KB	Output is correct
16	Correct	5 ms	332 KB	Output is correct
17	Correct	5 ms	452 KB	Output is correct
18	Correct	6 ms	384 KB	Output is correct
19	Correct	5 ms	512 KB	Output is correct
20	Correct	9 ms	384 KB	Output is correct
21	Correct	6 ms	384 KB	Output is correct
22	Correct	5 ms	512 KB	Output is correct
23	Incorrect	12 ms	384 KB	too much calls on tryCombination()
24	Halted	0 ms	0 KB	-

Subtask #5
0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	640 KB	Output is correct
2	Correct	15 ms	516 KB	Output is correct
3	Correct	22 ms	512 KB	Output is correct
4	Correct	17 ms	512 KB	Output is correct
5	Correct	22 ms	512 KB	Output is correct
6	Correct	20 ms	512 KB	Output is correct
7	Correct	18 ms	524 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	6 ms	396 KB	Output is correct
11	Correct	6 ms	512 KB	Output is correct
12	Correct	24 ms	512 KB	Output is correct
13	Correct	19 ms	640 KB	Output is correct
14	Correct	22 ms	512 KB	Output is correct
15	Correct	19 ms	512 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	17 ms	640 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	512 KB	Output is correct
20	Correct	20 ms	524 KB	Output is correct
21	Correct	16 ms	452 KB	Output is correct
22	Correct	22 ms	512 KB	Output is correct
23	Correct	23 ms	452 KB	Output is correct
24	Correct	21 ms	580 KB	Output is correct
25	Correct	18 ms	644 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	5 ms	512 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct
29	Correct	5 ms	512 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	512 KB	Output is correct
33	Correct	5 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	5 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Correct	6 ms	396 KB	Output is correct
39	Correct	5 ms	460 KB	Output is correct
40	Correct	5 ms	512 KB	Output is correct
41	Correct	5 ms	332 KB	Output is correct
42	Correct	5 ms	452 KB	Output is correct
43	Correct	6 ms	384 KB	Output is correct
44	Correct	5 ms	512 KB	Output is correct
45	Correct	9 ms	384 KB	Output is correct
46	Correct	6 ms	384 KB	Output is correct
47	Correct	5 ms	512 KB	Output is correct
48	Incorrect	12 ms	384 KB	too much calls on tryCombination()
49	Halted	0 ms	0 KB	-

답안 #34803

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 13.0 / 13.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 30.0

Subtask #5 0 / 24.0

Subtask #1
12.0 / 12.0

Subtask #2
13.0 / 13.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 30.0

Subtask #5
0 / 24.0