답안 #433358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433358	2021-06-19T16:01:46 Z	couplefire	The short shank; Redemption (BOI21_prison)	C++17	80 / 100	2000 ms	288376 KB

prison

#include<bits/stdc++.h>
using namespace std;

const int N=2e6+5,mod=1e9+7;

int t,tree[4*N],n,a[N],lazy[4*N],ans,D,removed[N],mn[N][24];

pair<int,int> tr[4*N];
pair<int,int> w[4*N];

void build(int u,int l,int r){
	if(l==r)  {
		tree[u] = a[l] - l; tr[u].second = l;
		return;
	}
	int mid=(l+r)/2;
	build(2*u,l,mid);
	build(2*u+1,mid+1,r);
	tree[u] = min(tree[2*u],tree[2*u+1]);
	tr[u].second = l;
}

void update(int u,int start,int end,int l,int r,int val) {
	if(lazy[u]) {
		tr[u].first += lazy[u];
		if(l!=r){
			lazy[2*u] += lazy[u];
			lazy[2*u+1] += lazy[u];
		}
		lazy[u] = 0;
	}
	if(l>end || r<start) return;
	if(start<=l && r<=end) {
		lazy[u] = val;
		tr[u].first += lazy[u];
		if(l!=r){
			lazy[2*u] += lazy[u];
			lazy[2*u+1] += lazy[u];
		}
		lazy[u] = 0;		
		return;
	} 
	int mid = (l+r)/2;
	update(2*u,start,end,l,mid,val);
	update(2*u+1,start,end,mid+1,r,val);
	tr[u] = max(tr[2*u],tr[2*u+1]);
}

void insert(int u,int ind,int l,int r,int st,int en) {
	if(l>ind || r<ind) return; 
	if(l==r) {
		w[u] = {st,en};
		return;
	}
	int mid = (l+r)/2;
	insert(2*u,ind,l,mid,st,en);
	insert(2*u+1,ind,mid+1,r,st,en);
	w[u] = min(w[2*u],w[2*u+1]);
}

pair<int, int> get(int u,int start,int end,int l,int r) {
	if(l>end || r<start) return {n+5,0};
	if(start <= l && r <= end) {
		return w[u];
	}
	int mid=(l+r)/2;
	return min(get(2*u,start,end,l,mid),get(2*u+1,start,end,mid+1,r));
}

signed main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>D>>t;
	
	for(int i=1;i<=n;i++) {
		cin >> a[i];
		mn[i][0] = a[i] - i;
	} 	
	int Lg = log2(n) + 1;
	for(int i=1;i<=Lg;i++) {
		for(int j=1;j<=n;j++) {
			if(j+(1<<(i-1)) <= n)mn[j][i] = min(mn[j][i-1],mn[j+(1<<(i-1))][i-1]);
			else mn[j][i] = mn[j][i-1];
		}
	}
	build(1,1,n);
	for(int i=1;i<=n;i++){
		int l = 1, r =i,ind = 0;
		while(l<=r){
			int mid=(l+r)/2;
			int lg = log2(i-mid+1);
			if(min(mn[i-(1<<lg)+1][lg],mn[mid][lg]) <= t-i) {
				ind = mid;
				l = mid + 1;
			}
			else r = mid - 1; 
		}	

		if(ind) ans++;
		if(ind && ind!=i)  { 
			update(1,ind+1,i,1,n,1);
			insert(1,i,1,n,ind+1,i);
		}
		else  {
			insert(1,i,1,n,n+1,i);
		}
	}  	int b = 0;
	int cnt  = 0;
	while(tr[1].first && D) {
 
		int c = tr[1].second; D--; ans -= tr[1].first; 
	
		while(get(1,c,n,1,n).first <=  c) { cnt++;
			if(cnt > n) return 0;
			
			pair<int,int> g = get(1,c,n,1,n);
	
			insert(1,g.second,1,n,n+1,g.second); removed[g.second] = 1;
			b ++ ;
			update(1,g.first,g.second,1,n,-1); 
		}
	}  
	cout<<ans;
}

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	448 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	729 ms	78532 KB	Output is correct
3	Correct	672 ms	78320 KB	Output is correct
4	Correct	794 ms	77128 KB	Output is correct
5	Correct	750 ms	75776 KB	Output is correct
6	Correct	857 ms	77480 KB	Output is correct
7	Correct	1483 ms	79716 KB	Output is correct
8	Correct	825 ms	78084 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	448 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	460 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	4 ms	972 KB	Output is correct
24	Correct	5 ms	972 KB	Output is correct
25	Correct	5 ms	972 KB	Output is correct
26	Correct	7 ms	972 KB	Output is correct
27	Correct	7 ms	972 KB	Output is correct
28	Correct	4 ms	968 KB	Output is correct
29	Correct	4 ms	1100 KB	Output is correct
30	Correct	4 ms	972 KB	Output is correct
31	Correct	5 ms	972 KB	Output is correct
32	Correct	4 ms	972 KB	Output is correct
33	Correct	4 ms	972 KB	Output is correct
34	Correct	5 ms	972 KB	Output is correct
35	Correct	6 ms	972 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	86 ms	14484 KB	Output is correct
3	Correct	96 ms	14576 KB	Output is correct
4	Correct	159 ms	14488 KB	Output is correct
5	Correct	157 ms	14660 KB	Output is correct
6	Correct	156 ms	14632 KB	Output is correct
7	Correct	91 ms	14148 KB	Output is correct
8	Correct	105 ms	14012 KB	Output is correct
9	Correct	177 ms	14660 KB	Output is correct
10	Correct	79 ms	14052 KB	Output is correct

