Submission #563723

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
563723	2022-05-18T04:03:47 Z	8e7	Swapping Cities (APIO20_swap)	C++17	37 / 100	2000 ms	23372 KB

swap

//Challenge: Accepted
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
struct edge{
	int u, v, w;
	edge(){u = v = w = 0;}
	edge(int a, int b, int c){u = a, v = b, w = c;}
};
vector<pii> ev[maxn]; //events
int valid[maxn];
struct DSU{
	int par[maxn], deg[maxn];
	bool mark[maxn];
	pii leaf[maxn];
	int ti;
	void init(int n) {
		for (int i = 0;i < n;i++) {
			ev[i].push_back({-1, i});
			par[i] = i, deg[i] = 0, mark[i] = 0, leaf[i] = {i, 0}; 
			valid[i] = 1<<30;
		}
		ti = 0;
	}
	int find(int a) {
		if (a == par[a]) return a;
		int ret = find(par[a]);
		if (ret != par[a]) ev[a].push_back({ti, ret});
		par[a] = ret;
		return ret;
	}
	void Union(int a, int b) {
		int pa = find(a), pb = find(b);
		deg[a]++, deg[b]++;
		if (deg[a] >= 3 || deg[b] >= 3 || mark[pa]) {
			valid[pb] = min(valid[pb], ti);
			mark[pb] = 1;
		}
		if (deg[a] == 1 && deg[b] == 1) {
			leaf[pb] = {a, b};
		} else {
			if (pa == pb && (leaf[pa] == make_pair(a, b) || leaf[pa] == make_pair(b, a))) {
				valid[pb] = min(valid[pb], ti);
				mark[pb] = 1;
			}
			if (pa != pb) {
				pii p;
				if (deg[leaf[pa].ff] == 1) p.ff = leaf[pa].ff;
				else p.ff = leaf[pa].ss;
				if (deg[leaf[pb].ff] == 1) p.ss = leaf[pb].ff;
				else p.ss = leaf[pb].ss;
				leaf[pb] = p;
			}
		}
		ev[pa].push_back({ti, pb});
		par[pa] = pb;
	}
} d;
vector<edge> ed;
int n, m;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
	n = N, m = M;
	for (int i = 0;i < m;i++) ed.push_back(edge(U[i], V[i], W[i]));
	sort(ed.begin(), ed.end(), [&] (edge x, edge y){return x.w < y.w;});
	d.init(n);
	for (int i = 0;i < m;i++) {
		d.Union(ed[i].u, ed[i].v);
		d.ti++;
	}
}
int pfind(int a, int ti) {
	int ind = upper_bound(ev[a].begin(), ev[a].end(), make_pair(ti, 1<<30)) - ev[a].begin() - 1;	
	if (ev[a][ind].ss == a) return a;
	return pfind(ev[a][ind].ss, ti);
}
int getMinimumFuelCapacity(int X, int Y) {
	int low = 0, up = m;
	while (low < up - 1) {
		int mid = (low + up) / 2;
		int vx = pfind(X, mid), vy = pfind(Y, mid);
		if (vx == vy && valid[vx] <= mid) up = mid;
		else low = mid;
	}
	if (up == m) return -1;
	else return ed[up].w;
}

