Submission #957783

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
957783	2024-04-04T10:20:56 Z	ono_de206	Vinjete (COI22_vinjete)	C++14	69 / 100	321 ms	309432 KB

Main

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

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 1e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523;//, N = 2500;
const long long inf = 2e18 + 10;
vector<tuple<int, int, int>> g[mxn];
int N, T, n, m, sg[mxn], root[mxn], ans[mxn], lch[mxn * 120], rch[mxn * 120];

struct node {
	int mn, cnt, sum;
	node(int _mn = 0, int _cnt = 0, int _sum = 0) : mn(_mn), cnt(_cnt), sum(_sum) {}
} d[mxn * 120];

node operator+(const node &a, const node &b) {
	node ret;
	ret.mn = min(a.mn, b.mn + a.sum);
	ret.sum = a.sum + b.sum;
	if(ret.mn == a.mn) ret.cnt += a.cnt;
	if(ret.mn == b.mn + a.sum) ret.cnt += b.cnt;
	return ret;
}

int build(int l, int r) {
	int save = ++T;
	if(l < r) {
		int m = (l + r) / 2;
		lch[save] = build(l, m);
		rch[save] = build(m + 1, r);
		d[save] = d[lch[save]] + d[rch[save]];
	} else {
		d[save].cnt = sg[l];
	}
	return save;
}

int update(int l, int r, int i, int x, int y) {
	int save = ++T;
	if(l == r) {
		d[save] = d[i];
		d[save].mn += y;
		d[save].sum += y;
		return save;
	}
	int m = (l + r) / 2;
	if(x <= m) {
		lch[save] = update(l, m, lch[i], x, y);
		rch[save] = rch[i];
	} else {
		lch[save] = lch[i];
		rch[save] = update(m + 1, r, rch[i], x, y);
	}
	d[save] = d[lch[save]] + d[rch[save]];
	return save;
}

void dfs(int to, int fr) {
	for(auto it : g[to]) {
		int x, ll, rr;
		tie(x, ll, rr) = it;
		if(x == fr) continue;
		root[x] = update(1, N, root[to], ll, 1);
		if(rr + 1 <= N) root[x] = update(1, N, root[x], rr + 1, -1);
		if(d[root[x]].mn != 0) ans[x] = m;
		else ans[x] = m - d[root[x]].cnt;
		dfs(x, to);
	}
}

