oj.uz

Submission #120837

# Submission time Handle Problem Language Result Execution time Memory
120837 2019-06-25T15:54:24 Z shashwatchandra Cave (IOI13_cave) C++17
100 / 100
 887 ms 640 KB 
/*input

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "cave.h"
using namespace std;
using namespace __gnu_pbds;

#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}


void exploreCave(int N){
	int stick[N];
	int cur[N];
	int door[N];
	int aux[N];
	REP(i,N){
		stick[i] = 0;
		door[i] = -1;
		aux[i] = 1;
		cur[i] = 0;
	}
	int find = 0;
	while(find < N){
		int rightnow = tryCombination(cur);
		//cout << find << " " << rightnow << " ";
		if(rightnow == -1)rightnow = N+1;
		int lo = 0;
		int hi = N-1;
		if(rightnow > find){
			//look for first i such that rightnow becomes find
			while(lo < hi){
				int mid = (lo+hi)/2;
				REP(i,mid+1){
					if(!stick[i])aux[i] = cur[i]^1;
					else aux[i] = cur[i];
				//	cout << cur[i] << " ";
				}
				for(int i = mid+1;i < N;i++){
					aux[i] = cur[i];
				//	cout << cur[i] << " ";
				}
				//cout << endl;
				int lookwhatyoumademedo = tryCombination(aux);
				if(lookwhatyoumademedo == -1)lookwhatyoumademedo = N+1;
				if(lookwhatyoumademedo == find)hi = mid;
				else lo = mid+1;
			}
			//cout << lo << endl;
			door[lo] = find;
			stick[lo] = 1;
		}
		else{
			// look for first i such that rightnow becomes more than find
			while(lo < hi){
				
				int mid = (lo+hi)/2;
				REP(i,mid+1){
					if(!stick[i])aux[i] = cur[i]^1;
					else aux[i] = cur[i];
					
				}
				for(int i = mid+1;i < N;i++){
					aux[i] = cur[i];
				}
				int lookwhatyoumademedo = tryCombination(aux);
				if(lookwhatyoumademedo == -1)lookwhatyoumademedo = N+1;
				if(lookwhatyoumademedo > find)hi = mid;
				else lo = mid+1;
			}
			//cout  << lo << endl;
			door[lo] = find;
			stick[lo] = 1;
			cur[lo] ^= 1;
		}
		find++;
	}
	answer(cur,door);
}

Compilation message

cave.cpp:42:21: warning: overflow in implicit constant conversion [-Woverflow]
 const int INF = 1e18+1;
                 ~~~~^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 640 KB Output is correct
2 Correct 319 ms 524 KB Output is correct
3 Correct 434 ms 520 KB Output is correct
4 Correct 336 ms 512 KB Output is correct
5 Correct 387 ms 640 KB Output is correct
6 Correct 407 ms 512 KB Output is correct
7 Correct 449 ms 528 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 414 ms 524 KB Output is correct
13 Correct 481 ms 524 KB Output is correct
14 Correct 352 ms 512 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 536 ms 640 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 491 ms 520 KB Output is correct
4 Correct 6 ms 452 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 439 ms 640 KB Output is correct
7 Correct 407 ms 640 KB Output is correct
8 Correct 887 ms 580 KB Output is correct
9 Correct 860 ms 528 KB Output is correct
10 Correct 817 ms 528 KB Output is correct
11 Correct 440 ms 588 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 5 ms 324 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 420 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 396 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 396 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 63 ms 456 KB Output is correct
21 Correct 6 ms 452 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 97 ms 460 KB Output is correct
24 Correct 102 ms 512 KB Output is correct
25 Correct 90 ms 512 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 54 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 70 ms 500 KB Output is correct
31 Correct 82 ms 452 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 85 ms 512 KB Output is correct
36 Correct 108 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 640 KB Output is correct
2 Correct 319 ms 524 KB Output is correct
3 Correct 434 ms 520 KB Output is correct
4 Correct 336 ms 512 KB Output is correct
5 Correct 387 ms 640 KB Output is correct
6 Correct 407 ms 512 KB Output is correct
7 Correct 449 ms 528 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 414 ms 524 KB Output is correct
13 Correct 481 ms 524 KB Output is correct
14 Correct 352 ms 512 KB Output is correct
15 Correct 536 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 491 ms 520 KB Output is correct
18 Correct 6 ms 452 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 439 ms 640 KB Output is correct
21 Correct 407 ms 640 KB Output is correct
22 Correct 887 ms 580 KB Output is correct
23 Correct 860 ms 528 KB Output is correct
24 Correct 817 ms 528 KB Output is correct
25 Correct 440 ms 588 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 7 ms 384 KB Output is correct
28 Correct 5 ms 324 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 6 ms 420 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 396 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 6 ms 512 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 6 ms 396 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 63 ms 456 KB Output is correct
46 Correct 6 ms 452 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 97 ms 460 KB Output is correct
49 Correct 102 ms 512 KB Output is correct
50 Correct 90 ms 512 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 54 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 70 ms 500 KB Output is correct
56 Correct 82 ms 452 KB Output is correct
57 Correct 6 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 85 ms 512 KB Output is correct
61 Correct 108 ms 384 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 298 ms 512 KB Output is correct
64 Correct 264 ms 512 KB Output is correct
65 Correct 403 ms 524 KB Output is correct
66 Correct 255 ms 512 KB Output is correct
67 Correct 447 ms 588 KB Output is correct
68 Correct 508 ms 640 KB Output is correct
69 Correct 393 ms 512 KB Output is correct
70 Correct 6 ms 324 KB Output is correct
71 Correct 6 ms 512 KB Output is correct
72 Correct 373 ms 588 KB Output is correct
73 Correct 361 ms 528 KB Output is correct
74 Correct 376 ms 528 KB Output is correct
75 Correct 442 ms 640 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 6 ms 512 KB Output is correct
78 Correct 479 ms 520 KB Output is correct
79 Correct 437 ms 540 KB Output is correct
80 Correct 774 ms 528 KB Output is correct
81 Correct 808 ms 524 KB Output is correct
82 Correct 834 ms 512 KB Output is correct
83 Correct 418 ms 640 KB Output is correct
84 Correct 6 ms 384 KB Output is correct
85 Correct 60 ms 452 KB Output is correct
86 Correct 429 ms 524 KB Output is correct
87 Correct 6 ms 384 KB Output is correct
88 Correct 6 ms 384 KB Output is correct
89 Correct 90 ms 512 KB Output is correct
90 Correct 85 ms 384 KB Output is correct
91 Correct 89 ms 384 KB Output is correct
92 Correct 731 ms 640 KB Output is correct
93 Correct 733 ms 640 KB Output is correct
94 Correct 710 ms 512 KB Output is correct
95 Correct 6 ms 512 KB Output is correct
96 Correct 6 ms 512 KB Output is correct
97 Correct 434 ms 512 KB Output is correct
98 Correct 61 ms 452 KB Output is correct
99 Correct 407 ms 640 KB Output is correct
100 Correct 6 ms 512 KB Output is correct
101 Correct 61 ms 512 KB Output is correct
102 Correct 87 ms 452 KB Output is correct
103 Correct 425 ms 640 KB Output is correct
104 Correct 6 ms 384 KB Output is correct
105 Correct 5 ms 384 KB Output is correct
106 Correct 5 ms 384 KB Output is correct
107 Correct 88 ms 396 KB Output is correct
108 Correct 104 ms 512 KB Output is correct
109 Correct 764 ms 512 KB Output is correct
110 Correct 826 ms 524 KB Output is correct
111 Correct 5 ms 384 KB Output is correct