oj.uz

답안 #288197

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288197 2020-09-01T09:51:56 Z Fasho 동굴 (IOI13_cave) C++14
100 / 100
 1250 ms 1272 KB 
#include <bits/stdc++.h>
#define NN 100005
#define ll long long int
#define fo(i,x,y)   for(int i=x;i<=y;i++)
#define fs(ar,n) fo(i,1,n) cin>>ar[i]
#define sp " "
// #define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll> 
#define fast2 freopen ("in.txt","r",stdin);freopen ("out.txt","w",stdout);
#define mod 1000000007
#include "cave.h"
using namespace std;

int n,m,ar[NN],sum,t,tutmac[NN],tut[NN],flag,ans[NN];

bool check(int l,int r,int x)
{
	fo(i,0,n-1)
	tutmac[i]=!flag;
	// fo(i,0,n-1)
	// cout<<tutmac[i]<<sp;
	// cout<<endl;
	fo(i,l,r)
		tutmac[i]=flag;
	fo(i,0,n-1)
		if(tut[i]!=-1)
			tutmac[i]=tut[i];
	int y=tryCombination(tutmac);
	// cout<<"[d]"<<sp<<x<<sp<<l<<sp<<r<<endl;
	// y<<endl;
	// cout<<y<<endl<<endl;

	if(y>x || y==-1)
		return 1;
	return 0;
}

void bs(int x)
{
	int l=0,r=n-1;
	 flag=1;
	fo(i,0,n-1)
		tutmac[i]=0;
	fo(i,0,n-1)
		if(tut[i]!=-1)
			tutmac[i]=tut[i];
	int y=tryCombination(tutmac);
	if(y>x || y==-1)
		flag=0;
	// cout<<"[d2]"<<sp;
	// cout<<x<<sp<<flag<<endl;
	while(l<r)
	{
		if(l==r-1)
		{
			if(check(r,r,x))
				l=r;
			break;
		}
		int mid=(l+r)/2;
		if(check(l,mid,x))
			r=mid;
		else
			l=mid+1;
	}
	tut[l]=flag;
	ans[l]=x;


}

