Submission #105106

# Submission time Handle Problem Language Result Execution time Memory
105106 2019-04-10T14:44:41 Z mrtsima22 Cave (IOI13_cave) C++17
100 / 100
1119 ms 640 KB
#include <bits/stdc++.h>
#include "cave.h"
 #define LSOne(S) (S & (-S))
#define ll long long
#define pii pair<int,int>
#define twol pair<ll,ll>
#define four pair<two,two>
#define pb push_back
#define mk make_pair
#define INF 1000000000000000000
#define P 1000000007
#define lmax 1000000000
#define nn 1000003
#define ff first
#define ss second
#define vi vector<int>
#define vll vector<ll>
#define vtwo vector<two>
#define ALL(container) (container).begin(), (container).end()
#define sz(container) (int)(container.size())
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define mid(a,b) (a+b>>1)
#define minN 0
#define na(x) ((x)<P?(x):(x)-P)
#define ab(a) (-(a)<(a)?(a):-(a))
#define FAST std::ios::sync_with_stdio(false)
#define xRand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rnd rng
#define IT iterator
#define MAXN 5005
using namespace std;
int N ;
int A[MAXN] , B[MAXN] , s[MAXN];
int resp1[MAXN] , resp2[MAXN] ;
pii ans[MAXN] ;
int findDoor( int door ){
	memset(s , 0 , sizeof s) ;
	for(int i=0;i<N;i++) if( A[i] != -1 ) s[ A[i] ] = B[i] ;
	int k = tryCombination(s) ;
	if(k == -1) k = door + 1 ;
	if( k > door ) return B[door] = 0 ;
	else return B[door] = 1 ;
}
int findSwitch( int door ){
	int u = 0 , l = N-1 , mid ,x = B[door] ;
	while( u < l ){
		mid = (u+l)/2 ;
		memset(s , -1 , sizeof s) ;
		for(int i=0;i<N;i++) if(A[i] != -1) s[ A[i] ] = B[ i ] ;
		for(int i=u;i<=mid;i++) if(s[i] == -1 ) s[i] = x ;
		for(int i=mid;i<=l;i++) if( s[i] == -1 ) s[i] = x^1 ;
		int k = tryCombination(s) ;
		if( k == -1 ) k = door + 1 ;
		if(k > door) l = mid ;
		else u = mid + 1 ;
	}
	return l  ;
}
 
void exploreCave( int n ){
	N=n;
	memset(A, -1 , sizeof A) ;memset(B, -1, sizeof B) ;
	for(int i=0;i<N;i++) B[i] = findDoor(i) ,A[i] = findSwitch(i) ;
	pii p[MAXN] ;
	for(int i=0;i<N;i++) p[i] = pii( A[i] , i ) ;
	sort(p,p+N) ;
	for(int i=0;i<N;i++) resp1[i] = p[i].ss ;
	for(int i=0;i<N;i++) resp2[i] = B[ p[i].ss ] ;
	answer(resp2, resp1) ;
}
/*

                   *         *
                  * *       * *
                 *   *     *   *
                *     *   *     *
                 *   *   * *   *
                  *   *   *   *
                   *   * *   *
                     *  *   *
					   *  *


*/




