Submission #962893

# Submission time Handle Problem Language Result Execution time Memory
962893 2024-04-14T09:26:58 Z raspy Cave (IOI13_cave) C++14
51 / 100
400 ms 776 KB
#include "cave.h"
#include <iostream>

using namespace std;

int s[5005];
int rs[5005];
int cn[5005];

void exploreCave(int n)
{
	int lg = 0;
	while ((1<<lg) < n)
		lg++;
	// cout << n << " " << lg << "\n";
	for (int i = 0; i < n; i++)
		rs[i] = -1;
	for (int tr = 0; tr < n; tr++)
	{
		// cout << "-> " << tr << "\n";
		int ixn = 0;
		for (int j = 0; j < lg; j++)
		{
			// cout << "   ";
			for (int i = 0; i < n; i++)
			{
				s[i] = (i&(1<<j) ? 1 : 0);
				if (rs[i] != -1)
					s[i] = rs[i];
				// cout << s[i] << " ";
			}
			// cout << "\n";
			int odg =  tryCombination(s)-1;
			if (odg == -2)
				odg = n-1;
			// cout << "\t" << odg << "\n";
			if (odg >= tr)
			{
				// cout << "\ttest" << "\n";
				ixn |= (1<<j);
			}
		}
		int ix = 0;
		for (int j = 0; j < lg; j++)
			if (!(ixn & (1<<j)))
				ix |= (1<<j);
		for (int i = 0; i < n; i++)
		{
			s[i] = 0;
			if (rs[i] != -1)
				s[i] = rs[i];
		}
		s[ixn] = 1;
		if (rs[ix] == -1)
			s[ix] = 1;
		int odg = tryCombination(s)-1;
		if (odg == -2)
			odg = n-1;
		// cout << "-> " << tr << " <> " << odg << ", " << ixn << "\n";
		if (odg >= tr)
		{
			// cout << ixn << " " << tr << "\n";
			cn[ixn] = tr;
			rs[ixn] = 1;
		}
		else
		{
			cn[ix] = tr;
			rs[ix] = 0;
		}
	}
	answer(rs, cn);
}
# Verdict Execution time Memory Grader output
1 Correct 245 ms 516 KB Output is correct
2 Runtime error 256 ms 776 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 400 ms 528 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 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 3 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 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 348 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 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 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 3 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 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 348 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 348 KB Output is correct
15 Correct 1 ms 604 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 344 KB Output is correct
20 Correct 55 ms 492 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 59 ms 348 KB Output is correct
24 Correct 59 ms 596 KB Output is correct
25 Correct 54 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 57 ms 516 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 54 ms 492 KB Output is correct
31 Correct 52 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 55 ms 348 KB Output is correct
36 Correct 53 ms 492 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 245 ms 516 KB Output is correct
2 Runtime error 256 ms 776 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -