Submission #485626

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
485626	2021-11-08T15:44:53 Z	pooyashams	The short shank; Redemption (BOI21_prison)	C++14	100 / 100	1605 ms	318220 KB

prison

#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cassert>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 2e6+10;

int n, D, T;

vector<int> kids[maxn];
int stme[maxn];
int tmi[maxn];
int frit[maxn];
int par[maxn];
int init[maxn];
bool vis[maxn];
int tin[maxn];
int tout[maxn];
int inord[maxn];
int timer = 0;

struct seg
{
	int l, r;
	inline bool operator<(seg& b)
	{
		return l < b.l  or (l == b.l and r > b.r);
	}
	inline bool in(seg& b)
	{
		return b.l <= l and r <= b.r;
	}
} segs[maxn];

void dfs(int v, int h)
{
	init[v] = h;
	tin[v] = timer++;
	inord[tin[v]] = v;
	for(int u: kids[v])
		dfs(u, h+1);
	tout[v] = timer;
}

struct lzst
{
	vector<int> vals; // max
	vector<int> vidx; // max index
	vector<int> lazy;
	int n;
	lzst(int len)
	{
		vals = vector<int>(len * 4, 0);
		vidx = vector<int>(len * 4, 0);
		lazy = vector<int>(len * 4, 0);
		n = len;
		build(0, len, 1);
	}
	inline void upd(int v)
	{
		vals[v] = max(vals[2*v], vals[2*v+1]);
		if(vals[v] == vals[2*v])
			vidx[v] = vidx[2*v];
		else
			vidx[v] = vidx[2*v+1];
	}
	inline void put(int x, int v)
	{
		vals[v] += x;
		lazy[v] += x;
	}
	inline void shift(int v)
	{
		if(lazy[v] == 0) return;
		put(lazy[v], 2*v);
		put(lazy[v], 2*v+1);
		lazy[v] = 0;
	}
	void build(int l, int r, int v)
	{
		if(r - l == 1)
		{
			vals[v] = init[inord[l]];
			vidx[v] = inord[l];
			lazy[v] = 0;
			return;
		}
		int m = (l+r) / 2;
		build(l, m, 2*v);
		build(m, r, 2*v+1);
		upd(v);
	}
	void _add(int l, int r, int s, int e, int x, int v)
	{
		if(e <= l or r <= s) return;
		if(s <= l and r <= e) return put(x, v);
		int m = (l+r) / 2;
		shift(v);
		_add(l, m, s, e, x, 2*v);
		_add(m, r, s, e, x, 2*v+1);
		upd(v);
	}
	inline void add(int s, int e, int x)
	{
		_add(0, n, s, e, x, 1);
	}
};

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> D >> T;
	stack<int> st;
	int scnt = 0;
	segs[scnt++] = {0, n};
	int rem = n+1;
	for(int i = 0; i < n; i++)
	{
		cin >> stme[i];
		tmi[i] = stme[i] - i;
		st.push(i);
		while(!st.empty() and tmi[st.top()] > T-i)
			st.pop();
		if(st.empty())
		{
			frit[i] = i;
			rem--;
		}
		else
			frit[i] = st.top();
		if(frit[i] != i)
			segs[scnt++] = {frit[i], i};
		//cerr << "frit[" << i << "]: " << frit[i] << endl;
	}
	sort(segs, segs+scnt);
	//for(int i = 0; i < scnt; i++) cerr << i << ": " << segs[i].l << " " << segs[i].r << endl; cerr << endl;
	int lst = 0;
	par[0] = -1;
	for(int i = 1; i < scnt; i++)
	{
		while(!segs[i].in(segs[lst]))
			lst = par[lst];
		par[i] = lst;
		kids[lst].push_back(i);
		lst = i;
		//cerr << "par[" << i << "]: " << par[i] << endl;
	}
	dfs(0, 1);
	//for(int i = 0; i < scnt; i++) assert(tin[i] == i);
	lzst mf(scnt);
	//cerr << rem << endl;
	//for(int i = 0; i < 15; i++) cerr << mf.vals[i] << " "; cerr << endl << endl;
	while(D--)
	{
		int v = mf.vidx[1];
		//cerr << v << endl;
		while(v != -1 and !vis[v])
		{
			mf.add(tin[v], tout[v], -1);
			vis[v] = true;
			rem--;
			v = par[v];
		}
	}
	cout << rem << endl;
	return 0;
}

Subtask #1

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	47268 KB	Output is correct
2	Correct	21 ms	47308 KB	Output is correct
3	Correct	21 ms	47324 KB	Output is correct
4	Correct	21 ms	47304 KB	Output is correct
5	Correct	22 ms	47316 KB	Output is correct
6	Correct	23 ms	47304 KB	Output is correct
7	Correct	22 ms	47308 KB	Output is correct
8	Correct	22 ms	47288 KB	Output is correct
9	Correct	22 ms	47320 KB	Output is correct
10	Correct	21 ms	47300 KB	Output is correct
11	Correct	21 ms	47308 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	47240 KB	Output is correct
2	Correct	103 ms	77232 KB	Output is correct
3	Correct	92 ms	74320 KB	Output is correct
4	Correct	115 ms	83552 KB	Output is correct
5	Correct	100 ms	87356 KB	Output is correct
6	Correct	124 ms	78964 KB	Output is correct
7	Correct	414 ms	133828 KB	Output is correct
8	Correct	124 ms	83528 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	47268 KB	Output is correct
2	Correct	21 ms	47308 KB	Output is correct
3	Correct	21 ms	47324 KB	Output is correct
4	Correct	21 ms	47304 KB	Output is correct
5	Correct	22 ms	47316 KB	Output is correct
6	Correct	23 ms	47304 KB	Output is correct
7	Correct	22 ms	47308 KB	Output is correct
8	Correct	22 ms	47288 KB	Output is correct
9	Correct	22 ms	47320 KB	Output is correct
10	Correct	21 ms	47300 KB	Output is correct
11	Correct	21 ms	47308 KB	Output is correct
12	Correct	21 ms	47268 KB	Output is correct
13	Correct	24 ms	47436 KB	Output is correct
14	Correct	23 ms	47344 KB	Output is correct
15	Correct	22 ms	47336 KB	Output is correct
16	Correct	23 ms	47380 KB	Output is correct
17	Correct	22 ms	47300 KB	Output is correct
18	Correct	21 ms	47376 KB	Output is correct
19	Correct	24 ms	47336 KB	Output is correct
20	Correct	22 ms	47308 KB	Output is correct
21	Correct	23 ms	47304 KB	Output is correct
22	Correct	21 ms	47308 KB	Output is correct
23	Correct	22 ms	47576 KB	Output is correct
24	Correct	23 ms	47564 KB	Output is correct
25	Correct	23 ms	47800 KB	Output is correct
26	Correct	23 ms	47564 KB	Output is correct
27	Correct	23 ms	47672 KB	Output is correct
28	Correct	23 ms	47564 KB	Output is correct
29	Correct	23 ms	47580 KB	Output is correct
30	Correct	22 ms	47540 KB	Output is correct
31	Correct	23 ms	47544 KB	Output is correct
32	Correct	23 ms	47484 KB	Output is correct
33	Correct	24 ms	47564 KB	Output is correct
34	Correct	24 ms	47692 KB	Output is correct
35	Correct	23 ms	47612 KB	Output is correct

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	47308 KB	Output is correct
2	Correct	36 ms	52816 KB	Output is correct
3	Correct	35 ms	52628 KB	Output is correct
4	Correct	45 ms	55428 KB	Output is correct
5	Correct	50 ms	56764 KB	Output is correct
6	Correct	49 ms	57032 KB	Output is correct
7	Correct	37 ms	51916 KB	Output is correct
8	Correct	36 ms	51660 KB	Output is correct
9	Correct	73 ms	60228 KB	Output is correct
10	Correct	31 ms	51532 KB	Output is correct