# Verdict Execution time Memory Grader output
1 Correct 633 ms 640 KB Output is correct
2 Correct 613 ms 520 KB Output is correct
3 Correct 875 ms 520 KB Output is correct
4 Correct 617 ms 580 KB Output is correct
5 Correct 903 ms 520 KB Output is correct
6 Correct 884 ms 512 KB Output is correct
7 Correct 938 ms 516 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 512 KB Output is correct
11 Correct 5 ms 548 KB Output is correct
12 Correct 875 ms 640 KB Output is correct
13 Correct 900 ms 640 KB Output is correct
14 Correct 825 ms 640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 916 ms 640 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 875 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 945 ms 640 KB Output is correct
7 Correct 937 ms 640 KB Output is correct
8 Correct 1034 ms 520 KB Output is correct
9 Correct 1036 ms 524 KB Output is correct
10 Correct 1057 ms 520 KB Output is correct
11 Correct 876 ms 640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 6 ms 580 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 7 ms 524 KB Output is correct
20 Correct 159 ms 504 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 640 KB Output is correct
23 Correct 163 ms 512 KB Output is correct
24 Correct 153 ms 496 KB Output is correct
25 Correct 158 ms 512 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 7 ms 512 KB Output is correct
28 Correct 144 ms 516 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 154 ms 496 KB Output is correct
31 Correct 145 ms 504 KB Output is correct
32 Correct 7 ms 640 KB Output is correct
33 Correct 7 ms 640 KB Output is correct
34 Correct 7 ms 512 KB Output is correct
35 Correct 168 ms 504 KB Output is correct
36 Correct 156 ms 504 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 633 ms 640 KB Output is correct
2 Correct 613 ms 520 KB Output is correct
3 Correct 875 ms 520 KB Output is correct
4 Correct 617 ms 580 KB Output is correct
5 Correct 903 ms 520 KB Output is correct
6 Correct 884 ms 512 KB Output is correct
7 Correct 938 ms 516 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 512 KB Output is correct
11 Correct 5 ms 548 KB Output is correct
12 Correct 875 ms 640 KB Output is correct
13 Correct 900 ms 640 KB Output is correct
14 Correct 825 ms 640 KB Output is correct
15 Correct 916 ms 640 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 875 ms 512 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 945 ms 640 KB Output is correct
21 Correct 937 ms 640 KB Output is correct
22 Correct 1034 ms 520 KB Output is correct
23 Correct 1036 ms 524 KB Output is correct
24 Correct 1057 ms 520 KB Output is correct
25 Correct 876 ms 640 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 7 ms 640 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 7 ms 640 KB Output is correct
35 Correct 6 ms 640 KB Output is correct
36 Correct 6 ms 512 KB Output is correct
37 Correct 7 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 6 ms 580 KB Output is correct
41 Correct 5 ms 640 KB Output is correct
42 Correct 5 ms 640 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 7 ms 524 KB Output is correct
45 Correct 159 ms 504 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 6 ms 640 KB Output is correct
48 Correct 163 ms 512 KB Output is correct
49 Correct 153 ms 496 KB Output is correct
50 Correct 158 ms 512 KB Output is correct
51 Correct 6 ms 640 KB Output is correct
52 Correct 7 ms 512 KB Output is correct
53 Correct 144 ms 516 KB Output is correct
54 Correct 6 ms 512 KB Output is correct
55 Correct 154 ms 496 KB Output is correct
56 Correct 145 ms 504 KB Output is correct
57 Correct 7 ms 640 KB Output is correct
58 Correct 7 ms 640 KB Output is correct
59 Correct 7 ms 512 KB Output is correct
60 Correct 168 ms 504 KB Output is correct
61 Correct 156 ms 504 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 580 ms 524 KB Output is correct
64 Correct 714 ms 640 KB Output is correct
65 Correct 924 ms 536 KB Output is correct
66 Correct 641 ms 640 KB Output is correct
67 Correct 922 ms 512 KB Output is correct
68 Correct 848 ms 520 KB Output is correct
69 Correct 854 ms 552 KB Output is correct
70 Correct 6 ms 588 KB Output is correct
71 Correct 5 ms 512 KB Output is correct
72 Correct 922 ms 516 KB Output is correct
73 Correct 873 ms 512 KB Output is correct
74 Correct 959 ms 640 KB Output is correct
75 Correct 881 ms 520 KB Output is correct
76 Correct 5 ms 524 KB Output is correct
77 Correct 5 ms 512 KB Output is correct
78 Correct 892 ms 512 KB Output is correct
79 Correct 920 ms 640 KB Output is correct
80 Correct 1004 ms 532 KB Output is correct
81 Correct 1045 ms 516 KB Output is correct
82 Correct 1041 ms 520 KB Output is correct
83 Correct 933 ms 536 KB Output is correct
84 Correct 7 ms 512 KB Output is correct
85 Correct 151 ms 496 KB Output is correct
86 Correct 842 ms 516 KB Output is correct
87 Correct 6 ms 512 KB Output is correct
88 Correct 7 ms 512 KB Output is correct
89 Correct 165 ms 516 KB Output is correct
90 Correct 158 ms 520 KB Output is correct
91 Correct 158 ms 496 KB Output is correct
92 Correct 948 ms 520 KB Output is correct
93 Correct 1119 ms 520 KB Output is correct
94 Correct 1045 ms 640 KB Output is correct
95 Correct 6 ms 460 KB Output is correct
96 Correct 6 ms 524 KB Output is correct
97 Correct 857 ms 640 KB Output is correct
98 Correct 156 ms 512 KB Output is correct
99 Correct 911 ms 640 KB Output is correct
100 Correct 6 ms 512 KB Output is correct
101 Correct 135 ms 492 KB Output is correct
102 Correct 144 ms 516 KB Output is correct
103 Correct 874 ms 640 KB Output is correct
104 Correct 6 ms 512 KB Output is correct
105 Correct 7 ms 640 KB Output is correct
106 Correct 6 ms 588 KB Output is correct
107 Correct 164 ms 492 KB Output is correct
108 Correct 163 ms 496 KB Output is correct
109 Correct 1054 ms 640 KB Output is correct
110 Correct 979 ms 640 KB Output is correct
111 Correct 6 ms 512 KB Output is correct