oj.uz

Submission #386422

# Submission time Handle Problem Language Result Execution time Memory
386422 2021-04-06T14:08:13 Z ismoilov Cave (IOI13_cave) C++14
100 / 100
 1126 ms 764 KB 
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fv(c) for(int (a) = (1); (a) <= (c); (a)++)
#define fz(c) for(int (a) = (0); (a) < (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
#define pb push_back
#define in insert
#define ss second
#define ff first

void exploreCave(int n) {
	int v[n], ans[n], a[n];
	vector <bool> s(n+1, 0);
	fp(i,0,n)
		a[i] = -1, v[i] = 0;
	/*for(auto it : s)
		cout << it << " ";*/
	int x = 0;
	fp(i,0,n){
		fp(j,0,n)
			if(!s[j])
				v[j] = x;
		int f = tryCombination(v);
		if(f == i)
			x = (x+1)%2;
		int l = 0, r = n-1, p = 0;
		while(l <= r){
			int m = (l+r)/2;
			fp(j,0,n){
				if(!s[j]){
					v[j] = x;
					if(j < l || j > m)
						v[j] = (x+1)%2;
				}
			}
			f = tryCombination(v);
			if(f == i)
				l = m + 1, p = m+1;
			else
				r = m - 1, p = l;
		}
		v[p] = x;
		s[p] = 1;
		ans[p] = x;
		a[p] = i;
		
	}
	answer(v, a);
    
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:10:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
cave.cpp:24:2: note: in expansion of macro 'fp'
   24 |  fp(i,0,n)
      |  ^~
cave.cpp:10:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
cave.cpp:29:2: note: in expansion of macro 'fp'
   29 |  fp(i,0,n){
      |  ^~
cave.cpp:10:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
cave.cpp:30:3: note: in expansion of macro 'fp'
   30 |   fp(j,0,n)
      |   ^~
cave.cpp:10:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
cave.cpp:39:4: note: in expansion of macro 'fp'
   39 |    fp(j,0,n){
      |    ^~
cave.cpp:22:12: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   22 |  int v[n], ans[n], a[n];
      |            ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 492 KB Output is correct
2 Correct 433 ms 492 KB Output is correct
3 Correct 576 ms 724 KB Output is correct
4 Correct 389 ms 720 KB Output is correct
5 Correct 574 ms 364 KB Output is correct
6 Correct 570 ms 364 KB Output is correct
7 Correct 578 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 558 ms 748 KB Output is correct
13 Correct 567 ms 724 KB Output is correct
14 Correct 557 ms 596 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 578 ms 620 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 607 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 585 ms 492 KB Output is correct
7 Correct 571 ms 620 KB Output is correct
8 Correct 1110 ms 620 KB Output is correct
9 Correct 1110 ms 492 KB Output is correct
10 Correct 1112 ms 516 KB Output is correct
11 Correct 573 ms 748 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 81 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 135 ms 364 KB Output is correct
24 Correct 142 ms 440 KB Output is correct
25 Correct 135 ms 492 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 83 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 83 ms 364 KB Output is correct
31 Correct 84 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 2 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 139 ms 492 KB Output is correct
36 Correct 138 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 492 KB Output is correct
2 Correct 433 ms 492 KB Output is correct
3 Correct 576 ms 724 KB Output is correct
4 Correct 389 ms 720 KB Output is correct
5 Correct 574 ms 364 KB Output is correct
6 Correct 570 ms 364 KB Output is correct
7 Correct 578 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 558 ms 748 KB Output is correct
13 Correct 567 ms 724 KB Output is correct
14 Correct 557 ms 596 KB Output is correct
15 Correct 578 ms 620 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 607 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 585 ms 492 KB Output is correct
21 Correct 571 ms 620 KB Output is correct
22 Correct 1110 ms 620 KB Output is correct
23 Correct 1110 ms 492 KB Output is correct
24 Correct 1112 ms 516 KB Output is correct
25 Correct 573 ms 748 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 81 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 135 ms 364 KB Output is correct
49 Correct 142 ms 440 KB Output is correct
50 Correct 135 ms 492 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 83 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 83 ms 364 KB Output is correct
56 Correct 84 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 2 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 139 ms 492 KB Output is correct
61 Correct 138 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 371 ms 620 KB Output is correct
64 Correct 371 ms 492 KB Output is correct
65 Correct 581 ms 492 KB Output is correct
66 Correct 396 ms 492 KB Output is correct
67 Correct 576 ms 632 KB Output is correct
68 Correct 615 ms 760 KB Output is correct
69 Correct 580 ms 748 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 563 ms 620 KB Output is correct
73 Correct 594 ms 620 KB Output is correct
74 Correct 562 ms 640 KB Output is correct
75 Correct 615 ms 620 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 597 ms 764 KB Output is correct
79 Correct 579 ms 620 KB Output is correct
80 Correct 1110 ms 516 KB Output is correct
81 Correct 1126 ms 620 KB Output is correct
82 Correct 1112 ms 620 KB Output is correct
83 Correct 584 ms 620 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 81 ms 492 KB Output is correct
86 Correct 558 ms 492 KB Output is correct
87 Correct 2 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 137 ms 440 KB Output is correct
90 Correct 142 ms 364 KB Output is correct
91 Correct 135 ms 364 KB Output is correct
92 Correct 1096 ms 492 KB Output is correct
93 Correct 1103 ms 620 KB Output is correct
94 Correct 1102 ms 620 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 600 ms 632 KB Output is correct
98 Correct 84 ms 492 KB Output is correct
99 Correct 590 ms 492 KB Output is correct
100 Correct 1 ms 364 KB Output is correct
101 Correct 82 ms 492 KB Output is correct
102 Correct 81 ms 364 KB Output is correct
103 Correct 552 ms 640 KB Output is correct
104 Correct 1 ms 364 KB Output is correct
105 Correct 1 ms 364 KB Output is correct
106 Correct 1 ms 364 KB Output is correct
107 Correct 136 ms 492 KB Output is correct
108 Correct 139 ms 440 KB Output is correct
109 Correct 1094 ms 620 KB Output is correct
110 Correct 1102 ms 516 KB Output is correct
111 Correct 1 ms 364 KB Output is correct