oj.uz

Submission #104442

# Submission time Handle Problem Language Result Execution time Memory
104442 2019-04-06T20:51:56 Z eriksuenderhauf Cave (IOI13_cave) C++11
100 / 100
 990 ms 640 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "cave.h"
//#include "grader.h"
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long int ll;
const double pi = acos(-1);
const int MOD = 1e9 + 9;
const int INF = 1e9 + 7;
const int MAXN = 3e5 + 5;
const double eps = 1e-9;

int ask(int arr[]) {
	int cnt = tryCombination(arr);
	if (cnt == -1) cnt = INF;
	return cnt;
}

void exploreCave(int n) {
	int arr[n], ind[n], tmp[n];
	memset(arr, 0, sizeof arr);
	memset(tmp, 0, sizeof tmp);
	vii v;
	for (int i = 0; i < n; i++) {
		int lo = 0, hi = n - 1;
		int fl = (int) (ask(arr) == i);
		while (lo <= hi) {
			int mi = (lo + hi) / 2;
			memset(tmp, -1, sizeof tmp);
			for (int j = lo; j <= hi; j++)
				tmp[j] = fl ^ (j / (mi + 1));
			for (auto it: v)
				tmp[it.fi] = it.se;
			if (ask(tmp) > i)
				hi = mi - 1;
			else 
				lo = mi + 1;
		}
		v.pb({lo, fl});
		arr[lo] = fl;
		tmp[lo] = fl;
		ind[lo] = i;
	}
	answer(arr, ind);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 594 ms 572 KB Output is correct
2 Correct 604 ms 524 KB Output is correct
3 Correct 914 ms 564 KB Output is correct
4 Correct 556 ms 576 KB Output is correct
5 Correct 915 ms 504 KB Output is correct
6 Correct 936 ms 576 KB Output is correct
7 Correct 849 ms 544 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 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 930 ms 512 KB Output is correct
13 Correct 986 ms 572 KB Output is correct
14 Correct 883 ms 552 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 948 ms 496 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 873 ms 500 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 802 ms 584 KB Output is correct
7 Correct 890 ms 528 KB Output is correct
8 Correct 848 ms 568 KB Output is correct
9 Correct 804 ms 512 KB Output is correct
10 Correct 965 ms 564 KB Output is correct
11 Correct 917 ms 512 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 5 ms 396 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 5 ms 412 KB Output is correct
13 Correct 5 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 5 ms 396 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 5 ms 412 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 131 ms 480 KB Output is correct
21 Correct 5 ms 420 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 122 ms 384 KB Output is correct
24 Correct 136 ms 384 KB Output is correct
25 Correct 124 ms 480 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 144 ms 480 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 144 ms 384 KB Output is correct
31 Correct 139 ms 512 KB Output is correct
32 Correct 7 ms 420 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 144 ms 480 KB Output is correct
36 Correct 137 ms 512 KB Output is correct
37 Correct 6 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 594 ms 572 KB Output is correct
2 Correct 604 ms 524 KB Output is correct
3 Correct 914 ms 564 KB Output is correct
4 Correct 556 ms 576 KB Output is correct
5 Correct 915 ms 504 KB Output is correct
6 Correct 936 ms 576 KB Output is correct
7 Correct 849 ms 544 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 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 930 ms 512 KB Output is correct
13 Correct 986 ms 572 KB Output is correct
14 Correct 883 ms 552 KB Output is correct
15 Correct 948 ms 496 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 873 ms 500 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 802 ms 584 KB Output is correct
21 Correct 890 ms 528 KB Output is correct
22 Correct 848 ms 568 KB Output is correct
23 Correct 804 ms 512 KB Output is correct
24 Correct 965 ms 564 KB Output is correct
25 Correct 917 ms 512 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 5 ms 396 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 6 ms 512 KB Output is correct
36 Correct 6 ms 384 KB Output is correct
37 Correct 5 ms 412 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 6 ms 384 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 131 ms 480 KB Output is correct
46 Correct 5 ms 420 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 122 ms 384 KB Output is correct
49 Correct 136 ms 384 KB Output is correct
50 Correct 124 ms 480 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 144 ms 480 KB Output is correct
54 Correct 5 ms 512 KB Output is correct
55 Correct 144 ms 384 KB Output is correct
56 Correct 139 ms 512 KB Output is correct
57 Correct 7 ms 420 KB Output is correct
58 Correct 6 ms 512 KB Output is correct
59 Correct 5 ms 512 KB Output is correct
60 Correct 144 ms 480 KB Output is correct
61 Correct 137 ms 512 KB Output is correct
62 Correct 6 ms 384 KB Output is correct
63 Correct 550 ms 536 KB Output is correct
64 Correct 562 ms 556 KB Output is correct
65 Correct 898 ms 528 KB Output is correct
66 Correct 514 ms 556 KB Output is correct
67 Correct 965 ms 612 KB Output is correct
68 Correct 917 ms 612 KB Output is correct
69 Correct 927 ms 608 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 803 ms 512 KB Output is correct
73 Correct 843 ms 564 KB Output is correct
74 Correct 903 ms 640 KB Output is correct
75 Correct 897 ms 564 KB Output is correct
76 Correct 6 ms 384 KB Output is correct
77 Correct 6 ms 512 KB Output is correct
78 Correct 909 ms 576 KB Output is correct
79 Correct 791 ms 572 KB Output is correct
80 Correct 990 ms 568 KB Output is correct
81 Correct 979 ms 608 KB Output is correct
82 Correct 954 ms 572 KB Output is correct
83 Correct 948 ms 580 KB Output is correct
84 Correct 7 ms 512 KB Output is correct
85 Correct 138 ms 384 KB Output is correct
86 Correct 925 ms 568 KB Output is correct
87 Correct 5 ms 452 KB Output is correct
88 Correct 5 ms 384 KB Output is correct
89 Correct 133 ms 396 KB Output is correct
90 Correct 131 ms 452 KB Output is correct
91 Correct 130 ms 488 KB Output is correct
92 Correct 912 ms 560 KB Output is correct
93 Correct 858 ms 524 KB Output is correct
94 Correct 941 ms 512 KB Output is correct
95 Correct 5 ms 512 KB Output is correct
96 Correct 5 ms 512 KB Output is correct
97 Correct 884 ms 628 KB Output is correct
98 Correct 138 ms 396 KB Output is correct
99 Correct 815 ms 568 KB Output is correct
100 Correct 6 ms 384 KB Output is correct
101 Correct 113 ms 492 KB Output is correct
102 Correct 114 ms 460 KB Output is correct
103 Correct 742 ms 504 KB Output is correct
104 Correct 6 ms 384 KB Output is correct
105 Correct 5 ms 512 KB Output is correct
106 Correct 6 ms 384 KB Output is correct
107 Correct 124 ms 480 KB Output is correct
108 Correct 126 ms 460 KB Output is correct
109 Correct 952 ms 544 KB Output is correct
110 Correct 971 ms 564 KB Output is correct
111 Correct 5 ms 512 KB Output is correct