답안 #975736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975736	2024-05-05T19:30:58 Z	starchan	Port Facility (JOI17_port_facility)	C++17	78 / 100	1780 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; vector<bool> col; bool works = true;
 
int leader(int u)
{
	if(pa[u] < 0)
		return u;
	else
	{
		int p = leader(pa[u]);
		col[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

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8796 KB	Output is correct
2	Correct	2 ms	8792 KB	Output is correct
3	Correct	1 ms	8796 KB	Output is correct
4	Correct	3 ms	8796 KB	Output is correct
5	Correct	2 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	1 ms	8792 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	1 ms	8796 KB	Output is correct
10	Correct	2 ms	8792 KB	Output is correct
11	Correct	1 ms	8796 KB	Output is correct
12	Correct	2 ms	8948 KB	Output is correct
13	Correct	1 ms	8796 KB	Output is correct
14	Correct	1 ms	8796 KB	Output is correct
15	Correct	1 ms	8792 KB	Output is correct
16	Correct	1 ms	8796 KB	Output is correct
17	Correct	1 ms	8796 KB	Output is correct
18	Correct	1 ms	8888 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	1 ms	8792 KB	Output is correct
21	Correct	2 ms	8792 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	8796 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8796 KB	Output is correct
2	Correct	2 ms	8792 KB	Output is correct
3	Correct	1 ms	8796 KB	Output is correct
4	Correct	3 ms	8796 KB	Output is correct
5	Correct	2 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	1 ms	8792 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	1 ms	8796 KB	Output is correct
10	Correct	2 ms	8792 KB	Output is correct
11	Correct	1 ms	8796 KB	Output is correct
12	Correct	2 ms	8948 KB	Output is correct
13	Correct	1 ms	8796 KB	Output is correct
14	Correct	1 ms	8796 KB	Output is correct
15	Correct	1 ms	8792 KB	Output is correct
16	Correct	1 ms	8796 KB	Output is correct
17	Correct	1 ms	8796 KB	Output is correct
18	Correct	1 ms	8888 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	1 ms	8792 KB	Output is correct
21	Correct	2 ms	8792 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	8796 KB	Output is correct
25	Correct	4 ms	10244 KB	Output is correct
26	Correct	4 ms	10244 KB	Output is correct
27	Correct	4 ms	10244 KB	Output is correct
28	Correct	4 ms	10244 KB	Output is correct
29	Correct	5 ms	10240 KB	Output is correct
30	Correct	4 ms	10240 KB	Output is correct
31	Correct	4 ms	10240 KB	Output is correct
32	Correct	5 ms	10244 KB	Output is correct
33	Correct	5 ms	10244 KB	Output is correct
34	Correct	4 ms	10244 KB	Output is correct
35	Correct	3 ms	10280 KB	Output is correct
36	Correct	4 ms	10244 KB	Output is correct
37	Correct	5 ms	10336 KB	Output is correct
38	Correct	4 ms	10244 KB	Output is correct
39	Correct	4 ms	10244 KB	Output is correct
40	Correct	4 ms	10244 KB	Output is correct
41	Correct	4 ms	10244 KB	Output is correct
42	Correct	4 ms	10244 KB	Output is correct
43	Correct	3 ms	10244 KB	Output is correct
44	Correct	4 ms	10244 KB	Output is correct

Subtask #3
56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8796 KB	Output is correct
2	Correct	2 ms	8792 KB	Output is correct
3	Correct	1 ms	8796 KB	Output is correct
4	Correct	3 ms	8796 KB	Output is correct
5	Correct	2 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	1 ms	8792 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	1 ms	8796 KB	Output is correct
10	Correct	2 ms	8792 KB	Output is correct
11	Correct	1 ms	8796 KB	Output is correct
12	Correct	2 ms	8948 KB	Output is correct
13	Correct	1 ms	8796 KB	Output is correct
14	Correct	1 ms	8796 KB	Output is correct
15	Correct	1 ms	8792 KB	Output is correct
16	Correct	1 ms	8796 KB	Output is correct
17	Correct	1 ms	8796 KB	Output is correct
18	Correct	1 ms	8888 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	1 ms	8792 KB	Output is correct
21	Correct	2 ms	8792 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	8796 KB	Output is correct
25	Correct	4 ms	10244 KB	Output is correct
26	Correct	4 ms	10244 KB	Output is correct
27	Correct	4 ms	10244 KB	Output is correct
28	Correct	4 ms	10244 KB	Output is correct
29	Correct	5 ms	10240 KB	Output is correct
30	Correct	4 ms	10240 KB	Output is correct
31	Correct	4 ms	10240 KB	Output is correct
32	Correct	5 ms	10244 KB	Output is correct
33	Correct	5 ms	10244 KB	Output is correct
34	Correct	4 ms	10244 KB	Output is correct
35	Correct	3 ms	10280 KB	Output is correct
36	Correct	4 ms	10244 KB	Output is correct
37	Correct	5 ms	10336 KB	Output is correct
38	Correct	4 ms	10244 KB	Output is correct
39	Correct	4 ms	10244 KB	Output is correct
40	Correct	4 ms	10244 KB	Output is correct
41	Correct	4 ms	10244 KB	Output is correct
42	Correct	4 ms	10244 KB	Output is correct
43	Correct	3 ms	10244 KB	Output is correct
44	Correct	4 ms	10244 KB	Output is correct
45	Correct	173 ms	156540 KB	Output is correct
46	Correct	159 ms	159524 KB	Output is correct
47	Correct	151 ms	158692 KB	Output is correct
48	Correct	144 ms	156088 KB	Output is correct
49	Correct	147 ms	158544 KB	Output is correct
50	Correct	153 ms	158064 KB	Output is correct
51	Correct	149 ms	159444 KB	Output is correct
52	Correct	106 ms	147412 KB	Output is correct
53	Correct	140 ms	158724 KB	Output is correct
54	Correct	161 ms	155240 KB	Output is correct
55	Correct	159 ms	156888 KB	Output is correct
56	Correct	152 ms	156376 KB	Output is correct
57	Correct	115 ms	147416 KB	Output is correct
58	Correct	126 ms	149204 KB	Output is correct
59	Correct	125 ms	158668 KB	Output is correct
60	Correct	137 ms	156372 KB	Output is correct
61	Correct	144 ms	158892 KB	Output is correct
62	Correct	132 ms	159552 KB	Output is correct
63	Correct	135 ms	158376 KB	Output is correct
64	Correct	140 ms	158612 KB	Output is correct
65	Correct	254 ms	158280 KB	Output is correct
66	Correct	241 ms	156164 KB	Output is correct
67	Correct	160 ms	159188 KB	Output is correct
68	Correct	150 ms	158676 KB	Output is correct
69	Correct	155 ms	156340 KB	Output is correct
70	Correct	154 ms	156908 KB	Output is correct
71	Correct	144 ms	155512 KB	Output is correct
72	Correct	143 ms	155376 KB	Output is correct
73	Correct	143 ms	155664 KB	Output is correct
74	Correct	145 ms	158812 KB	Output is correct
75	Correct	132 ms	148792 KB	Output is correct
76	Correct	120 ms	147672 KB	Output is correct
77	Correct	117 ms	148952 KB	Output is correct
78	Correct	158 ms	158060 KB	Output is correct
79	Correct	145 ms	159992 KB	Output is correct

Subtask #4
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8796 KB	Output is correct
2	Correct	2 ms	8792 KB	Output is correct
3	Correct	1 ms	8796 KB	Output is correct
4	Correct	3 ms	8796 KB	Output is correct
5	Correct	2 ms	8796 KB	Output is correct
6	Correct	1 ms	8796 KB	Output is correct
7	Correct	1 ms	8792 KB	Output is correct
8	Correct	2 ms	8796 KB	Output is correct
9	Correct	1 ms	8796 KB	Output is correct
10	Correct	2 ms	8792 KB	Output is correct
11	Correct	1 ms	8796 KB	Output is correct
12	Correct	2 ms	8948 KB	Output is correct
13	Correct	1 ms	8796 KB	Output is correct
14	Correct	1 ms	8796 KB	Output is correct
15	Correct	1 ms	8792 KB	Output is correct
16	Correct	1 ms	8796 KB	Output is correct
17	Correct	1 ms	8796 KB	Output is correct
18	Correct	1 ms	8888 KB	Output is correct
19	Correct	1 ms	8792 KB	Output is correct
20	Correct	1 ms	8792 KB	Output is correct
21	Correct	2 ms	8792 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	8796 KB	Output is correct
25	Correct	4 ms	10244 KB	Output is correct
26	Correct	4 ms	10244 KB	Output is correct
27	Correct	4 ms	10244 KB	Output is correct
28	Correct	4 ms	10244 KB	Output is correct
29	Correct	5 ms	10240 KB	Output is correct
30	Correct	4 ms	10240 KB	Output is correct
31	Correct	4 ms	10240 KB	Output is correct
32	Correct	5 ms	10244 KB	Output is correct
33	Correct	5 ms	10244 KB	Output is correct
34	Correct	4 ms	10244 KB	Output is correct
35	Correct	3 ms	10280 KB	Output is correct
36	Correct	4 ms	10244 KB	Output is correct
37	Correct	5 ms	10336 KB	Output is correct
38	Correct	4 ms	10244 KB	Output is correct
39	Correct	4 ms	10244 KB	Output is correct
40	Correct	4 ms	10244 KB	Output is correct
41	Correct	4 ms	10244 KB	Output is correct
42	Correct	4 ms	10244 KB	Output is correct
43	Correct	3 ms	10244 KB	Output is correct
44	Correct	4 ms	10244 KB	Output is correct
45	Correct	173 ms	156540 KB	Output is correct
46	Correct	159 ms	159524 KB	Output is correct
47	Correct	151 ms	158692 KB	Output is correct
48	Correct	144 ms	156088 KB	Output is correct
49	Correct	147 ms	158544 KB	Output is correct
50	Correct	153 ms	158064 KB	Output is correct
51	Correct	149 ms	159444 KB	Output is correct
52	Correct	106 ms	147412 KB	Output is correct
53	Correct	140 ms	158724 KB	Output is correct
54	Correct	161 ms	155240 KB	Output is correct
55	Correct	159 ms	156888 KB	Output is correct
56	Correct	152 ms	156376 KB	Output is correct
57	Correct	115 ms	147416 KB	Output is correct
58	Correct	126 ms	149204 KB	Output is correct
59	Correct	125 ms	158668 KB	Output is correct
60	Correct	137 ms	156372 KB	Output is correct
61	Correct	144 ms	158892 KB	Output is correct
62	Correct	132 ms	159552 KB	Output is correct
63	Correct	135 ms	158376 KB	Output is correct
64	Correct	140 ms	158612 KB	Output is correct
65	Correct	254 ms	158280 KB	Output is correct
66	Correct	241 ms	156164 KB	Output is correct
67	Correct	160 ms	159188 KB	Output is correct
68	Correct	150 ms	158676 KB	Output is correct
69	Correct	155 ms	156340 KB	Output is correct
70	Correct	154 ms	156908 KB	Output is correct
71	Correct	144 ms	155512 KB	Output is correct
72	Correct	143 ms	155376 KB	Output is correct
73	Correct	143 ms	155664 KB	Output is correct
74	Correct	145 ms	158812 KB	Output is correct
75	Correct	132 ms	148792 KB	Output is correct
76	Correct	120 ms	147672 KB	Output is correct
77	Correct	117 ms	148952 KB	Output is correct
78	Correct	158 ms	158060 KB	Output is correct
79	Correct	145 ms	159992 KB	Output is correct
80	Correct	1780 ms	1048576 KB	Output is correct
81	Correct	1453 ms	1048576 KB	Output is correct
82	Correct	1459 ms	1048576 KB	Output is correct
83	Runtime error	1446 ms	1048580 KB	Memory limit exceeded
84	Halted	0 ms	0 KB	-

답안 #975736

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