Subtask #5

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	47268 KB	Output is correct
2	Correct	21 ms	47308 KB	Output is correct
3	Correct	21 ms	47324 KB	Output is correct
4	Correct	21 ms	47304 KB	Output is correct
5	Correct	22 ms	47316 KB	Output is correct
6	Correct	23 ms	47304 KB	Output is correct
7	Correct	22 ms	47308 KB	Output is correct
8	Correct	22 ms	47288 KB	Output is correct
9	Correct	22 ms	47320 KB	Output is correct
10	Correct	21 ms	47300 KB	Output is correct
11	Correct	21 ms	47308 KB	Output is correct
12	Correct	21 ms	47268 KB	Output is correct
13	Correct	24 ms	47436 KB	Output is correct
14	Correct	23 ms	47344 KB	Output is correct
15	Correct	22 ms	47336 KB	Output is correct
16	Correct	23 ms	47380 KB	Output is correct
17	Correct	22 ms	47300 KB	Output is correct
18	Correct	21 ms	47376 KB	Output is correct
19	Correct	24 ms	47336 KB	Output is correct
20	Correct	22 ms	47308 KB	Output is correct
21	Correct	23 ms	47304 KB	Output is correct
22	Correct	21 ms	47308 KB	Output is correct
23	Correct	22 ms	47576 KB	Output is correct
24	Correct	23 ms	47564 KB	Output is correct
25	Correct	23 ms	47800 KB	Output is correct
26	Correct	23 ms	47564 KB	Output is correct
27	Correct	23 ms	47672 KB	Output is correct
28	Correct	23 ms	47564 KB	Output is correct
29	Correct	23 ms	47580 KB	Output is correct
30	Correct	22 ms	47540 KB	Output is correct
31	Correct	23 ms	47544 KB	Output is correct
32	Correct	23 ms	47484 KB	Output is correct
33	Correct	24 ms	47564 KB	Output is correct
34	Correct	24 ms	47692 KB	Output is correct
35	Correct	23 ms	47612 KB	Output is correct
36	Correct	22 ms	47308 KB	Output is correct
37	Correct	36 ms	52816 KB	Output is correct
38	Correct	35 ms	52628 KB	Output is correct
39	Correct	45 ms	55428 KB	Output is correct
40	Correct	50 ms	56764 KB	Output is correct
41	Correct	49 ms	57032 KB	Output is correct
42	Correct	37 ms	51916 KB	Output is correct
43	Correct	36 ms	51660 KB	Output is correct
44	Correct	73 ms	60228 KB	Output is correct
45	Correct	31 ms	51532 KB	Output is correct
46	Correct	22 ms	47252 KB	Output is correct
47	Correct	21 ms	47308 KB	Output is correct
48	Correct	23 ms	47292 KB	Output is correct
49	Correct	22 ms	47392 KB	Output is correct
50	Correct	22 ms	47296 KB	Output is correct
51	Correct	22 ms	47300 KB	Output is correct
52	Correct	22 ms	47280 KB	Output is correct
53	Correct	22 ms	47352 KB	Output is correct
54	Correct	22 ms	47308 KB	Output is correct
55	Correct	22 ms	47308 KB	Output is correct
56	Correct	23 ms	47284 KB	Output is correct
57	Correct	23 ms	47684 KB	Output is correct
58	Correct	23 ms	47628 KB	Output is correct
59	Correct	23 ms	47644 KB	Output is correct
60	Correct	24 ms	47600 KB	Output is correct
61	Correct	23 ms	47684 KB	Output is correct
62	Correct	23 ms	47524 KB	Output is correct
63	Correct	22 ms	47684 KB	Output is correct
64	Correct	23 ms	47508 KB	Output is correct
65	Correct	23 ms	47528 KB	Output is correct
66	Correct	22 ms	47548 KB	Output is correct
67	Correct	23 ms	47504 KB	Output is correct
68	Correct	24 ms	47652 KB	Output is correct
69	Correct	23 ms	47604 KB	Output is correct
70	Correct	21 ms	47324 KB	Output is correct
71	Correct	36 ms	53460 KB	Output is correct
72	Correct	34 ms	52548 KB	Output is correct
73	Correct	47 ms	55628 KB	Output is correct
74	Correct	49 ms	56868 KB	Output is correct
75	Correct	50 ms	57132 KB	Output is correct
76	Correct	41 ms	52024 KB	Output is correct
77	Correct	38 ms	51660 KB	Output is correct
78	Correct	91 ms	60216 KB	Output is correct
79	Correct	34 ms	51532 KB	Output is correct
80	Correct	43 ms	52556 KB	Output is correct
81	Correct	46 ms	53556 KB	Output is correct
82	Correct	43 ms	52540 KB	Output is correct
83	Correct	53 ms	54724 KB	Output is correct
84	Correct	46 ms	53060 KB	Output is correct
85	Correct	53 ms	57668 KB	Output is correct
86	Correct	49 ms	53636 KB	Output is correct
87	Correct	44 ms	51464 KB	Output is correct
88	Correct	68 ms	58108 KB	Output is correct
89	Correct	69 ms	59704 KB	Output is correct
90	Correct	66 ms	57156 KB	Output is correct

