Submission #975732

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
975732	2024-05-05T19:20:25 Z	starchan	Port Facility (JOI17_port_facility)	C++17	78 / 100	1512 ms	1048580 KB

port_facility

#include<bits/stdc++.h>
using namespace std;
#define in array<int, 2>
#define pb push_back
#define pob pop_back
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)

const int SMX = 1e6+5;
const int MX = 2e6+3;
const int LMX = 4e7+1e6;
const int mod = 1e9+7;

int vv[MX]; vector<vector<int>> g;

int leaf[MX];
vector<int> lleft;
vector<int> rright;
vector<bool> tree;
int nxt = 0;

int root[SMX];

int New()
{
	lleft.pb(-1); rright.pb(-1); g.resize(g.size()+1); tree.pb(0);
	return nxt++;
}

int build(int l, int r)
{
	int id = New(); int m = (l+r)/2;
	if(l==r)
		return id;
	lleft[id] = build(l, m); rright[id] = build(m+1, r);  tree[id] = 0;
	return id;
}

int upd(int pos, int id, int l, int r)
{
	int id_n = New(); tree[id_n] = 1;
	if(l == r)
		return leaf[pos] = id_n;
	lleft[id_n] = lleft[id]; rright[id_n] = rright[id];
	int m = (l+r)/2;
	if(pos <= m)
		lleft[id_n] = upd(pos, lleft[id], l, m);
	else
		rright[id_n] = upd(pos, rright[id], m+1, r);
	return id_n;
}

void add(int pp, int ql, int qr, int id, int l, int r)
{
	if(qr < l || r < ql)
		return;
	if((ql <= l) && (r <= qr))
	{
		g[pp].pb(id);
		return;
	}
	int m = (l+r)/2;
	add(pp, ql, qr, lleft[id], l, m);
	add(pp, ql, qr, rright[id], m+1, r);
	return;
}

vector<int> pa, col; bool works = true;

int leader(int u)
{
	if(pa[u] < 0)
		return u;
	else
	{
		int p = leader(pa[u]);
		col[u]^=col[pa[u]];
		return pa[u] = p;
	}
}

void merge(int u, int v, int xr)
{
	int x = leader(u);
	int y = leader(v);
	if(x == y)
	{
		if(col[u]^col[v]^xr)
			works = false;
		return;
	}
	if(pa[x] < pa[y])
	{
		swap(x, y);
		swap(u, v);
	}
	pa[y]+=pa[x];
	pa[x] = y;
	col[x] = col[u]^col[v]^xr;
	return;
}

vector<bool> rl(MX);
bitset<LMX> vis, ppl;
void dfs(int u)
{
	vis[u] = 1;
	if(lleft[u] != -1)
	{
		if((!vis[lleft[u]]) && tree[lleft[u]])
			dfs(lleft[u]);
		if((!vis[rright[u]]) && tree[rright[u]])
			dfs(rright[u]);
		if(tree[lleft[u]]){
		//cout << "cat_L_Calling " << lleft[u] << " from " << u << endl;
		merge(u, lleft[u], 0);}
		if(tree[rright[u]]){
		//cout << "cat_R_Calling " << rright[u] << " from " << u << endl;
		merge(u, rright[u], 0);}
		return;
	}
	for(int v: g[u])
	{
		if(!tree[v])
			continue;
		merge(u, v, 1);
		if(vis[v])
		{
			//cout << "Tried to call " << v << " from " << u << endl;
			continue;
		}
		//cout << "Calling " << v << " from " << u <<  "\n";
		dfs(v);
	}
	return;
}

