oj.uz

Submission #952449

# Submission time Handle Problem Language Result Execution time Memory
952449 2024-03-24T02:04:57 Z thieunguyenhuy Cave (IOI13_cave) C++17
100 / 100
 505 ms 600 KB 
#ifndef hwe
	#include "cave.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) __builtin_popcountll((n))
#define clz(n) __builtin_clzll((n))
#define ctz(n) __builtin_ctzll((n))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

const int N = 5000 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

#ifdef hwe
namespace Grader {
	int tryCombination(int S[]) {
		for (int i = 0; i < 3; ++i)
			cout << S[i] << ' ';
		cout << '\n';
		int x; cin >> x; return x;
	}
	void answer(int S[], int D[]) {
		for (int i = 0; i < 3; ++i)
			cout << S[i] << ' ';
		cout << '\n';
		for (int i = 0; i < 3; ++i)
			cout << D[i] << ' ';
		cout << '\n';
	}
}
using namespace Grader;
#endif

int s[N], d[N];

void exploreCave(int n) {
	for (int i = 0; i < n; ++i) s[i] = 0, d[i] = -1;

	auto flip = [&](int x) {
		for (int i = 0; i < x; ++i)
			if (d[i] == -1) s[i] = !s[i];
	};

	for (int door = 0; door < n; ++door) {
		int tmp = tryCombination(s);
		if (tmp == door) flip(n);
		int low = 1, high = n, p = -1;
		while (low <= high) {
			int mid = low + high >> 1;
			flip(mid); int tmp = tryCombination(s); flip(mid);
			if (tmp == door) high = (p = mid) - 1;
			else low = mid + 1;
		}
		assert(p != -1); --p;
		// cout << p << ' ' << door << '\n';
		d[p] = door;
	}

	answer(s, d);
}

#ifdef hwe
signed main() {
    // ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    exploreCave(3);

    cerr << '\n'; return 0;
}
#endif

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:99:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   99 |    int mid = low + high >> 1;
      |              ~~~~^~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 344 KB Output is correct
2 Correct 190 ms 540 KB Output is correct
3 Correct 339 ms 548 KB Output is correct
4 Correct 214 ms 540 KB Output is correct
5 Correct 335 ms 348 KB Output is correct
6 Correct 301 ms 544 KB Output is correct
7 Correct 372 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 291 ms 348 KB Output is correct
13 Correct 304 ms 552 KB Output is correct
14 Correct 293 ms 344 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 321 ms 548 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 344 ms 552 KB Output is correct
7 Correct 322 ms 344 KB Output is correct
8 Correct 482 ms 560 KB Output is correct
9 Correct 474 ms 348 KB Output is correct
10 Correct 484 ms 548 KB Output is correct
11 Correct 344 ms 344 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 46 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 444 KB Output is correct
23 Correct 60 ms 484 KB Output is correct
24 Correct 62 ms 600 KB Output is correct
25 Correct 62 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 43 ms 460 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 47 ms 488 KB Output is correct
31 Correct 47 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 448 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 62 ms 548 KB Output is correct
36 Correct 58 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 344 KB Output is correct
2 Correct 190 ms 540 KB Output is correct
3 Correct 339 ms 548 KB Output is correct
4 Correct 214 ms 540 KB Output is correct
5 Correct 335 ms 348 KB Output is correct
6 Correct 301 ms 544 KB Output is correct
7 Correct 372 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 291 ms 348 KB Output is correct
13 Correct 304 ms 552 KB Output is correct
14 Correct 293 ms 344 KB Output is correct
15 Correct 329 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 321 ms 548 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 344 ms 552 KB Output is correct
21 Correct 322 ms 344 KB Output is correct
22 Correct 482 ms 560 KB Output is correct
23 Correct 474 ms 348 KB Output is correct
24 Correct 484 ms 548 KB Output is correct
25 Correct 344 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 448 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 448 KB Output is correct
45 Correct 46 ms 344 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 444 KB Output is correct
48 Correct 60 ms 484 KB Output is correct
49 Correct 62 ms 600 KB Output is correct
50 Correct 62 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 43 ms 460 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 47 ms 488 KB Output is correct
56 Correct 47 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 448 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 62 ms 548 KB Output is correct
61 Correct 58 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 187 ms 544 KB Output is correct
64 Correct 188 ms 536 KB Output is correct
65 Correct 369 ms 348 KB Output is correct
66 Correct 213 ms 536 KB Output is correct
67 Correct 333 ms 544 KB Output is correct
68 Correct 309 ms 596 KB Output is correct
69 Correct 333 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 306 ms 548 KB Output is correct
73 Correct 294 ms 344 KB Output is correct
74 Correct 299 ms 548 KB Output is correct
75 Correct 338 ms 348 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 336 ms 548 KB Output is correct
79 Correct 320 ms 544 KB Output is correct
80 Correct 487 ms 548 KB Output is correct
81 Correct 479 ms 552 KB Output is correct
82 Correct 480 ms 552 KB Output is correct
83 Correct 325 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 46 ms 348 KB Output is correct
86 Correct 313 ms 552 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 64 ms 504 KB Output is correct
90 Correct 62 ms 348 KB Output is correct
91 Correct 67 ms 488 KB Output is correct
92 Correct 505 ms 548 KB Output is correct
93 Correct 493 ms 348 KB Output is correct
94 Correct 505 ms 592 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 305 ms 548 KB Output is correct
98 Correct 53 ms 508 KB Output is correct
99 Correct 296 ms 344 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 47 ms 348 KB Output is correct
102 Correct 46 ms 488 KB Output is correct
103 Correct 319 ms 344 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 61 ms 348 KB Output is correct
108 Correct 74 ms 344 KB Output is correct
109 Correct 502 ms 548 KB Output is correct
110 Correct 484 ms 560 KB Output is correct
111 Correct 1 ms 344 KB Output is correct