Subtask #6

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	47268 KB	Output is correct
2	Correct	21 ms	47308 KB	Output is correct
3	Correct	21 ms	47324 KB	Output is correct
4	Correct	21 ms	47304 KB	Output is correct
5	Correct	22 ms	47316 KB	Output is correct
6	Correct	23 ms	47304 KB	Output is correct
7	Correct	22 ms	47308 KB	Output is correct
8	Correct	22 ms	47288 KB	Output is correct
9	Correct	22 ms	47320 KB	Output is correct
10	Correct	21 ms	47300 KB	Output is correct
11	Correct	21 ms	47308 KB	Output is correct
12	Correct	21 ms	47240 KB	Output is correct
13	Correct	103 ms	77232 KB	Output is correct
14	Correct	92 ms	74320 KB	Output is correct
15	Correct	115 ms	83552 KB	Output is correct
16	Correct	100 ms	87356 KB	Output is correct
17	Correct	124 ms	78964 KB	Output is correct
18	Correct	414 ms	133828 KB	Output is correct
19	Correct	124 ms	83528 KB	Output is correct
20	Correct	21 ms	47268 KB	Output is correct
21	Correct	24 ms	47436 KB	Output is correct
22	Correct	23 ms	47344 KB	Output is correct
23	Correct	22 ms	47336 KB	Output is correct
24	Correct	23 ms	47380 KB	Output is correct
25	Correct	22 ms	47300 KB	Output is correct
26	Correct	21 ms	47376 KB	Output is correct
27	Correct	24 ms	47336 KB	Output is correct
28	Correct	22 ms	47308 KB	Output is correct
29	Correct	23 ms	47304 KB	Output is correct
30	Correct	21 ms	47308 KB	Output is correct
31	Correct	22 ms	47576 KB	Output is correct
32	Correct	23 ms	47564 KB	Output is correct
33	Correct	23 ms	47800 KB	Output is correct
34	Correct	23 ms	47564 KB	Output is correct
35	Correct	23 ms	47672 KB	Output is correct
36	Correct	23 ms	47564 KB	Output is correct
37	Correct	23 ms	47580 KB	Output is correct
38	Correct	22 ms	47540 KB	Output is correct
39	Correct	23 ms	47544 KB	Output is correct
40	Correct	23 ms	47484 KB	Output is correct
41	Correct	24 ms	47564 KB	Output is correct
42	Correct	24 ms	47692 KB	Output is correct
43	Correct	23 ms	47612 KB	Output is correct
44	Correct	22 ms	47308 KB	Output is correct
45	Correct	36 ms	52816 KB	Output is correct
46	Correct	35 ms	52628 KB	Output is correct
47	Correct	45 ms	55428 KB	Output is correct
48	Correct	50 ms	56764 KB	Output is correct
49	Correct	49 ms	57032 KB	Output is correct
50	Correct	37 ms	51916 KB	Output is correct
51	Correct	36 ms	51660 KB	Output is correct
52	Correct	73 ms	60228 KB	Output is correct
53	Correct	31 ms	51532 KB	Output is correct
54	Correct	22 ms	47252 KB	Output is correct
55	Correct	21 ms	47308 KB	Output is correct
56	Correct	23 ms	47292 KB	Output is correct
57	Correct	22 ms	47392 KB	Output is correct
58	Correct	22 ms	47296 KB	Output is correct
59	Correct	22 ms	47300 KB	Output is correct
60	Correct	22 ms	47280 KB	Output is correct
61	Correct	22 ms	47352 KB	Output is correct
62	Correct	22 ms	47308 KB	Output is correct
63	Correct	22 ms	47308 KB	Output is correct
64	Correct	23 ms	47284 KB	Output is correct
65	Correct	23 ms	47684 KB	Output is correct
66	Correct	23 ms	47628 KB	Output is correct
67	Correct	23 ms	47644 KB	Output is correct
68	Correct	24 ms	47600 KB	Output is correct
69	Correct	23 ms	47684 KB	Output is correct
70	Correct	23 ms	47524 KB	Output is correct
71	Correct	22 ms	47684 KB	Output is correct
72	Correct	23 ms	47508 KB	Output is correct
73	Correct	23 ms	47528 KB	Output is correct
74	Correct	22 ms	47548 KB	Output is correct
75	Correct	23 ms	47504 KB	Output is correct
76	Correct	24 ms	47652 KB	Output is correct
77	Correct	23 ms	47604 KB	Output is correct
78	Correct	21 ms	47324 KB	Output is correct
79	Correct	36 ms	53460 KB	Output is correct
80	Correct	34 ms	52548 KB	Output is correct
81	Correct	47 ms	55628 KB	Output is correct
82	Correct	49 ms	56868 KB	Output is correct
83	Correct	50 ms	57132 KB	Output is correct
84	Correct	41 ms	52024 KB	Output is correct
85	Correct	38 ms	51660 KB	Output is correct
86	Correct	91 ms	60216 KB	Output is correct
87	Correct	34 ms	51532 KB	Output is correct
88	Correct	43 ms	52556 KB	Output is correct
89	Correct	46 ms	53556 KB	Output is correct
90	Correct	43 ms	52540 KB	Output is correct
91	Correct	53 ms	54724 KB	Output is correct
92	Correct	46 ms	53060 KB	Output is correct
93	Correct	53 ms	57668 KB	Output is correct
94	Correct	49 ms	53636 KB	Output is correct
95	Correct	44 ms	51464 KB	Output is correct
96	Correct	68 ms	58108 KB	Output is correct
97	Correct	69 ms	59704 KB	Output is correct
98	Correct	66 ms	57156 KB	Output is correct
99	Correct	22 ms	47276 KB	Output is correct
100	Correct	20 ms	47284 KB	Output is correct
101	Correct	21 ms	47348 KB	Output is correct
102	Correct	21 ms	47312 KB	Output is correct
103	Correct	23 ms	47296 KB	Output is correct
104	Correct	24 ms	47308 KB	Output is correct
105	Correct	24 ms	47380 KB	Output is correct
106	Correct	22 ms	47308 KB	Output is correct
107	Correct	23 ms	47360 KB	Output is correct
108	Correct	22 ms	47380 KB	Output is correct
109	Correct	22 ms	47308 KB	Output is correct
110	Correct	25 ms	47312 KB	Output is correct
111	Correct	106 ms	82116 KB	Output is correct
112	Correct	105 ms	74300 KB	Output is correct
113	Correct	120 ms	83664 KB	Output is correct
114	Correct	103 ms	87348 KB	Output is correct
115	Correct	135 ms	78944 KB	Output is correct
116	Correct	416 ms	133780 KB	Output is correct
117	Correct	129 ms	83456 KB	Output is correct
118	Correct	23 ms	47692 KB	Output is correct
119	Correct	23 ms	47552 KB	Output is correct
120	Correct	27 ms	47680 KB	Output is correct
121	Correct	25 ms	47552 KB	Output is correct
122	Correct	23 ms	47556 KB	Output is correct
123	Correct	22 ms	47564 KB	Output is correct
124	Correct	23 ms	47692 KB	Output is correct
125	Correct	23 ms	47596 KB	Output is correct
126	Correct	23 ms	47564 KB	Output is correct
127	Correct	23 ms	47564 KB	Output is correct
128	Correct	25 ms	47596 KB	Output is correct
129	Correct	23 ms	47692 KB	Output is correct
130	Correct	23 ms	47632 KB	Output is correct
131	Correct	21 ms	47308 KB	Output is correct
132	Correct	36 ms	53484 KB	Output is correct
133	Correct	35 ms	52556 KB	Output is correct
134	Correct	45 ms	55492 KB	Output is correct
135	Correct	49 ms	56744 KB	Output is correct
136	Correct	51 ms	57084 KB	Output is correct
137	Correct	36 ms	52028 KB	Output is correct
138	Correct	39 ms	51560 KB	Output is correct
139	Correct	77 ms	60200 KB	Output is correct
140	Correct	31 ms	51520 KB	Output is correct
141	Correct	39 ms	52548 KB	Output is correct
142	Correct	47 ms	53552 KB	Output is correct
143	Correct	42 ms	52580 KB	Output is correct
144	Correct	53 ms	54728 KB	Output is correct
145	Correct	48 ms	53068 KB	Output is correct
146	Correct	52 ms	57668 KB	Output is correct
147	Correct	48 ms	53596 KB	Output is correct
148	Correct	40 ms	51484 KB	Output is correct
149	Correct	72 ms	58036 KB	Output is correct
150	Correct	70 ms	59740 KB	Output is correct
151	Correct	63 ms	57088 KB	Output is correct
152	Correct	382 ms	187412 KB	Output is correct
153	Correct	377 ms	197120 KB	Output is correct
154	Correct	346 ms	179472 KB	Output is correct
155	Correct	703 ms	233416 KB	Output is correct
156	Correct	652 ms	208312 KB	Output is correct
157	Correct	320 ms	142532 KB	Output is correct
158	Correct	526 ms	188588 KB	Output is correct
159	Correct	1605 ms	318220 KB	Output is correct
160	Correct	1296 ms	301632 KB	Output is correct
161	Correct	438 ms	143872 KB	Output is correct
162	Correct	380 ms	147460 KB	Output is correct