Submission #29929

# Submission time Handle Problem Language Result Execution time Memory
29929 2017-07-21T10:53:18 Z inqr Cave (IOI13_cave) C++14
100 / 100
1408 ms 640 KB
#include "cave.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define DB printf("debug\n");
using namespace std;
int n;
vector < pair<int,int> > sw_st(5000);//sw i 1 -> st kapi nd state
vector < int > sw_nf;
int last_try[5000];
int new_try[5000];
int last_try_ret;
int new_try_ret;
int last_try_state;
int new_try_state;
void try_dr(int dr){
	if(dr==0){
		memset(last_try,0,sizeof(last_try));
		memset(new_try,0,sizeof(new_try));
	}
	last_try_ret=tryCombination(last_try);
	last_try_state=	(last_try_ret>dr || last_try_ret==-1) ? 0 : 1;
	//printf("1:dr = %d drst=%d ltr=%d\n",dr,last_try_state,last_try_ret);

	int l=0,r=sw_nf.size()-1,m;
	while(l<r){
		for(int i=0;i<n;i++){	
			if(sw_st[i].nd==0){
				new_try[i]=1;
				//printf("new_try[%d]=%d\n",i,new_try[i]);
			}
			else if(sw_st[i].nd==1){
				new_try[i]=0;
				//printf("new_try[%d]=%d\n",i,new_try[i]);
			}
		}
		m=(l+r)/2;
		//printf("	dr =%d l=%d r=%d m=%d\n",dr,l,r,m);
		for(int i=l;i<=m;i++){
			new_try[sw_nf[i]]=!last_try[sw_nf[i]];
			//printf("	new_try[%d]=%d\n",sw_nf[i],new_try[sw_nf[i]]);
		}
		new_try_ret=tryCombination(new_try);
		new_try_state=(new_try_ret>dr || new_try_ret==-1) ? 0 : 1;

		if(last_try_state!=new_try_state){
			r=m;
		}
		else{
			l=m+1;
		}
		//printf("	dr=%d ret=%d kon eden l=%d r=%d\n",dr,new_try_ret,l,r);

		last_try_ret=new_try_ret;
		last_try_state=new_try_state;
		for(int i=0;i<n;i++){
			last_try[i]=new_try[i];
		}
	}
	int sw=sw_nf[l];
	//printf("2:sw=%d ltr=%d lts=%d\n",sw,last_try_ret,last_try_state);
	if(dr==last_try_ret){
		last_try[sw]=!last_try[sw];
	}
	if(last_try[sw]==1){
		sw_st[sw]=mp(dr,0);
	}
	else sw_st[sw]=mp(dr,1);
	//printf("3:sw=%d st=%d dr=%d st=%d\n",sw,1,dr,sw_st[sw].nd);
	sw_nf.erase(sw_nf.begin()+l);
}
void exploreCave(int N) {
	n=N;
	for(int i=0;i<n;i++){
		sw_nf.pb(i);//bilinmeyenlere ekle
		sw_st[i]=mp(-1,-1);
	}
    for(int i=0;i<n;i++){
    	try_dr(i);
    }
    int ans1[n],ans2[n];
    for(int i=0;i<n;i++){
    	if(sw_st[i].nd==0)ans1[i]=1;
    	else ans1[i]=0;
    	ans2[i]=sw_st[i].st;
    }
    answer(ans1,ans2);
}
# Verdict Execution time Memory Grader output
1 Correct 478 ms 560 KB Output is correct
2 Correct 430 ms 572 KB Output is correct
3 Correct 521 ms 592 KB Output is correct
4 Correct 466 ms 584 KB Output is correct
5 Correct 597 ms 588 KB Output is correct
6 Correct 569 ms 588 KB Output is correct
7 Correct 706 ms 588 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 856 ms 552 KB Output is correct
13 Correct 871 ms 556 KB Output is correct
14 Correct 792 ms 564 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 577 ms 580 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 646 ms 548 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 632 ms 592 KB Output is correct
7 Correct 534 ms 584 KB Output is correct
8 Correct 1408 ms 560 KB Output is correct
9 Correct 1388 ms 552 KB Output is correct
10 Correct 1309 ms 548 KB Output is correct
11 Correct 582 ms 552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 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 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 416 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 432 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 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 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 416 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 432 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 360 KB Output is correct
17 Correct 5 ms 360 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 122 ms 484 KB Output is correct
21 Correct 5 ms 432 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 130 ms 504 KB Output is correct
24 Correct 119 ms 512 KB Output is correct
25 Correct 126 ms 544 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 143 ms 512 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 110 ms 512 KB Output is correct
31 Correct 86 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 143 ms 508 KB Output is correct
36 Correct 149 ms 488 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 478 ms 560 KB Output is correct
2 Correct 430 ms 572 KB Output is correct
3 Correct 521 ms 592 KB Output is correct
4 Correct 466 ms 584 KB Output is correct
5 Correct 597 ms 588 KB Output is correct
6 Correct 569 ms 588 KB Output is correct
7 Correct 706 ms 588 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 856 ms 552 KB Output is correct
13 Correct 871 ms 556 KB Output is correct
14 Correct 792 ms 564 KB Output is correct
15 Correct 577 ms 580 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 646 ms 548 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 632 ms 592 KB Output is correct
21 Correct 534 ms 584 KB Output is correct
22 Correct 1408 ms 560 KB Output is correct
23 Correct 1388 ms 552 KB Output is correct
24 Correct 1309 ms 548 KB Output is correct
25 Correct 582 ms 552 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 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 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 6 ms 416 KB Output is correct
35 Correct 6 ms 512 KB Output is correct
36 Correct 5 ms 432 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 6 ms 384 KB Output is correct
41 Correct 5 ms 360 KB Output is correct
42 Correct 5 ms 360 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 122 ms 484 KB Output is correct
46 Correct 5 ms 432 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 130 ms 504 KB Output is correct
49 Correct 119 ms 512 KB Output is correct
50 Correct 126 ms 544 KB Output is correct
51 Correct 6 ms 384 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 143 ms 512 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 110 ms 512 KB Output is correct
56 Correct 86 ms 512 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 6 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 143 ms 508 KB Output is correct
61 Correct 149 ms 488 KB Output is correct
62 Correct 6 ms 384 KB Output is correct
63 Correct 503 ms 564 KB Output is correct
64 Correct 436 ms 580 KB Output is correct
65 Correct 621 ms 592 KB Output is correct
66 Correct 442 ms 608 KB Output is correct
67 Correct 607 ms 592 KB Output is correct
68 Correct 585 ms 584 KB Output is correct
69 Correct 588 ms 600 KB Output is correct
70 Correct 5 ms 436 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 874 ms 596 KB Output is correct
73 Correct 871 ms 600 KB Output is correct
74 Correct 708 ms 588 KB Output is correct
75 Correct 664 ms 588 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 6 ms 432 KB Output is correct
78 Correct 760 ms 640 KB Output is correct
79 Correct 565 ms 584 KB Output is correct
80 Correct 1375 ms 596 KB Output is correct
81 Correct 1270 ms 552 KB Output is correct
82 Correct 1239 ms 552 KB Output is correct
83 Correct 685 ms 552 KB Output is correct
84 Correct 6 ms 384 KB Output is correct
85 Correct 129 ms 484 KB Output is correct
86 Correct 744 ms 556 KB Output is correct
87 Correct 6 ms 384 KB Output is correct
88 Correct 5 ms 384 KB Output is correct
89 Correct 136 ms 608 KB Output is correct
90 Correct 116 ms 384 KB Output is correct
91 Correct 119 ms 384 KB Output is correct
92 Correct 978 ms 556 KB Output is correct
93 Correct 1092 ms 552 KB Output is correct
94 Correct 1068 ms 548 KB Output is correct
95 Correct 6 ms 384 KB Output is correct
96 Correct 6 ms 384 KB Output is correct
97 Correct 838 ms 548 KB Output is correct
98 Correct 114 ms 484 KB Output is correct
99 Correct 861 ms 552 KB Output is correct
100 Correct 3 ms 384 KB Output is correct
101 Correct 137 ms 544 KB Output is correct
102 Correct 111 ms 384 KB Output is correct
103 Correct 643 ms 556 KB Output is correct
104 Correct 5 ms 384 KB Output is correct
105 Correct 5 ms 384 KB Output is correct
106 Correct 6 ms 384 KB Output is correct
107 Correct 134 ms 504 KB Output is correct
108 Correct 154 ms 560 KB Output is correct
109 Correct 984 ms 552 KB Output is correct
110 Correct 1152 ms 564 KB Output is correct
111 Correct 5 ms 384 KB Output is correct