oj.uz

Submission #845950

# Submission time Handle Problem Language Result Execution time Memory
845950 2023-09-07T00:25:09 Z midi Cave (IOI13_cave) C++14
100 / 100
 213 ms 604 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define vc vector
typedef vc<ll> vcll;
#define pr pair
typedef pr<ll, ll> prll;

#define f0r(i,a,n) for (i=a; i<n; i++)
#define f1r(i,a,n) for (i=a; i<=n; i++)
#define r0f(i,n,a) for (i=n; i>a; i--)
#define r1f(i,n,a) for (i=n; i>=a; i--)

#define pb push_back
#define mp make_pair

#define INF (LLONG_MAX>>4ll)
#define mxN 5010ll

ll n;
int bar[mxN];
int gar[mxN];
int perm[mxN];
ll cnt=0;

/*
inline int tryCombination(int *ar)
{
	cnt++;
	return rand() % n;
}
*/

void exploreCave(int N)
{
	n=N;

	ll i2;

	f0r(i2,0,n)
	{
		bar[i2]=0;
		perm[i2]=-1;
		gar[i2]=-1;
	}

	ll cnt2=0;
	f0r(i2,0,n)
	{
		ll i3;
		f0r(i3, 0, n) if (gar[i3]==-1) bar[i3]=0;
		ll i;
		i = tryCombination(bar);
		// cnt2++;

		/*
		printf("try combination(");
		f0r(i3,0,n) printf("%lli ", (ll)bar[i3]);
		printf("): ");
		scanf("%lli", &i);
		*/

		if (i==-1) break;

		ll j;
		ll l=0, r=n-1; // both incl.

		bool broke=0;

		ll cnt=0;

		while (l<r)
		{
			ll m;
			m = ((l+1>=r) ? l : (l+r)/2);
			// printf("l: %lli, m: %lli, r: %lli\n", l, m, r);
			f1r(i3, l, m) if (gar[i3]==-1) bar[i3]^=1;

			j = tryCombination(bar);
			// cnt2++;

			/*
			printf("try combination(");
			f0r(i3,0,n) printf("%lli ", (ll)bar[i3]);
			printf("): ");
			scanf("%lli", &j);
			*/

			if (j==-1)
			{
				broke=1;
				break;
			}

			if (j<i)
			{
				i=j;
				r=m;
			}
			else if (j==i)
			{
				l=m+1;
			}
			else
			{
				f1r(i3, l, m) if (gar[i3]==-1) bar[i3]^=1;
				r=m;
			}
		}

		if (broke) break;

		/*
		printf("try combination(");
		f0r(i3,0,n) printf("%lli ", (ll)bar[i3]);
		printf("): ");
		scanf("%lli", &j);
		*/

		// if (i==j) bar[l]^=1;
		bar[l]^=1;
		gar[l]=bar[l];
		perm[l]=i;
		cnt++;
	}

	/*
	if (cnt==n-1)
	{
		ll i;
		for (i=0; i<n && perm[i]!=-1; i++) ;
		vc<bool> has(mxN, 0);
		ll i13;
		f0r(i13,0,n) if (i13!=i) has[perm[i13]]=1;
		ll v;
		for (v=0; v<n && has[v]; v++) ;

		gar[i]=bar[i];
		perm[i]=v;

		return void(answer(bar, perm));
	}
	*/

	f0r(i2,0,n)
	{
		gar[i2]=bar[i2];

		if (perm[i2]==-1)
		{
			ll i;
			bar[i2]^=1;
			// printf("real\n");
			i = tryCombination(bar);

			/*
			printf("try combination(");
			ll i3;
			f0r(i3,0,n) printf("%lli ", (ll)bar[i3]);
			printf("): ");
			scanf("%lli", &i);
			*/

			bar[i2]^=1;
			perm[i2]=i;
		}
	}

	/*
	ll i;
	printf("gar: ");
	f0r(i,0,n) printf("%lli ", (ll)gar[i]);
	printf("perm: ");
	f0r(i,0,n) printf("%lli ", (ll)perm[i]);
	*/

	answer(gar, perm);
	// printf("cnt: %lli\n", cnt);
}