Subtask #1
0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3412 KB	Output is correct
2	Correct	2 ms	3412 KB	Output is correct
3	Correct	2 ms	3412 KB	Output is correct
4	Correct	2 ms	3412 KB	Output is correct
5	Correct	2 ms	3480 KB	Output is correct
6	Correct	2 ms	3412 KB	Output is correct
7	Correct	2 ms	3540 KB	Output is correct
8	Correct	2 ms	3412 KB	Output is correct
9	Correct	48 ms	10500 KB	Output is correct
10	Correct	66 ms	12100 KB	Output is correct
11	Correct	63 ms	11964 KB	Output is correct
12	Correct	68 ms	12352 KB	Output is correct
13	Correct	133 ms	12728 KB	Output is correct
14	Correct	101 ms	10628 KB	Output is correct
15	Correct	620 ms	13932 KB	Output is correct
16	Correct	651 ms	13668 KB	Output is correct
17	Correct	630 ms	14144 KB	Output is correct
18	Execution timed out	2077 ms	14308 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3412 KB	Output is correct
2	Correct	2 ms	3412 KB	Output is correct
3	Execution timed out	2098 ms	14148 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #3
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3412 KB	Output is correct
2	Correct	2 ms	3412 KB	Output is correct
3	Correct	2 ms	3412 KB	Output is correct
4	Correct	2 ms	3412 KB	Output is correct
5	Correct	2 ms	3480 KB	Output is correct
6	Correct	2 ms	3412 KB	Output is correct
7	Correct	2 ms	3540 KB	Output is correct
8	Correct	2 ms	3412 KB	Output is correct
9	Correct	2 ms	3412 KB	Output is correct
10	Correct	3 ms	3540 KB	Output is correct
11	Correct	3 ms	3540 KB	Output is correct
12	Correct	3 ms	3412 KB	Output is correct
13	Correct	2 ms	3412 KB	Output is correct
14	Correct	2 ms	3412 KB	Output is correct
15	Correct	2 ms	3540 KB	Output is correct
16	Correct	2 ms	3540 KB	Output is correct
17	Correct	3 ms	3540 KB	Output is correct
18	Correct	2 ms	3540 KB	Output is correct
19	Correct	3 ms	3488 KB	Output is correct
20	Correct	3 ms	3540 KB	Output is correct
21	Correct	3 ms	3540 KB	Output is correct
22	Correct	3 ms	3540 KB	Output is correct
23	Correct	2 ms	3412 KB	Output is correct
24	Correct	3 ms	3540 KB	Output is correct
25	Correct	3 ms	3540 KB	Output is correct
26	Correct	3 ms	3540 KB	Output is correct
27	Correct	2 ms	3492 KB	Output is correct
28	Correct	3 ms	3540 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3412 KB	Output is correct
2	Correct	2 ms	3412 KB	Output is correct
3	Correct	2 ms	3412 KB	Output is correct
4	Correct	2 ms	3412 KB	Output is correct
5	Correct	2 ms	3412 KB	Output is correct
6	Correct	2 ms	3480 KB	Output is correct
7	Correct	2 ms	3412 KB	Output is correct
8	Correct	2 ms	3540 KB	Output is correct
9	Correct	2 ms	3412 KB	Output is correct
10	Correct	48 ms	10500 KB	Output is correct
11	Correct	66 ms	12100 KB	Output is correct
12	Correct	63 ms	11964 KB	Output is correct
13	Correct	68 ms	12352 KB	Output is correct
14	Correct	133 ms	12728 KB	Output is correct
15	Correct	3 ms	3540 KB	Output is correct
16	Correct	3 ms	3540 KB	Output is correct
17	Correct	3 ms	3412 KB	Output is correct
18	Correct	2 ms	3412 KB	Output is correct
19	Correct	2 ms	3412 KB	Output is correct
20	Correct	2 ms	3540 KB	Output is correct
21	Correct	2 ms	3540 KB	Output is correct
22	Correct	3 ms	3540 KB	Output is correct
23	Correct	2 ms	3540 KB	Output is correct
24	Correct	3 ms	3488 KB	Output is correct
25	Correct	3 ms	3540 KB	Output is correct
26	Correct	3 ms	3540 KB	Output is correct
27	Correct	3 ms	3540 KB	Output is correct
28	Correct	2 ms	3412 KB	Output is correct
29	Correct	3 ms	3540 KB	Output is correct
30	Correct	3 ms	3540 KB	Output is correct
31	Correct	3 ms	3540 KB	Output is correct
32	Correct	2 ms	3492 KB	Output is correct
33	Correct	3 ms	3540 KB	Output is correct
34	Correct	10 ms	4756 KB	Output is correct
35	Correct	69 ms	12344 KB	Output is correct
36	Correct	67 ms	12436 KB	Output is correct
37	Correct	72 ms	12416 KB	Output is correct
38	Correct	63 ms	12400 KB	Output is correct
39	Correct	68 ms	12404 KB	Output is correct
40	Correct	64 ms	11996 KB	Output is correct
41	Correct	66 ms	12416 KB	Output is correct
42	Correct	67 ms	12352 KB	Output is correct
43	Correct	100 ms	11388 KB	Output is correct
44	Correct	74 ms	13120 KB	Output is correct
45	Correct	134 ms	20224 KB	Output is correct
46	Correct	62 ms	12352 KB	Output is correct
47	Correct	68 ms	12740 KB	Output is correct
48	Correct	90 ms	16204 KB	Output is correct
49	Correct	63 ms	12452 KB	Output is correct
50	Correct	51 ms	11120 KB	Output is correct
51	Correct	97 ms	17864 KB	Output is correct
52	Correct	107 ms	16712 KB	Output is correct
53	Correct	142 ms	20104 KB	Output is correct
54	Correct	128 ms	18576 KB	Output is correct
55	Correct	115 ms	11388 KB	Output is correct
56	Correct	148 ms	23372 KB	Output is correct

