oj.uz

Submission #34808

# Submission time Handle Problem Language Result Execution time Memory
34808 2017-11-15T20:12:43 Z SYury Cave (IOI13_cave) C++11
100 / 100
 1216 ms 656 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];
int unused[maxn];

void exploreCave(int n){
	F(i, 0, n)state[i] = 0;
	F(i, 0, n)known[i] = -1;
	F(i, 0, n){
		int ptr = 0;
		F(j, 0, n)if(known[j] == -1)unused[ptr++] = j;
		F(j, 0, n)if(known[j] != -1){state[j] = known[j];}else{state[j] = 0;}
		int init = tryCombination(state);
		if(init == -1)init = n;
		bool open = init > i;
		int l = 0, r = ptr - 1;
		while(r > l){
			int mid = (l + r) >> 1;
			int pos = unused[mid];
			F(j, 0, n)if(known[j] != -1){state[j] = known[j];}else{state[j] = (j <= pos) ? 1 : 0;}
			int res = tryCombination(state);
			if(res == -1)res = n;
			bool copen = res > i;
			if(copen != open)r = mid;
			else l = mid + 1;
		}
		what[unused[l]] = i;
		if(open)known[unused[l]] = 0;
		else known[unused[l]] = 1;
	}
	answer(known, what);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 516 KB Output is correct
2 Correct 317 ms 528 KB Output is correct
3 Correct 649 ms 520 KB Output is correct
4 Correct 310 ms 516 KB Output is correct
5 Correct 566 ms 524 KB Output is correct
6 Correct 489 ms 536 KB Output is correct
7 Correct 460 ms 520 KB Output is correct
8 Correct 6 ms 324 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 469 ms 640 KB Output is correct
13 Correct 481 ms 532 KB Output is correct
14 Correct 478 ms 588 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 516 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 441 ms 656 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 482 ms 640 KB Output is correct
7 Correct 467 ms 520 KB Output is correct
8 Correct 1119 ms 640 KB Output is correct
9 Correct 1034 ms 640 KB Output is correct
10 Correct 1216 ms 524 KB Output is correct
11 Correct 475 ms 512 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 460 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 6 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 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 61 ms 480 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 145 ms 512 KB Output is correct
24 Correct 128 ms 472 KB Output is correct
25 Correct 137 ms 540 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 63 ms 384 KB Output is correct
29 Correct 5 ms 444 KB Output is correct
30 Correct 68 ms 512 KB Output is correct
31 Correct 84 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 130 ms 472 KB Output is correct
36 Correct 144 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 335 ms 516 KB Output is correct
2 Correct 317 ms 528 KB Output is correct
3 Correct 649 ms 520 KB Output is correct
4 Correct 310 ms 516 KB Output is correct
5 Correct 566 ms 524 KB Output is correct
6 Correct 489 ms 536 KB Output is correct
7 Correct 460 ms 520 KB Output is correct
8 Correct 6 ms 324 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 469 ms 640 KB Output is correct
13 Correct 481 ms 532 KB Output is correct
14 Correct 478 ms 588 KB Output is correct
15 Correct 467 ms 516 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 441 ms 656 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 482 ms 640 KB Output is correct
21 Correct 467 ms 520 KB Output is correct
22 Correct 1119 ms 640 KB Output is correct
23 Correct 1034 ms 640 KB Output is correct
24 Correct 1216 ms 524 KB Output is correct
25 Correct 475 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 6 ms 460 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 6 ms 460 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 6 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 512 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 61 ms 480 KB Output is correct
46 Correct 5 ms 332 KB Output is correct
47 Correct 6 ms 384 KB Output is correct
48 Correct 145 ms 512 KB Output is correct
49 Correct 128 ms 472 KB Output is correct
50 Correct 137 ms 540 KB Output is correct
51 Correct 6 ms 384 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 63 ms 384 KB Output is correct
54 Correct 5 ms 444 KB Output is correct
55 Correct 68 ms 512 KB Output is correct
56 Correct 84 ms 512 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 130 ms 472 KB Output is correct
61 Correct 144 ms 472 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 405 ms 640 KB Output is correct
64 Correct 317 ms 640 KB Output is correct
65 Correct 524 ms 516 KB Output is correct
66 Correct 461 ms 640 KB Output is correct
67 Correct 477 ms 540 KB Output is correct
68 Correct 541 ms 520 KB Output is correct
69 Correct 440 ms 528 KB Output is correct
70 Correct 5 ms 420 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 478 ms 512 KB Output is correct
73 Correct 466 ms 532 KB Output is correct
74 Correct 492 ms 640 KB Output is correct
75 Correct 535 ms 512 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 6 ms 500 KB Output is correct
78 Correct 451 ms 516 KB Output is correct
79 Correct 556 ms 640 KB Output is correct
80 Correct 1022 ms 536 KB Output is correct
81 Correct 1026 ms 512 KB Output is correct
82 Correct 1031 ms 640 KB Output is correct
83 Correct 567 ms 548 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 88 ms 476 KB Output is correct
86 Correct 443 ms 524 KB Output is correct
87 Correct 5 ms 512 KB Output is correct
88 Correct 5 ms 384 KB Output is correct
89 Correct 128 ms 512 KB Output is correct
90 Correct 129 ms 476 KB Output is correct
91 Correct 146 ms 472 KB Output is correct
92 Correct 1044 ms 640 KB Output is correct
93 Correct 993 ms 640 KB Output is correct
94 Correct 1051 ms 532 KB Output is correct
95 Correct 6 ms 384 KB Output is correct
96 Correct 6 ms 384 KB Output is correct
97 Correct 435 ms 524 KB Output is correct
98 Correct 98 ms 512 KB Output is correct
99 Correct 443 ms 528 KB Output is correct
100 Correct 6 ms 512 KB Output is correct
101 Correct 63 ms 444 KB Output is correct
102 Correct 67 ms 508 KB Output is correct
103 Correct 452 ms 528 KB Output is correct
104 Correct 6 ms 460 KB Output is correct
105 Correct 5 ms 512 KB Output is correct
106 Correct 6 ms 420 KB Output is correct
107 Correct 143 ms 540 KB Output is correct
108 Correct 132 ms 384 KB Output is correct
109 Correct 1000 ms 512 KB Output is correct
110 Correct 1038 ms 532 KB Output is correct
111 Correct 5 ms 384 KB Output is correct