oj.uz

Submission #29940

# Submission time Handle Problem Language Result Execution time Memory
29940 2017-07-21T11:09:49 Z aybala Cave (IOI13_cave) C++11
100 / 100
 658 ms 680 KB 
#include "cave.h"

#include<bits/stdc++.h>
#define fori(a,b,c) for(int a=b; a<c; a++)
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;

int n;

int sw[5000];

int used[5000];

pii b[8900];
//pii a[8900];

int s[5000],d[5000];

void exploreCave(int N) {
	n=N;
	
	int lg=0;
	
	while((1<<lg) < n){
		lg++;
	}
	
	//cout << lg;
	
	int nn=(1<<lg);
	
	fori(i,0,n){
		int las=0;
		fori(j,0,lg+1){
			fori(k,las,las+(nn/(1<<j))){
				if(k>=n)
					break;
				if(!used[k]){
					sw[k]=(b[i].se+1)%2;
				}
				else{
					sw[k]=s[k];
				}
			}
			if(las>=n){
				continue;
			}
			
			int trc=tryCombination(sw);
			
			
			if(n==1){
				if(trc!=i){
					b[i].se=1;
				}
				d[i]=i;
				s[i]=b[i].se;
			}
			
			if(j==lg){
				if(trc!=i){
					used[las+1]=1;
					b[i].fi=las+1;
					d[las+1]=i;
					s[las+1]=b[i].se;
				}
				else{
					used[las]=1;
					b[i].fi=las;
					d[las]=i;
					s[las]=b[i].se;
				}
				break;
			}
			
			if(trc!=i && j==0){
				b[i].se = 1;
				continue;
			}
			
			if(trc==i && j==0){
				fori(k,las,las+(nn/(1<<j))){
					if(k>=n)
						break;
					if(!used[k]){
						sw[k]=0;
					}
					else{
						sw[k]=s[k];
					}
				}
				continue;
			}
			
			if(trc!=i && j!=0){
				if(las+(nn/(1<<j)) <n)
					las=las+(nn/(1<<j));
				continue;
			}
			
			if(trc==i && j!=0){
				fori(k,las,las+(nn/(1<<j))){
					if(k>=n)
						break;
					if(!used[k]){
						sw[k]=(b[i].se)%2;
					}
					else{
						sw[k]=s[k];
					}
				}
				continue;	
			}		
			
			
		
		}
	}	
	
	/*fori(i,0,n){
		s[i]=a[i].se;
		d[i]=a[i].fi;
	}*/
	
	/*fori(i,0,80000){
		tryCombination(sw);
	}*/
	answer(s,d);
	return ;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 584 KB Output is correct
2 Correct 273 ms 540 KB Output is correct
3 Correct 344 ms 516 KB Output is correct
4 Correct 285 ms 652 KB Output is correct
5 Correct 400 ms 524 KB Output is correct
6 Correct 310 ms 516 KB Output is correct
7 Correct 363 ms 504 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 314 ms 640 KB Output is correct
13 Correct 307 ms 548 KB Output is correct
14 Correct 303 ms 520 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 454 ms 520 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 322 ms 640 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 368 ms 524 KB Output is correct
7 Correct 326 ms 588 KB Output is correct
8 Correct 615 ms 580 KB Output is correct
9 Correct 548 ms 544 KB Output is correct
10 Correct 519 ms 608 KB Output is correct
11 Correct 383 ms 524 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 452 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 42 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 56 ms 496 KB Output is correct
24 Correct 54 ms 384 KB Output is correct
25 Correct 76 ms 512 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 40 ms 632 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 52 ms 620 KB Output is correct
31 Correct 54 ms 500 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 324 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 67 ms 488 KB Output is correct
36 Correct 68 ms 512 KB Output is correct
37 Correct 5 ms 420 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 584 KB Output is correct
2 Correct 273 ms 540 KB Output is correct
3 Correct 344 ms 516 KB Output is correct
4 Correct 285 ms 652 KB Output is correct
5 Correct 400 ms 524 KB Output is correct
6 Correct 310 ms 516 KB Output is correct
7 Correct 363 ms 504 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 314 ms 640 KB Output is correct
13 Correct 307 ms 548 KB Output is correct
14 Correct 303 ms 520 KB Output is correct
15 Correct 454 ms 520 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 322 ms 640 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 368 ms 524 KB Output is correct
21 Correct 326 ms 588 KB Output is correct
22 Correct 615 ms 580 KB Output is correct
23 Correct 548 ms 544 KB Output is correct
24 Correct 519 ms 608 KB Output is correct
25 Correct 383 ms 524 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 452 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 6 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 6 ms 512 KB Output is correct
45 Correct 42 ms 384 KB Output is correct
46 Correct 6 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 56 ms 496 KB Output is correct
49 Correct 54 ms 384 KB Output is correct
50 Correct 76 ms 512 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 6 ms 512 KB Output is correct
53 Correct 40 ms 632 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 52 ms 620 KB Output is correct
56 Correct 54 ms 500 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 6 ms 324 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 67 ms 488 KB Output is correct
61 Correct 68 ms 512 KB Output is correct
62 Correct 5 ms 420 KB Output is correct
63 Correct 209 ms 516 KB Output is correct
64 Correct 283 ms 568 KB Output is correct
65 Correct 404 ms 504 KB Output is correct
66 Correct 275 ms 504 KB Output is correct
67 Correct 382 ms 504 KB Output is correct
68 Correct 331 ms 564 KB Output is correct
69 Correct 395 ms 508 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 367 ms 516 KB Output is correct
73 Correct 281 ms 504 KB Output is correct
74 Correct 378 ms 508 KB Output is correct
75 Correct 399 ms 632 KB Output is correct
76 Correct 6 ms 384 KB Output is correct
77 Correct 5 ms 384 KB Output is correct
78 Correct 383 ms 492 KB Output is correct
79 Correct 395 ms 516 KB Output is correct
80 Correct 611 ms 512 KB Output is correct
81 Correct 569 ms 680 KB Output is correct
82 Correct 658 ms 556 KB Output is correct
83 Correct 361 ms 516 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 43 ms 476 KB Output is correct
86 Correct 328 ms 616 KB Output is correct
87 Correct 5 ms 452 KB Output is correct
88 Correct 6 ms 452 KB Output is correct
89 Correct 59 ms 516 KB Output is correct
90 Correct 61 ms 512 KB Output is correct
91 Correct 54 ms 460 KB Output is correct
92 Correct 516 ms 568 KB Output is correct
93 Correct 530 ms 560 KB Output is correct
94 Correct 492 ms 668 KB Output is correct
95 Correct 6 ms 384 KB Output is correct
96 Correct 5 ms 512 KB Output is correct
97 Correct 319 ms 560 KB Output is correct
98 Correct 41 ms 452 KB Output is correct
99 Correct 330 ms 636 KB Output is correct
100 Correct 6 ms 384 KB Output is correct
101 Correct 59 ms 504 KB Output is correct
102 Correct 47 ms 384 KB Output is correct
103 Correct 307 ms 516 KB Output is correct
104 Correct 5 ms 512 KB Output is correct
105 Correct 5 ms 512 KB Output is correct
106 Correct 6 ms 384 KB Output is correct
107 Correct 60 ms 512 KB Output is correct
108 Correct 68 ms 384 KB Output is correct
109 Correct 506 ms 560 KB Output is correct
110 Correct 568 ms 524 KB Output is correct
111 Correct 5 ms 384 KB Output is correct