void go() {
	cin >> n >> m;
	vector<tuple<int, int, int, int>> edges;
	vector<pair<int, int>> v, inters;
	v.eb(1, 0);
	v.eb(m, 1);
	for(int i = 1; i < n; i++) {
		int x, y, ll, rr;
		cin >> x >> y >> ll >> rr;
		edges.eb(x, y, ll, rr);
		v.eb(ll, 0);
		v.eb(rr, 1);
	}
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	int ls = 1;
	for(auto it : v) {
		int l = ls, r = (it.ss == 0 ? it.ff - 1 : it.ff);
		if(l <= r) inters.eb(l, r);
		ls = r + 1;
	}
	N = inters.size();
	for(int i = 1; i <= N; i++) {
		sg[i] = inters[i - 1].ss - inters[i - 1].ff + 1;
	}
	for(auto it : edges) {
		int x, y, ll, rr;
		tie(x, y, ll, rr) = it;
		// cout << ll << ' ' << rr << " ----> ";
		ll = lower_bound(all(inters), make_pair(ll, 0)) - inters.begin() + 1;
		rr = lower_bound(all(inters), make_pair(rr, mod)) - inters.begin();
		// cout << ll << ' ' << rr << " here\n";
		g[x].eb(y, ll, rr);
		g[y].eb(x, ll, rr);
	}
	root[1] = build(1, N);
	dfs(1, 0);
	for(int i = 2; i <= n; i++) {
		cout << ans[i] << endl;
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	148560 KB	Output is correct
2	Correct	34 ms	148656 KB	Output is correct
3	Correct	30 ms	148568 KB	Output is correct
4	Correct	30 ms	148564 KB	Output is correct
5	Correct	30 ms	148560 KB	Output is correct
6	Correct	30 ms	148568 KB	Output is correct
7	Correct	32 ms	148308 KB	Output is correct
8	Correct	28 ms	148304 KB	Output is correct
9	Correct	32 ms	148572 KB	Output is correct
10	Correct	31 ms	148564 KB	Output is correct
11	Correct	30 ms	148576 KB	Output is correct
12	Correct	30 ms	148560 KB	Output is correct
13	Correct	30 ms	148564 KB	Output is correct
14	Correct	30 ms	148496 KB	Output is correct
15	Correct	29 ms	148316 KB	Output is correct
16	Correct	27 ms	148436 KB	Output is correct
17	Correct	30 ms	148564 KB	Output is correct
18	Correct	32 ms	148596 KB	Output is correct
19	Correct	30 ms	148564 KB	Output is correct
20	Correct	30 ms	148572 KB	Output is correct
21	Correct	30 ms	148564 KB	Output is correct
22	Correct	30 ms	148564 KB	Output is correct
23	Correct	29 ms	148316 KB	Output is correct
24	Correct	28 ms	148452 KB	Output is correct

Subtask #2
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	148560 KB	Output is correct
2	Correct	34 ms	148656 KB	Output is correct
3	Correct	30 ms	148568 KB	Output is correct
4	Correct	30 ms	148564 KB	Output is correct
5	Correct	30 ms	148560 KB	Output is correct
6	Correct	30 ms	148568 KB	Output is correct
7	Correct	32 ms	148308 KB	Output is correct
8	Correct	28 ms	148304 KB	Output is correct
9	Correct	32 ms	148572 KB	Output is correct
10	Correct	31 ms	148564 KB	Output is correct
11	Correct	30 ms	148576 KB	Output is correct
12	Correct	30 ms	148560 KB	Output is correct
13	Correct	30 ms	148564 KB	Output is correct
14	Correct	30 ms	148496 KB	Output is correct
15	Correct	29 ms	148316 KB	Output is correct
16	Correct	27 ms	148436 KB	Output is correct
17	Correct	30 ms	148564 KB	Output is correct
18	Correct	32 ms	148596 KB	Output is correct
19	Correct	30 ms	148564 KB	Output is correct
20	Correct	30 ms	148572 KB	Output is correct
21	Correct	30 ms	148564 KB	Output is correct
22	Correct	30 ms	148564 KB	Output is correct
23	Correct	29 ms	148316 KB	Output is correct
24	Correct	28 ms	148452 KB	Output is correct
25	Correct	31 ms	148456 KB	Output is correct
26	Correct	33 ms	148564 KB	Output is correct
27	Correct	30 ms	148564 KB	Output is correct
28	Correct	30 ms	148536 KB	Output is correct
29	Correct	36 ms	148564 KB	Output is correct
30	Correct	30 ms	148568 KB	Output is correct
31	Correct	31 ms	148568 KB	Output is correct
32	Correct	30 ms	148564 KB	Output is correct
33	Correct	30 ms	148560 KB	Output is correct
34	Correct	30 ms	148572 KB	Output is correct
35	Correct	30 ms	148564 KB	Output is correct
36	Correct	31 ms	148560 KB	Output is correct
37	Correct	31 ms	148564 KB	Output is correct
38	Correct	30 ms	148452 KB	Output is correct
39	Correct	30 ms	148564 KB	Output is correct
40	Correct	30 ms	148580 KB	Output is correct
41	Correct	30 ms	148564 KB	Output is correct
42	Correct	30 ms	148564 KB	Output is correct
43	Correct	35 ms	148564 KB	Output is correct
44	Correct	30 ms	148560 KB	Output is correct
45	Correct	30 ms	148572 KB	Output is correct
46	Correct	30 ms	148588 KB	Output is correct
47	Correct	32 ms	148572 KB	Output is correct
48	Correct	31 ms	148568 KB	Output is correct
49	Correct	30 ms	148488 KB	Output is correct
50	Correct	30 ms	148572 KB	Output is correct

Subtask #3
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	148560 KB	Output is correct
2	Correct	34 ms	148656 KB	Output is correct
3	Correct	30 ms	148568 KB	Output is correct
4	Correct	30 ms	148564 KB	Output is correct
5	Correct	30 ms	148560 KB	Output is correct
6	Correct	30 ms	148568 KB	Output is correct
7	Correct	32 ms	148308 KB	Output is correct
8	Correct	28 ms	148304 KB	Output is correct
9	Correct	32 ms	148572 KB	Output is correct
10	Correct	31 ms	148564 KB	Output is correct
11	Correct	30 ms	148576 KB	Output is correct
12	Correct	30 ms	148560 KB	Output is correct
13	Correct	30 ms	148564 KB	Output is correct
14	Correct	30 ms	148496 KB	Output is correct
15	Correct	29 ms	148316 KB	Output is correct
16	Correct	27 ms	148436 KB	Output is correct
17	Correct	30 ms	148564 KB	Output is correct
18	Correct	32 ms	148596 KB	Output is correct
19	Correct	30 ms	148564 KB	Output is correct
20	Correct	30 ms	148572 KB	Output is correct
21	Correct	30 ms	148564 KB	Output is correct
22	Correct	30 ms	148564 KB	Output is correct
23	Correct	29 ms	148316 KB	Output is correct
24	Correct	28 ms	148452 KB	Output is correct
25	Correct	113 ms	158472 KB	Output is correct
26	Correct	99 ms	158368 KB	Output is correct
27	Correct	133 ms	167200 KB	Output is correct
28	Correct	155 ms	166840 KB	Output is correct
29	Correct	127 ms	166848 KB	Output is correct
30	Correct	124 ms	166756 KB	Output is correct
31	Correct	38 ms	149216 KB	Output is correct
32	Correct	38 ms	149220 KB	Output is correct
33	Correct	38 ms	149332 KB	Output is correct
34	Correct	38 ms	149340 KB	Output is correct
35	Correct	100 ms	156004 KB	Output is correct
36	Correct	102 ms	156088 KB	Output is correct
37	Correct	126 ms	164452 KB	Output is correct
38	Correct	128 ms	164540 KB	Output is correct
39	Correct	125 ms	164472 KB	Output is correct
40	Correct	147 ms	164756 KB	Output is correct
41	Correct	37 ms	148980 KB	Output is correct
42	Correct	37 ms	149072 KB	Output is correct
43	Correct	102 ms	155836 KB	Output is correct
44	Correct	101 ms	155836 KB	Output is correct
45	Correct	127 ms	164284 KB	Output is correct
46	Correct	125 ms	164288 KB	Output is correct
47	Correct	121 ms	164024 KB	Output is correct
48	Correct	130 ms	164156 KB	Output is correct
49	Correct	38 ms	148820 KB	Output is correct
50	Correct	39 ms	148844 KB	Output is correct

Subtask #4
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	148560 KB	Output is correct
2	Correct	34 ms	148656 KB	Output is correct
3	Correct	30 ms	148568 KB	Output is correct
4	Correct	30 ms	148564 KB	Output is correct
5	Correct	30 ms	148560 KB	Output is correct
6	Correct	30 ms	148568 KB	Output is correct
7	Correct	32 ms	148308 KB	Output is correct
8	Correct	28 ms	148304 KB	Output is correct
9	Correct	32 ms	148572 KB	Output is correct
10	Correct	31 ms	148564 KB	Output is correct
11	Correct	30 ms	148576 KB	Output is correct
12	Correct	30 ms	148560 KB	Output is correct
13	Correct	30 ms	148564 KB	Output is correct
14	Correct	30 ms	148496 KB	Output is correct
15	Correct	29 ms	148316 KB	Output is correct
16	Correct	27 ms	148436 KB	Output is correct
17	Correct	30 ms	148564 KB	Output is correct
18	Correct	32 ms	148596 KB	Output is correct
19	Correct	30 ms	148564 KB	Output is correct
20	Correct	30 ms	148572 KB	Output is correct
21	Correct	30 ms	148564 KB	Output is correct
22	Correct	30 ms	148564 KB	Output is correct
23	Correct	29 ms	148316 KB	Output is correct
24	Correct	28 ms	148452 KB	Output is correct
25	Correct	113 ms	158472 KB	Output is correct
26	Correct	99 ms	158368 KB	Output is correct
27	Correct	133 ms	167200 KB	Output is correct
28	Correct	155 ms	166840 KB	Output is correct
29	Correct	127 ms	166848 KB	Output is correct
30	Correct	124 ms	166756 KB	Output is correct
31	Correct	38 ms	149216 KB	Output is correct
32	Correct	38 ms	149220 KB	Output is correct
33	Correct	38 ms	149332 KB	Output is correct
34	Correct	38 ms	149340 KB	Output is correct
35	Correct	100 ms	156004 KB	Output is correct
36	Correct	102 ms	156088 KB	Output is correct
37	Correct	126 ms	164452 KB	Output is correct
38	Correct	128 ms	164540 KB	Output is correct
39	Correct	125 ms	164472 KB	Output is correct
40	Correct	147 ms	164756 KB	Output is correct
41	Correct	37 ms	148980 KB	Output is correct
42	Correct	37 ms	149072 KB	Output is correct
43	Correct	102 ms	155836 KB	Output is correct
44	Correct	101 ms	155836 KB	Output is correct
45	Correct	127 ms	164284 KB	Output is correct
46	Correct	125 ms	164288 KB	Output is correct
47	Correct	121 ms	164024 KB	Output is correct
48	Correct	130 ms	164156 KB	Output is correct
49	Correct	38 ms	148820 KB	Output is correct
50	Correct	39 ms	148844 KB	Output is correct
51	Correct	206 ms	175408 KB	Output is correct
52	Correct	214 ms	175544 KB	Output is correct
53	Correct	305 ms	192684 KB	Output is correct
54	Correct	316 ms	192584 KB	Output is correct
55	Correct	300 ms	192428 KB	Output is correct
56	Correct	321 ms	192532 KB	Output is correct
57	Correct	65 ms	155592 KB	Output is correct
58	Correct	70 ms	155708 KB	Output is correct
59	Correct	67 ms	155684 KB	Output is correct
60	Correct	68 ms	155604 KB	Output is correct
61	Correct	219 ms	169392 KB	Output is correct
62	Correct	218 ms	169820 KB	Output is correct
63	Correct	314 ms	186328 KB	Output is correct
64	Correct	312 ms	186356 KB	Output is correct
65	Correct	297 ms	186544 KB	Output is correct
66	Correct	287 ms	186192 KB	Output is correct
67	Correct	71 ms	154568 KB	Output is correct
68	Correct	67 ms	154336 KB	Output is correct
69	Correct	226 ms	168808 KB	Output is correct
70	Correct	218 ms	168624 KB	Output is correct
71	Correct	311 ms	185772 KB	Output is correct
72	Correct	308 ms	185824 KB	Output is correct
73	Correct	293 ms	185536 KB	Output is correct
74	Correct	285 ms	185432 KB	Output is correct
75	Correct	69 ms	154384 KB	Output is correct
76	Correct	71 ms	154364 KB	Output is correct

Subtask #5
0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	148560 KB	Output is correct
2	Correct	34 ms	148656 KB	Output is correct
3	Correct	30 ms	148568 KB	Output is correct
4	Correct	30 ms	148564 KB	Output is correct
5	Correct	30 ms	148560 KB	Output is correct
6	Correct	30 ms	148568 KB	Output is correct
7	Correct	32 ms	148308 KB	Output is correct
8	Correct	28 ms	148304 KB	Output is correct
9	Correct	32 ms	148572 KB	Output is correct
10	Correct	31 ms	148564 KB	Output is correct
11	Correct	30 ms	148576 KB	Output is correct
12	Correct	30 ms	148560 KB	Output is correct
13	Correct	30 ms	148564 KB	Output is correct
14	Correct	30 ms	148496 KB	Output is correct
15	Correct	29 ms	148316 KB	Output is correct
16	Correct	27 ms	148436 KB	Output is correct
17	Correct	30 ms	148564 KB	Output is correct
18	Correct	32 ms	148596 KB	Output is correct
19	Correct	30 ms	148564 KB	Output is correct
20	Correct	30 ms	148572 KB	Output is correct
21	Correct	30 ms	148564 KB	Output is correct
22	Correct	30 ms	148564 KB	Output is correct
23	Correct	29 ms	148316 KB	Output is correct
24	Correct	28 ms	148452 KB	Output is correct
25	Correct	31 ms	148456 KB	Output is correct
26	Correct	33 ms	148564 KB	Output is correct
27	Correct	30 ms	148564 KB	Output is correct
28	Correct	30 ms	148536 KB	Output is correct
29	Correct	36 ms	148564 KB	Output is correct
30	Correct	30 ms	148568 KB	Output is correct
31	Correct	31 ms	148568 KB	Output is correct
32	Correct	30 ms	148564 KB	Output is correct
33	Correct	30 ms	148560 KB	Output is correct
34	Correct	30 ms	148572 KB	Output is correct
35	Correct	30 ms	148564 KB	Output is correct
36	Correct	31 ms	148560 KB	Output is correct
37	Correct	31 ms	148564 KB	Output is correct
38	Correct	30 ms	148452 KB	Output is correct
39	Correct	30 ms	148564 KB	Output is correct
40	Correct	30 ms	148580 KB	Output is correct
41	Correct	30 ms	148564 KB	Output is correct
42	Correct	30 ms	148564 KB	Output is correct
43	Correct	35 ms	148564 KB	Output is correct
44	Correct	30 ms	148560 KB	Output is correct
45	Correct	30 ms	148572 KB	Output is correct
46	Correct	30 ms	148588 KB	Output is correct
47	Correct	32 ms	148572 KB	Output is correct
48	Correct	31 ms	148568 KB	Output is correct
49	Correct	30 ms	148488 KB	Output is correct
50	Correct	30 ms	148572 KB	Output is correct
51	Correct	113 ms	158472 KB	Output is correct
52	Correct	99 ms	158368 KB	Output is correct
53	Correct	133 ms	167200 KB	Output is correct
54	Correct	155 ms	166840 KB	Output is correct
55	Correct	127 ms	166848 KB	Output is correct
56	Correct	124 ms	166756 KB	Output is correct
57	Correct	38 ms	149216 KB	Output is correct
58	Correct	38 ms	149220 KB	Output is correct
59	Correct	38 ms	149332 KB	Output is correct
60	Correct	38 ms	149340 KB	Output is correct
61	Correct	100 ms	156004 KB	Output is correct
62	Correct	102 ms	156088 KB	Output is correct
63	Correct	126 ms	164452 KB	Output is correct
64	Correct	128 ms	164540 KB	Output is correct
65	Correct	125 ms	164472 KB	Output is correct
66	Correct	147 ms	164756 KB	Output is correct
67	Correct	37 ms	148980 KB	Output is correct
68	Correct	37 ms	149072 KB	Output is correct
69	Correct	102 ms	155836 KB	Output is correct
70	Correct	101 ms	155836 KB	Output is correct
71	Correct	127 ms	164284 KB	Output is correct
72	Correct	125 ms	164288 KB	Output is correct
73	Correct	121 ms	164024 KB	Output is correct
74	Correct	130 ms	164156 KB	Output is correct
75	Correct	38 ms	148820 KB	Output is correct
76	Correct	39 ms	148844 KB	Output is correct
77	Correct	206 ms	175408 KB	Output is correct
78	Correct	214 ms	175544 KB	Output is correct
79	Correct	305 ms	192684 KB	Output is correct
80	Correct	316 ms	192584 KB	Output is correct
81	Correct	300 ms	192428 KB	Output is correct
82	Correct	321 ms	192532 KB	Output is correct
83	Correct	65 ms	155592 KB	Output is correct
84	Correct	70 ms	155708 KB	Output is correct
85	Correct	67 ms	155684 KB	Output is correct
86	Correct	68 ms	155604 KB	Output is correct
87	Correct	219 ms	169392 KB	Output is correct
88	Correct	218 ms	169820 KB	Output is correct
89	Correct	314 ms	186328 KB	Output is correct
90	Correct	312 ms	186356 KB	Output is correct
91	Correct	297 ms	186544 KB	Output is correct
92	Correct	287 ms	186192 KB	Output is correct
93	Correct	71 ms	154568 KB	Output is correct
94	Correct	67 ms	154336 KB	Output is correct
95	Correct	226 ms	168808 KB	Output is correct
96	Correct	218 ms	168624 KB	Output is correct
97	Correct	311 ms	185772 KB	Output is correct
98	Correct	308 ms	185824 KB	Output is correct
99	Correct	293 ms	185536 KB	Output is correct
100	Correct	285 ms	185432 KB	Output is correct
101	Correct	69 ms	154384 KB	Output is correct
102	Correct	71 ms	154364 KB	Output is correct
103	Correct	214 ms	175944 KB	Output is correct
104	Correct	245 ms	175908 KB	Output is correct
105	Runtime error	195 ms	309432 KB	Execution killed with signal 11
106	Halted	0 ms	0 KB	-

Submission #957783

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 13.0 / 13.0

Subtask #3 16.0 / 16.0

Subtask #4 29.0 / 29.0

Subtask #5 0 / 31.0

Subtask #1
11.0 / 11.0

Subtask #2
13.0 / 13.0

Subtask #3
16.0 / 16.0

Subtask #4
29.0 / 29.0

Subtask #5
0 / 31.0