signed main()
{
	fast();//During debugging, this should ideally be removed.
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		int x, y; cin >> x >> y;
		vv[x] = y;
	}
	int sn = 0; root[sn] = build(1, 2*n); //cout << "nxt = " << nxt << endl;

	int b[n+1];
	for(int i = 1; i <= 2*n; i++)
	{
		if(vv[i])
		{
			int p = upd(vv[i], root[sn++], 1, 2*n); root[sn] = p;
			add(leaf[vv[i]], i, vv[i]-1, p, 1, 2*n); rl[vv[i]] = 1;
			b[sn] = leaf[vv[i]];
			//cout << "b[sn] = " << b[sn] << endl;
		}
	}

	int N = g.size(); pa.assign(N, -1); col.assign(N, 0);
	for(int i = 1; i <= n; i++)
		dfs(b[i]);
	if(!works)
	{
		cout << "0\n";
		return 0;
	}
	int ans = 1;
	for(int i = 1; i <= n; i++)
	{
		if(ppl[leader(b[i])])
			continue;
		ppl[leader(b[i])] = 1; ans*=2; ans%=mod;
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	9048 KB	Output is correct
2	Correct	2 ms	8796 KB	Output is correct
3	Correct	1 ms	8928 KB	Output is correct
4	Correct	2 ms	8796 KB	Output is correct
5	Correct	1 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	2 ms	8796 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	2 ms	8796 KB	Output is correct
10	Correct	2 ms	8928 KB	Output is correct
11	Correct	2 ms	8796 KB	Output is correct
12	Correct	2 ms	8796 KB	Output is correct
13	Correct	2 ms	8792 KB	Output is correct
14	Correct	1 ms	8792 KB	Output is correct
15	Correct	1 ms	8796 KB	Output is correct
16	Correct	2 ms	9044 KB	Output is correct
17	Correct	2 ms	9048 KB	Output is correct
18	Correct	1 ms	8796 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	2 ms	8796 KB	Output is correct
21	Correct	2 ms	8796 KB	Output is correct
22	Correct	1 ms	8796 KB	Output is correct
23	Correct	1 ms	8796 KB	Output is correct
24	Correct	1 ms	8800 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	9048 KB	Output is correct
2	Correct	2 ms	8796 KB	Output is correct
3	Correct	1 ms	8928 KB	Output is correct
4	Correct	2 ms	8796 KB	Output is correct
5	Correct	1 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	2 ms	8796 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	2 ms	8796 KB	Output is correct
10	Correct	2 ms	8928 KB	Output is correct
11	Correct	2 ms	8796 KB	Output is correct
12	Correct	2 ms	8796 KB	Output is correct
13	Correct	2 ms	8792 KB	Output is correct
14	Correct	1 ms	8792 KB	Output is correct
15	Correct	1 ms	8796 KB	Output is correct
16	Correct	2 ms	9044 KB	Output is correct
17	Correct	2 ms	9048 KB	Output is correct
18	Correct	1 ms	8796 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	2 ms	8796 KB	Output is correct
21	Correct	2 ms	8796 KB	Output is correct
22	Correct	1 ms	8796 KB	Output is correct
23	Correct	1 ms	8796 KB	Output is correct
24	Correct	1 ms	8800 KB	Output is correct
25	Correct	4 ms	10504 KB	Output is correct
26	Correct	5 ms	10504 KB	Output is correct
27	Correct	4 ms	10244 KB	Output is correct
28	Correct	4 ms	10500 KB	Output is correct
29	Correct	4 ms	10496 KB	Output is correct
30	Correct	4 ms	10244 KB	Output is correct
31	Correct	4 ms	10496 KB	Output is correct
32	Correct	5 ms	10500 KB	Output is correct
33	Correct	4 ms	10496 KB	Output is correct
34	Correct	4 ms	10500 KB	Output is correct
35	Correct	3 ms	10500 KB	Output is correct
36	Correct	4 ms	10244 KB	Output is correct
37	Correct	4 ms	10500 KB	Output is correct
38	Correct	4 ms	10240 KB	Output is correct
39	Correct	3 ms	10496 KB	Output is correct
40	Correct	3 ms	10500 KB	Output is correct
41	Correct	4 ms	10500 KB	Output is correct
42	Correct	4 ms	10496 KB	Output is correct
43	Correct	4 ms	10544 KB	Output is correct
44	Correct	3 ms	10500 KB	Output is correct

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	9048 KB	Output is correct
2	Correct	2 ms	8796 KB	Output is correct
3	Correct	1 ms	8928 KB	Output is correct
4	Correct	2 ms	8796 KB	Output is correct
5	Correct	1 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	2 ms	8796 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	2 ms	8796 KB	Output is correct
10	Correct	2 ms	8928 KB	Output is correct
11	Correct	2 ms	8796 KB	Output is correct
12	Correct	2 ms	8796 KB	Output is correct
13	Correct	2 ms	8792 KB	Output is correct
14	Correct	1 ms	8792 KB	Output is correct
15	Correct	1 ms	8796 KB	Output is correct
16	Correct	2 ms	9044 KB	Output is correct
17	Correct	2 ms	9048 KB	Output is correct
18	Correct	1 ms	8796 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	2 ms	8796 KB	Output is correct
21	Correct	2 ms	8796 KB	Output is correct
22	Correct	1 ms	8796 KB	Output is correct
23	Correct	1 ms	8796 KB	Output is correct
24	Correct	1 ms	8800 KB	Output is correct
25	Correct	4 ms	10504 KB	Output is correct
26	Correct	5 ms	10504 KB	Output is correct
27	Correct	4 ms	10244 KB	Output is correct
28	Correct	4 ms	10500 KB	Output is correct
29	Correct	4 ms	10496 KB	Output is correct
30	Correct	4 ms	10244 KB	Output is correct
31	Correct	4 ms	10496 KB	Output is correct
32	Correct	5 ms	10500 KB	Output is correct
33	Correct	4 ms	10496 KB	Output is correct
34	Correct	4 ms	10500 KB	Output is correct
35	Correct	3 ms	10500 KB	Output is correct
36	Correct	4 ms	10244 KB	Output is correct
37	Correct	4 ms	10500 KB	Output is correct
38	Correct	4 ms	10240 KB	Output is correct
39	Correct	3 ms	10496 KB	Output is correct
40	Correct	3 ms	10500 KB	Output is correct
41	Correct	4 ms	10500 KB	Output is correct
42	Correct	4 ms	10496 KB	Output is correct
43	Correct	4 ms	10544 KB	Output is correct
44	Correct	3 ms	10500 KB	Output is correct
45	Correct	179 ms	158064 KB	Output is correct
46	Correct	153 ms	156960 KB	Output is correct
47	Correct	145 ms	157652 KB	Output is correct
48	Correct	158 ms	157140 KB	Output is correct
49	Correct	156 ms	157648 KB	Output is correct
50	Correct	145 ms	159920 KB	Output is correct
51	Correct	143 ms	159676 KB	Output is correct
52	Correct	113 ms	150228 KB	Output is correct
53	Correct	137 ms	158164 KB	Output is correct
54	Correct	154 ms	156712 KB	Output is correct
55	Correct	153 ms	159024 KB	Output is correct
56	Correct	156 ms	157400 KB	Output is correct
57	Correct	133 ms	149028 KB	Output is correct
58	Correct	114 ms	150228 KB	Output is correct
59	Correct	130 ms	157988 KB	Output is correct
60	Correct	153 ms	158884 KB	Output is correct
61	Correct	139 ms	160212 KB	Output is correct
62	Correct	128 ms	159700 KB	Output is correct
63	Correct	144 ms	159208 KB	Output is correct
64	Correct	140 ms	157140 KB	Output is correct
65	Correct	261 ms	158508 KB	Output is correct
66	Correct	228 ms	159700 KB	Output is correct
67	Correct	154 ms	158424 KB	Output is correct
68	Correct	146 ms	159924 KB	Output is correct
69	Correct	166 ms	156884 KB	Output is correct
70	Correct	149 ms	157544 KB	Output is correct
71	Correct	142 ms	158688 KB	Output is correct
72	Correct	151 ms	157052 KB	Output is correct
73	Correct	142 ms	157372 KB	Output is correct
74	Correct	143 ms	157904 KB	Output is correct
75	Correct	119 ms	148688 KB	Output is correct
76	Correct	121 ms	148372 KB	Output is correct
77	Correct	123 ms	148608 KB	Output is correct
78	Correct	143 ms	160084 KB	Output is correct
79	Correct	144 ms	157556 KB	Output is correct

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	9048 KB	Output is correct
2	Correct	2 ms	8796 KB	Output is correct
3	Correct	1 ms	8928 KB	Output is correct
4	Correct	2 ms	8796 KB	Output is correct
5	Correct	1 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	2 ms	8796 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	2 ms	8796 KB	Output is correct
10	Correct	2 ms	8928 KB	Output is correct
11	Correct	2 ms	8796 KB	Output is correct
12	Correct	2 ms	8796 KB	Output is correct
13	Correct	2 ms	8792 KB	Output is correct
14	Correct	1 ms	8792 KB	Output is correct
15	Correct	1 ms	8796 KB	Output is correct
16	Correct	2 ms	9044 KB	Output is correct
17	Correct	2 ms	9048 KB	Output is correct
18	Correct	1 ms	8796 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	2 ms	8796 KB	Output is correct
21	Correct	2 ms	8796 KB	Output is correct
22	Correct	1 ms	8796 KB	Output is correct
23	Correct	1 ms	8796 KB	Output is correct
24	Correct	1 ms	8800 KB	Output is correct
25	Correct	4 ms	10504 KB	Output is correct
26	Correct	5 ms	10504 KB	Output is correct
27	Correct	4 ms	10244 KB	Output is correct
28	Correct	4 ms	10500 KB	Output is correct
29	Correct	4 ms	10496 KB	Output is correct
30	Correct	4 ms	10244 KB	Output is correct
31	Correct	4 ms	10496 KB	Output is correct
32	Correct	5 ms	10500 KB	Output is correct
33	Correct	4 ms	10496 KB	Output is correct
34	Correct	4 ms	10500 KB	Output is correct
35	Correct	3 ms	10500 KB	Output is correct
36	Correct	4 ms	10244 KB	Output is correct
37	Correct	4 ms	10500 KB	Output is correct
38	Correct	4 ms	10240 KB	Output is correct
39	Correct	3 ms	10496 KB	Output is correct
40	Correct	3 ms	10500 KB	Output is correct
41	Correct	4 ms	10500 KB	Output is correct
42	Correct	4 ms	10496 KB	Output is correct
43	Correct	4 ms	10544 KB	Output is correct
44	Correct	3 ms	10500 KB	Output is correct
45	Correct	179 ms	158064 KB	Output is correct
46	Correct	153 ms	156960 KB	Output is correct
47	Correct	145 ms	157652 KB	Output is correct
48	Correct	158 ms	157140 KB	Output is correct
49	Correct	156 ms	157648 KB	Output is correct
50	Correct	145 ms	159920 KB	Output is correct
51	Correct	143 ms	159676 KB	Output is correct
52	Correct	113 ms	150228 KB	Output is correct
53	Correct	137 ms	158164 KB	Output is correct
54	Correct	154 ms	156712 KB	Output is correct
55	Correct	153 ms	159024 KB	Output is correct
56	Correct	156 ms	157400 KB	Output is correct
57	Correct	133 ms	149028 KB	Output is correct
58	Correct	114 ms	150228 KB	Output is correct
59	Correct	130 ms	157988 KB	Output is correct
60	Correct	153 ms	158884 KB	Output is correct
61	Correct	139 ms	160212 KB	Output is correct
62	Correct	128 ms	159700 KB	Output is correct
63	Correct	144 ms	159208 KB	Output is correct
64	Correct	140 ms	157140 KB	Output is correct
65	Correct	261 ms	158508 KB	Output is correct
66	Correct	228 ms	159700 KB	Output is correct
67	Correct	154 ms	158424 KB	Output is correct
68	Correct	146 ms	159924 KB	Output is correct
69	Correct	166 ms	156884 KB	Output is correct
70	Correct	149 ms	157544 KB	Output is correct
71	Correct	142 ms	158688 KB	Output is correct
72	Correct	151 ms	157052 KB	Output is correct
73	Correct	142 ms	157372 KB	Output is correct
74	Correct	143 ms	157904 KB	Output is correct
75	Correct	119 ms	148688 KB	Output is correct
76	Correct	121 ms	148372 KB	Output is correct
77	Correct	123 ms	148608 KB	Output is correct
78	Correct	143 ms	160084 KB	Output is correct
79	Correct	144 ms	157556 KB	Output is correct
80	Runtime error	1512 ms	1048580 KB	Execution killed with signal 9
81	Halted	0 ms	0 KB	-

Submission #975732

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 56.0 / 56.0

Subtask #4 0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
56.0 / 56.0

Subtask #4
0 / 22.0