void exploreCave(int N) {
    n=N;
	memset(tut,-1,sizeof(tut));
    fo(i,0,n-1)
		bs(i);
	// fo(i,0,n-1)
		// cout<<tut[i]<<sp;
	// fo(i,0,n-1)
		// cout<<ans[i]<<sp;

    answer(tut,ans);	
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 836 KB Output is correct
2 Correct 414 ms 888 KB Output is correct
3 Correct 638 ms 888 KB Output is correct
4 Correct 432 ms 768 KB Output is correct
5 Correct 650 ms 1144 KB Output is correct
6 Correct 640 ms 888 KB Output is correct
7 Correct 664 ms 888 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 634 ms 1148 KB Output is correct
13 Correct 628 ms 888 KB Output is correct
14 Correct 636 ms 888 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 672 ms 1016 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 670 ms 888 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 654 ms 1000 KB Output is correct
7 Correct 670 ms 1016 KB Output is correct
8 Correct 1183 ms 888 KB Output is correct
9 Correct 1213 ms 888 KB Output is correct
10 Correct 1250 ms 892 KB Output is correct
11 Correct 654 ms 1028 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 800 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 800 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 672 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 96 ms 768 KB Output is correct
21 Correct 1 ms 768 KB Output is correct
22 Correct 1 ms 768 KB Output is correct
23 Correct 154 ms 888 KB Output is correct
24 Correct 150 ms 768 KB Output is correct
25 Correct 150 ms 768 KB Output is correct
26 Correct 1 ms 768 KB Output is correct
27 Correct 1 ms 768 KB Output is correct
28 Correct 95 ms 768 KB Output is correct
29 Correct 1 ms 768 KB Output is correct
30 Correct 107 ms 768 KB Output is correct
31 Correct 107 ms 888 KB Output is correct
32 Correct 1 ms 768 KB Output is correct
33 Correct 1 ms 768 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 149 ms 768 KB Output is correct
36 Correct 150 ms 828 KB Output is correct
37 Correct 1 ms 768 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 836 KB Output is correct
2 Correct 414 ms 888 KB Output is correct
3 Correct 638 ms 888 KB Output is correct
4 Correct 432 ms 768 KB Output is correct
5 Correct 650 ms 1144 KB Output is correct
6 Correct 640 ms 888 KB Output is correct
7 Correct 664 ms 888 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 634 ms 1148 KB Output is correct
13 Correct 628 ms 888 KB Output is correct
14 Correct 636 ms 888 KB Output is correct
15 Correct 672 ms 1016 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 670 ms 888 KB Output is correct
18 Correct 1 ms 768 KB Output is correct
19 Correct 1 ms 768 KB Output is correct
20 Correct 654 ms 1000 KB Output is correct
21 Correct 670 ms 1016 KB Output is correct
22 Correct 1183 ms 888 KB Output is correct
23 Correct 1213 ms 888 KB Output is correct
24 Correct 1250 ms 892 KB Output is correct
25 Correct 654 ms 1028 KB Output is correct
26 Correct 1 ms 768 KB Output is correct
27 Correct 1 ms 768 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 1 ms 768 KB Output is correct
30 Correct 1 ms 768 KB Output is correct
31 Correct 1 ms 768 KB Output is correct
32 Correct 1 ms 800 KB Output is correct
33 Correct 1 ms 768 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 768 KB Output is correct
36 Correct 1 ms 768 KB Output is correct
37 Correct 1 ms 768 KB Output is correct
38 Correct 1 ms 768 KB Output is correct
39 Correct 1 ms 768 KB Output is correct
40 Correct 1 ms 768 KB Output is correct
41 Correct 1 ms 768 KB Output is correct
42 Correct 1 ms 672 KB Output is correct
43 Correct 1 ms 768 KB Output is correct
44 Correct 1 ms 768 KB Output is correct
45 Correct 96 ms 768 KB Output is correct
46 Correct 1 ms 768 KB Output is correct
47 Correct 1 ms 768 KB Output is correct
48 Correct 154 ms 888 KB Output is correct
49 Correct 150 ms 768 KB Output is correct
50 Correct 150 ms 768 KB Output is correct
51 Correct 1 ms 768 KB Output is correct
52 Correct 1 ms 768 KB Output is correct
53 Correct 95 ms 768 KB Output is correct
54 Correct 1 ms 768 KB Output is correct
55 Correct 107 ms 768 KB Output is correct
56 Correct 107 ms 888 KB Output is correct
57 Correct 1 ms 768 KB Output is correct
58 Correct 1 ms 768 KB Output is correct
59 Correct 1 ms 768 KB Output is correct
60 Correct 149 ms 768 KB Output is correct
61 Correct 150 ms 828 KB Output is correct
62 Correct 1 ms 768 KB Output is correct
63 Correct 412 ms 768 KB Output is correct
64 Correct 417 ms 1144 KB Output is correct
65 Correct 638 ms 1016 KB Output is correct
66 Correct 434 ms 1000 KB Output is correct
67 Correct 656 ms 1144 KB Output is correct
68 Correct 626 ms 888 KB Output is correct
69 Correct 658 ms 888 KB Output is correct
70 Correct 1 ms 768 KB Output is correct
71 Correct 1 ms 768 KB Output is correct
72 Correct 629 ms 888 KB Output is correct
73 Correct 651 ms 1272 KB Output is correct
74 Correct 641 ms 1132 KB Output is correct
75 Correct 662 ms 888 KB Output is correct
76 Correct 1 ms 768 KB Output is correct
77 Correct 1 ms 768 KB Output is correct
78 Correct 657 ms 1016 KB Output is correct
79 Correct 646 ms 888 KB Output is correct
80 Correct 1187 ms 888 KB Output is correct
81 Correct 1202 ms 1020 KB Output is correct
82 Correct 1232 ms 896 KB Output is correct
83 Correct 657 ms 888 KB Output is correct
84 Correct 1 ms 768 KB Output is correct
85 Correct 93 ms 768 KB Output is correct
86 Correct 630 ms 888 KB Output is correct
87 Correct 1 ms 768 KB Output is correct
88 Correct 1 ms 768 KB Output is correct
89 Correct 153 ms 768 KB Output is correct
90 Correct 156 ms 768 KB Output is correct
91 Correct 148 ms 768 KB Output is correct
92 Correct 1177 ms 888 KB Output is correct
93 Correct 1193 ms 896 KB Output is correct
94 Correct 1225 ms 888 KB Output is correct
95 Correct 1 ms 768 KB Output is correct
96 Correct 1 ms 672 KB Output is correct
97 Correct 660 ms 888 KB Output is correct
98 Correct 93 ms 768 KB Output is correct
99 Correct 639 ms 888 KB Output is correct
100 Correct 1 ms 768 KB Output is correct
101 Correct 94 ms 824 KB Output is correct
102 Correct 127 ms 768 KB Output is correct
103 Correct 642 ms 948 KB Output is correct
104 Correct 1 ms 768 KB Output is correct
105 Correct 1 ms 768 KB Output is correct
106 Correct 1 ms 896 KB Output is correct
107 Correct 153 ms 768 KB Output is correct
108 Correct 148 ms 768 KB Output is correct
109 Correct 1185 ms 924 KB Output is correct
110 Correct 1183 ms 896 KB Output is correct
111 Correct 1 ms 768 KB Output is correct