/*
int main()
{
	srand(time(0));
	ll N;
	printf("n: ");
	scanf("%lli", &N);
	printf("\n");

	exploreCave(N);

	return 0;
}
*/

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:49:5: warning: unused variable 'cnt2' [-Wunused-variable]
   49 |  ll cnt2=0;
      |     ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 348 KB Output is correct
2 Correct 87 ms 528 KB Output is correct
3 Correct 132 ms 600 KB Output is correct
4 Correct 89 ms 348 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 124 ms 344 KB Output is correct
7 Correct 132 ms 560 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 133 ms 560 KB Output is correct
13 Correct 125 ms 344 KB Output is correct
14 Correct 127 ms 564 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 9 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 9 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 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 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 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 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 19 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 26 ms 348 KB Output is correct
24 Correct 26 ms 348 KB Output is correct
25 Correct 24 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 19 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 18 ms 348 KB Output is correct
31 Correct 18 ms 504 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 24 ms 492 KB Output is correct
36 Correct 32 ms 492 KB Output is correct
37 Correct 0 ms 344 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 348 KB Output is correct
2 Correct 87 ms 528 KB Output is correct
3 Correct 132 ms 600 KB Output is correct
4 Correct 89 ms 348 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 124 ms 344 KB Output is correct
7 Correct 132 ms 560 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 133 ms 560 KB Output is correct
13 Correct 125 ms 344 KB Output is correct
14 Correct 127 ms 564 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 8 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 7 ms 348 KB Output is correct
21 Correct 9 ms 348 KB Output is correct
22 Correct 9 ms 348 KB Output is correct
23 Correct 9 ms 348 KB Output is correct
24 Correct 9 ms 348 KB Output is correct
25 Correct 8 ms 348 KB Output is correct
26 Correct 0 ms 344 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 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 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 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 19 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 26 ms 348 KB Output is correct
49 Correct 26 ms 348 KB Output is correct
50 Correct 24 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 19 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 18 ms 348 KB Output is correct
56 Correct 18 ms 504 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 24 ms 492 KB Output is correct
61 Correct 32 ms 492 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 99 ms 348 KB Output is correct
64 Correct 87 ms 556 KB Output is correct
65 Correct 130 ms 564 KB Output is correct
66 Correct 89 ms 560 KB Output is correct
67 Correct 8 ms 344 KB Output is correct
68 Correct 127 ms 348 KB Output is correct
69 Correct 135 ms 564 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 1 ms 600 KB Output is correct
72 Correct 129 ms 348 KB Output is correct
73 Correct 136 ms 348 KB Output is correct
74 Correct 140 ms 600 KB Output is correct
75 Correct 8 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 8 ms 344 KB Output is correct
79 Correct 8 ms 588 KB Output is correct
80 Correct 8 ms 344 KB Output is correct
81 Correct 9 ms 584 KB Output is correct
82 Correct 8 ms 348 KB Output is correct
83 Correct 8 ms 348 KB Output is correct
84 Correct 0 ms 428 KB Output is correct
85 Correct 19 ms 364 KB Output is correct
86 Correct 121 ms 344 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 25 ms 520 KB Output is correct
90 Correct 25 ms 516 KB Output is correct
91 Correct 25 ms 348 KB Output is correct
92 Correct 189 ms 348 KB Output is correct
93 Correct 213 ms 344 KB Output is correct
94 Correct 191 ms 344 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 130 ms 344 KB Output is correct
98 Correct 19 ms 356 KB Output is correct
99 Correct 124 ms 564 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 18 ms 516 KB Output is correct
102 Correct 18 ms 520 KB Output is correct
103 Correct 119 ms 568 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 0 ms 444 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 25 ms 520 KB Output is correct
108 Correct 23 ms 520 KB Output is correct
109 Correct 191 ms 516 KB Output is correct
110 Correct 182 ms 600 KB Output is correct
111 Correct 0 ms 348 KB Output is correct