Subtask #5
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3412 KB	Output is correct
2	Correct	2 ms	3412 KB	Output is correct
3	Correct	2 ms	3412 KB	Output is correct
4	Correct	2 ms	3412 KB	Output is correct
5	Correct	2 ms	3480 KB	Output is correct
6	Correct	2 ms	3412 KB	Output is correct
7	Correct	2 ms	3540 KB	Output is correct
8	Correct	2 ms	3412 KB	Output is correct
9	Correct	48 ms	10500 KB	Output is correct
10	Correct	66 ms	12100 KB	Output is correct
11	Correct	63 ms	11964 KB	Output is correct
12	Correct	68 ms	12352 KB	Output is correct
13	Correct	133 ms	12728 KB	Output is correct
14	Correct	101 ms	10628 KB	Output is correct
15	Correct	620 ms	13932 KB	Output is correct
16	Correct	651 ms	13668 KB	Output is correct
17	Correct	630 ms	14144 KB	Output is correct
18	Execution timed out	2077 ms	14308 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-

Subtask #6
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3412 KB	Output is correct
2	Correct	2 ms	3412 KB	Output is correct
3	Correct	2 ms	3412 KB	Output is correct
4	Correct	2 ms	3412 KB	Output is correct
5	Correct	2 ms	3412 KB	Output is correct
6	Correct	2 ms	3480 KB	Output is correct
7	Correct	2 ms	3412 KB	Output is correct
8	Correct	2 ms	3540 KB	Output is correct
9	Correct	2 ms	3412 KB	Output is correct
10	Correct	48 ms	10500 KB	Output is correct
11	Correct	66 ms	12100 KB	Output is correct
12	Correct	63 ms	11964 KB	Output is correct
13	Correct	68 ms	12352 KB	Output is correct
14	Correct	133 ms	12728 KB	Output is correct
15	Correct	101 ms	10628 KB	Output is correct
16	Correct	620 ms	13932 KB	Output is correct
17	Correct	651 ms	13668 KB	Output is correct
18	Correct	630 ms	14144 KB	Output is correct
19	Execution timed out	2077 ms	14308 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Submission #563723

Compilation message

Subtask #1 0 / 6.0

Subtask #2 0 / 7.0

Subtask #3 17.0 / 17.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 23.0

Subtask #6 0 / 27.0

Subtask #1
0 / 6.0

Subtask #2
0 / 7.0

Subtask #3
17.0 / 17.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 23.0

Subtask #6
0 / 27.0