oj.uz

Submission #885836

# Submission time Handle Problem Language Result Execution time Memory
885836 2023-12-10T20:54:52 Z BBart888 Cave (IOI13_cave) C++14
100 / 100
 1376 ms 812 KB 
#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <queue>
#include <stack>
#include <cassert>
#include <cstring>
#include <climits>
#include <functional>
#include<cstdlib>
//#include "arc.h"
#include"cave.h"


using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long LL;



const int MAXN = 5e3 + 11;
using ll = long long;
typedef vector<int> lnum;
const int base = 1e9;
const ll mod1 = 1e9 + 7;
const ll mod2 = 1000000021;
const ll P = 31;



/*
void setIO(string name = "") {
	cin.tie(0)->sync_with_stdio(0); // see /general/fast-io
	if ((name.size())) {
		freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output
		freopen((name + ".out").c_str(), "w", stdout);
	}
}
*/
int N;


int arr[MAXN];
bool picked[MAXN];
int chose[MAXN];
int which_door[MAXN];
/*
int tryCombination(int S[])
{
	cout << "Your array sir:\n";
	for (int i = 0; i < N; i++)
		cout << S[i] << " ";
	cout << "\n";
	for (int i = 0; i < N; i++)
		cout << picked[i] << " ";
	cout << '\n';
	int dec;
	cin >> dec;
	return dec;
}


void answer(int S[], int D[]);

*/


void ustaw(int l,int r,int mode)
{
	r = min(r, N-1);
	for (int i = l; i <= r; i++)
		arr[i] = mode;
	for (int i = l; i <= r; i++)
		if (picked[i])
			arr[i] = chose[i];
}


void exploreCave(int n)
{
	
	N = n;
	for (int door = 0; door < n; door++)
	{
		ustaw(0, n - 1, 0);
		//cout << "TERAZ NIE!! BINSERCZ\n";
		int now = tryCombination(arr);
		int what = 0;
		if (now > door || now == -1)
		{
			int opp = 1;
			for (int j = 12; j >= 0; j--)
			{
				ustaw(0, n - 1, opp);
				ustaw(0, what + (1 << j) - 1, 0);
				//cout << "TERAZ BINSERCZ\n";
				int ch = tryCombination(arr);
				if (ch <= door && ch != -1)
					what += (1 << j);
				ustaw(0, n - 1, 0);
			}
			chose[what] = 0;
		}
		else
		{
			ustaw(0, n - 1, 1);
			int opp = 0;
			for (int j = 12; j >= 0; j--)
			{
				ustaw(0, n - 1, opp);
				ustaw(0, what + (1 << j) - 1, 1);
				//cout << "TERAZ BINSERCZ\n";
				int ch = tryCombination(arr);
				if (ch <= door && ch != -1)
					what += (1 << j);
				ustaw(0, n - 1, 1);
			}
			chose[what] = 1;
		}

		which_door[what] = door;
		picked[what] = true;

	}

	//for (int i = 0; i < n; i++)
		//cout << which_door[i] << " ";
	//cout << "\n\n";
	ustaw(0, n - 1, 0);
	//for (int i = 0; i < n; i++)
		//cout << arr[i] << " ";
	//cout << "\n\n";
	answer(arr, which_door);

}



/*



int main()
{
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(false);
	//setIO("time");

	
	exploreCave(4);
	

















	return 0;
}




*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 560 ms 516 KB Output is correct
2 Correct 617 ms 516 KB Output is correct
3 Correct 933 ms 532 KB Output is correct
4 Correct 591 ms 556 KB Output is correct
5 Correct 902 ms 796 KB Output is correct
6 Correct 864 ms 796 KB Output is correct
7 Correct 851 ms 616 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 890 ms 560 KB Output is correct
13 Correct 864 ms 540 KB Output is correct
14 Correct 913 ms 796 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 881 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 911 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 850 ms 572 KB Output is correct
7 Correct 940 ms 812 KB Output is correct
8 Correct 1308 ms 568 KB Output is correct
9 Correct 1317 ms 596 KB Output is correct
10 Correct 1333 ms 564 KB Output is correct
11 Correct 920 ms 564 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 392 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 145 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 190 ms 480 KB Output is correct
24 Correct 192 ms 480 KB Output is correct
25 Correct 193 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 144 ms 732 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 162 ms 472 KB Output is correct
31 Correct 143 ms 344 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 219 ms 480 KB Output is correct
36 Correct 190 ms 344 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 560 ms 516 KB Output is correct
2 Correct 617 ms 516 KB Output is correct
3 Correct 933 ms 532 KB Output is correct
4 Correct 591 ms 556 KB Output is correct
5 Correct 902 ms 796 KB Output is correct
6 Correct 864 ms 796 KB Output is correct
7 Correct 851 ms 616 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 890 ms 560 KB Output is correct
13 Correct 864 ms 540 KB Output is correct
14 Correct 913 ms 796 KB Output is correct
15 Correct 881 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 911 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 850 ms 572 KB Output is correct
21 Correct 940 ms 812 KB Output is correct
22 Correct 1308 ms 568 KB Output is correct
23 Correct 1317 ms 596 KB Output is correct
24 Correct 1333 ms 564 KB Output is correct
25 Correct 920 ms 564 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 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 392 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 145 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 190 ms 480 KB Output is correct
49 Correct 192 ms 480 KB Output is correct
50 Correct 193 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 144 ms 732 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 162 ms 472 KB Output is correct
56 Correct 143 ms 344 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 219 ms 480 KB Output is correct
61 Correct 190 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 597 ms 592 KB Output is correct
64 Correct 592 ms 548 KB Output is correct
65 Correct 868 ms 568 KB Output is correct
66 Correct 646 ms 600 KB Output is correct
67 Correct 842 ms 564 KB Output is correct
68 Correct 841 ms 792 KB Output is correct
69 Correct 889 ms 568 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 855 ms 796 KB Output is correct
73 Correct 873 ms 592 KB Output is correct
74 Correct 852 ms 808 KB Output is correct
75 Correct 877 ms 552 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 843 ms 812 KB Output is correct
79 Correct 974 ms 808 KB Output is correct
80 Correct 1334 ms 568 KB Output is correct
81 Correct 1368 ms 608 KB Output is correct
82 Correct 1376 ms 564 KB Output is correct
83 Correct 992 ms 564 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 164 ms 508 KB Output is correct
86 Correct 925 ms 556 KB Output is correct
87 Correct 2 ms 348 KB Output is correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 231 ms 344 KB Output is correct
90 Correct 194 ms 520 KB Output is correct
91 Correct 193 ms 500 KB Output is correct
92 Correct 1360 ms 568 KB Output is correct
93 Correct 1332 ms 576 KB Output is correct
94 Correct 1318 ms 564 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 837 ms 800 KB Output is correct
98 Correct 140 ms 600 KB Output is correct
99 Correct 867 ms 560 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 168 ms 744 KB Output is correct
102 Correct 142 ms 344 KB Output is correct
103 Correct 866 ms 556 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 440 KB Output is correct
107 Correct 193 ms 504 KB Output is correct
108 Correct 196 ms 496 KB Output is correct
109 Correct 1315 ms 572 KB Output is correct
110 Correct 1316 ms 568 KB Output is correct
111 Correct 0 ms 348 KB Output is correct