Subtask #5
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	448 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	460 KB	Output is correct
16	Correct	1 ms	460 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	4 ms	972 KB	Output is correct
24	Correct	5 ms	972 KB	Output is correct
25	Correct	5 ms	972 KB	Output is correct
26	Correct	7 ms	972 KB	Output is correct
27	Correct	7 ms	972 KB	Output is correct
28	Correct	4 ms	968 KB	Output is correct
29	Correct	4 ms	1100 KB	Output is correct
30	Correct	4 ms	972 KB	Output is correct
31	Correct	5 ms	972 KB	Output is correct
32	Correct	4 ms	972 KB	Output is correct
33	Correct	4 ms	972 KB	Output is correct
34	Correct	5 ms	972 KB	Output is correct
35	Correct	6 ms	972 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	86 ms	14484 KB	Output is correct
38	Correct	96 ms	14576 KB	Output is correct
39	Correct	159 ms	14488 KB	Output is correct
40	Correct	157 ms	14660 KB	Output is correct
41	Correct	156 ms	14632 KB	Output is correct
42	Correct	91 ms	14148 KB	Output is correct
43	Correct	105 ms	14012 KB	Output is correct
44	Correct	177 ms	14660 KB	Output is correct
45	Correct	79 ms	14052 KB	Output is correct
46	Correct	1 ms	324 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	2 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	1 ms	332 KB	Output is correct
53	Correct	1 ms	332 KB	Output is correct
54	Correct	1 ms	332 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	1 ms	332 KB	Output is correct
57	Correct	4 ms	972 KB	Output is correct
58	Correct	4 ms	972 KB	Output is correct
59	Correct	5 ms	912 KB	Output is correct
60	Correct	5 ms	972 KB	Output is correct
61	Correct	6 ms	976 KB	Output is correct
62	Correct	6 ms	972 KB	Output is correct
63	Correct	4 ms	972 KB	Output is correct
64	Correct	5 ms	972 KB	Output is correct
65	Correct	5 ms	972 KB	Output is correct
66	Correct	4 ms	972 KB	Output is correct
67	Correct	4 ms	972 KB	Output is correct
68	Correct	5 ms	972 KB	Output is correct
69	Correct	5 ms	972 KB	Output is correct
70	Correct	1 ms	332 KB	Output is correct
71	Correct	85 ms	14600 KB	Output is correct
72	Correct	82 ms	14504 KB	Output is correct
73	Correct	135 ms	14340 KB	Output is correct
74	Correct	155 ms	14704 KB	Output is correct
75	Correct	161 ms	14676 KB	Output is correct
76	Correct	93 ms	14208 KB	Output is correct
77	Correct	105 ms	14024 KB	Output is correct
78	Correct	179 ms	14532 KB	Output is correct
79	Correct	104 ms	14152 KB	Output is correct
80	Correct	108 ms	14792 KB	Output is correct
81	Correct	124 ms	14828 KB	Output is correct
82	Correct	115 ms	14828 KB	Output is correct
83	Correct	141 ms	14656 KB	Output is correct
84	Correct	144 ms	14340 KB	Output is correct
85	Correct	161 ms	14760 KB	Output is correct
86	Correct	137 ms	14580 KB	Output is correct
87	Correct	117 ms	14368 KB	Output is correct
88	Correct	169 ms	14648 KB	Output is correct
89	Correct	187 ms	14656 KB	Output is correct
90	Correct	167 ms	14636 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	448 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	729 ms	78532 KB	Output is correct
14	Correct	672 ms	78320 KB	Output is correct
15	Correct	794 ms	77128 KB	Output is correct
16	Correct	750 ms	75776 KB	Output is correct
17	Correct	857 ms	77480 KB	Output is correct
18	Correct	1483 ms	79716 KB	Output is correct
19	Correct	825 ms	78084 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	460 KB	Output is correct
24	Correct	1 ms	460 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	4 ms	972 KB	Output is correct
32	Correct	5 ms	972 KB	Output is correct
33	Correct	5 ms	972 KB	Output is correct
34	Correct	7 ms	972 KB	Output is correct
35	Correct	7 ms	972 KB	Output is correct
36	Correct	4 ms	968 KB	Output is correct
37	Correct	4 ms	1100 KB	Output is correct
38	Correct	4 ms	972 KB	Output is correct
39	Correct	5 ms	972 KB	Output is correct
40	Correct	4 ms	972 KB	Output is correct
41	Correct	4 ms	972 KB	Output is correct
42	Correct	5 ms	972 KB	Output is correct
43	Correct	6 ms	972 KB	Output is correct
44	Correct	1 ms	332 KB	Output is correct
45	Correct	86 ms	14484 KB	Output is correct
46	Correct	96 ms	14576 KB	Output is correct
47	Correct	159 ms	14488 KB	Output is correct
48	Correct	157 ms	14660 KB	Output is correct
49	Correct	156 ms	14632 KB	Output is correct
50	Correct	91 ms	14148 KB	Output is correct
51	Correct	105 ms	14012 KB	Output is correct
52	Correct	177 ms	14660 KB	Output is correct
53	Correct	79 ms	14052 KB	Output is correct
54	Correct	1 ms	324 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	1 ms	332 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	2 ms	332 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	332 KB	Output is correct
61	Correct	1 ms	332 KB	Output is correct
62	Correct	1 ms	332 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	4 ms	972 KB	Output is correct
66	Correct	4 ms	972 KB	Output is correct
67	Correct	5 ms	912 KB	Output is correct
68	Correct	5 ms	972 KB	Output is correct
69	Correct	6 ms	976 KB	Output is correct
70	Correct	6 ms	972 KB	Output is correct
71	Correct	4 ms	972 KB	Output is correct
72	Correct	5 ms	972 KB	Output is correct
73	Correct	5 ms	972 KB	Output is correct
74	Correct	4 ms	972 KB	Output is correct
75	Correct	4 ms	972 KB	Output is correct
76	Correct	5 ms	972 KB	Output is correct
77	Correct	5 ms	972 KB	Output is correct
78	Correct	1 ms	332 KB	Output is correct
79	Correct	85 ms	14600 KB	Output is correct
80	Correct	82 ms	14504 KB	Output is correct
81	Correct	135 ms	14340 KB	Output is correct
82	Correct	155 ms	14704 KB	Output is correct
83	Correct	161 ms	14676 KB	Output is correct
84	Correct	93 ms	14208 KB	Output is correct
85	Correct	105 ms	14024 KB	Output is correct
86	Correct	179 ms	14532 KB	Output is correct
87	Correct	104 ms	14152 KB	Output is correct
88	Correct	108 ms	14792 KB	Output is correct
89	Correct	124 ms	14828 KB	Output is correct
90	Correct	115 ms	14828 KB	Output is correct
91	Correct	141 ms	14656 KB	Output is correct
92	Correct	144 ms	14340 KB	Output is correct
93	Correct	161 ms	14760 KB	Output is correct
94	Correct	137 ms	14580 KB	Output is correct
95	Correct	117 ms	14368 KB	Output is correct
96	Correct	169 ms	14648 KB	Output is correct
97	Correct	187 ms	14656 KB	Output is correct
98	Correct	167 ms	14636 KB	Output is correct
99	Correct	1 ms	332 KB	Output is correct
100	Correct	1 ms	332 KB	Output is correct
101	Correct	1 ms	332 KB	Output is correct
102	Correct	1 ms	332 KB	Output is correct
103	Correct	1 ms	332 KB	Output is correct
104	Correct	1 ms	332 KB	Output is correct
105	Correct	1 ms	332 KB	Output is correct
106	Correct	1 ms	460 KB	Output is correct
107	Correct	1 ms	316 KB	Output is correct
108	Correct	1 ms	452 KB	Output is correct
109	Correct	1 ms	452 KB	Output is correct
110	Correct	1 ms	332 KB	Output is correct
111	Correct	702 ms	78660 KB	Output is correct
112	Correct	668 ms	78296 KB	Output is correct
113	Correct	738 ms	77152 KB	Output is correct
114	Correct	768 ms	75784 KB	Output is correct
115	Correct	769 ms	77320 KB	Output is correct
116	Correct	1495 ms	79648 KB	Output is correct
117	Correct	848 ms	78132 KB	Output is correct
118	Correct	5 ms	972 KB	Output is correct
119	Correct	4 ms	980 KB	Output is correct
120	Correct	6 ms	972 KB	Output is correct
121	Correct	5 ms	972 KB	Output is correct
122	Correct	6 ms	972 KB	Output is correct
123	Correct	5 ms	980 KB	Output is correct
124	Correct	4 ms	972 KB	Output is correct
125	Correct	5 ms	972 KB	Output is correct
126	Correct	5 ms	896 KB	Output is correct
127	Correct	4 ms	972 KB	Output is correct
128	Correct	4 ms	972 KB	Output is correct
129	Correct	5 ms	972 KB	Output is correct
130	Correct	6 ms	972 KB	Output is correct
131	Correct	1 ms	332 KB	Output is correct
132	Correct	90 ms	14560 KB	Output is correct
133	Correct	91 ms	14676 KB	Output is correct
134	Correct	134 ms	14404 KB	Output is correct
135	Correct	158 ms	14748 KB	Output is correct
136	Correct	159 ms	14660 KB	Output is correct
137	Correct	95 ms	14180 KB	Output is correct
138	Correct	92 ms	14060 KB	Output is correct
139	Correct	180 ms	14652 KB	Output is correct
140	Correct	83 ms	14060 KB	Output is correct
141	Correct	106 ms	14812 KB	Output is correct
142	Correct	127 ms	14840 KB	Output is correct
143	Correct	122 ms	14828 KB	Output is correct
144	Correct	139 ms	14632 KB	Output is correct
145	Correct	140 ms	14404 KB	Output is correct
146	Correct	162 ms	14748 KB	Output is correct
147	Correct	138 ms	14576 KB	Output is correct
148	Correct	115 ms	14276 KB	Output is correct
149	Correct	167 ms	14508 KB	Output is correct
150	Correct	196 ms	14660 KB	Output is correct
151	Correct	166 ms	14548 KB	Output is correct
152	Execution timed out	2101 ms	288376 KB	Time limit exceeded
153	Halted	0 ms	0 KB	-

답안 #433358

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 10.0 / 10.0

Subtask #3 20.0 / 20.0

Subtask #4 10.0 / 10.0

Subtask #5 25.0 / 25.0

Subtask #6 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
10.0 / 10.0

Subtask #3
20.0 / 20.0

Subtask #4
10.0 / 10.0

Subtask #5
25.0 / 25.0

Subtask #6
0 / 20.0