답안 #975753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975753	2024-05-05T20:03:18 Z	starchan	Port Facility (JOI17_port_facility)	C++17	78 / 100	676 ms	1048576 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 = 3e7+5e6;
const int mod = 1e9+7;
 
vector<int> g[LMX];
 
int leaf[MX]; 
int lleft[LMX];
int rright[LMX];
int tree[LMX];
int nxt = 0;
 
int New()
{
	nxt++;
	lleft[nxt] = rright[nxt] = -1;
	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;
}
 
int pa[LMX]; bool col[LMX]; 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;
}
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;
	vector<in> vv(n+1);
	for(int i = 1; i <= n; i++)
		cin >> vv[i][0] >> vv[i][1];
	sort(vv.begin()+1, vv.end());
	int sn = 0; int root = build(1, 2*n); //cout << "nxt = " << nxt << endl;
 
	int b[n+1];
	for(int i = 1; i <= n; i++)
	{
		root = upd(vv[i][1], root, 1, 2*n);
		add(leaf[vv[i][1]], vv[i][0], vv[i][1]-1, root, 1, 2*n);
		b[++sn] = leaf[vv[i][1]];
		//cout << "b[sn] = " << b[sn] << endl;
	}
 
	int N = nxt; 
	for(int i = 1; i <= N; i++)
		pa[i] = -1;
	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	362 ms	833872 KB	Output is correct
2	Correct	181 ms	833872 KB	Output is correct
3	Correct	191 ms	833724 KB	Output is correct
4	Correct	189 ms	834064 KB	Output is correct
5	Correct	185 ms	833836 KB	Output is correct
6	Correct	188 ms	833752 KB	Output is correct
7	Correct	192 ms	833868 KB	Output is correct
8	Correct	185 ms	833756 KB	Output is correct
9	Correct	197 ms	833716 KB	Output is correct
10	Correct	182 ms	833900 KB	Output is correct
11	Correct	183 ms	833876 KB	Output is correct
12	Correct	185 ms	833900 KB	Output is correct
13	Correct	184 ms	833872 KB	Output is correct
14	Correct	185 ms	833808 KB	Output is correct
15	Correct	183 ms	833872 KB	Output is correct
16	Correct	183 ms	833900 KB	Output is correct
17	Correct	185 ms	833696 KB	Output is correct
18	Correct	184 ms	833884 KB	Output is correct
19	Correct	193 ms	833784 KB	Output is correct
20	Correct	185 ms	833884 KB	Output is correct
21	Correct	189 ms	833892 KB	Output is correct
22	Correct	188 ms	833876 KB	Output is correct
23	Correct	185 ms	833700 KB	Output is correct
24	Correct	192 ms	833896 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	362 ms	833872 KB	Output is correct
2	Correct	181 ms	833872 KB	Output is correct
3	Correct	191 ms	833724 KB	Output is correct
4	Correct	189 ms	834064 KB	Output is correct
5	Correct	185 ms	833836 KB	Output is correct
6	Correct	188 ms	833752 KB	Output is correct
7	Correct	192 ms	833868 KB	Output is correct
8	Correct	185 ms	833756 KB	Output is correct
9	Correct	197 ms	833716 KB	Output is correct
10	Correct	182 ms	833900 KB	Output is correct
11	Correct	183 ms	833876 KB	Output is correct
12	Correct	185 ms	833900 KB	Output is correct
13	Correct	184 ms	833872 KB	Output is correct
14	Correct	185 ms	833808 KB	Output is correct
15	Correct	183 ms	833872 KB	Output is correct
16	Correct	183 ms	833900 KB	Output is correct
17	Correct	185 ms	833696 KB	Output is correct
18	Correct	184 ms	833884 KB	Output is correct
19	Correct	193 ms	833784 KB	Output is correct
20	Correct	185 ms	833884 KB	Output is correct
21	Correct	189 ms	833892 KB	Output is correct
22	Correct	188 ms	833876 KB	Output is correct
23	Correct	185 ms	833700 KB	Output is correct
24	Correct	192 ms	833896 KB	Output is correct
25	Correct	185 ms	834432 KB	Output is correct
26	Correct	186 ms	834196 KB	Output is correct
27	Correct	188 ms	834128 KB	Output is correct
28	Correct	188 ms	834192 KB	Output is correct
29	Correct	197 ms	834016 KB	Output is correct
30	Correct	190 ms	834192 KB	Output is correct
31	Correct	191 ms	834188 KB	Output is correct
32	Correct	185 ms	834132 KB	Output is correct
33	Correct	190 ms	834384 KB	Output is correct
34	Correct	187 ms	834188 KB	Output is correct
35	Correct	184 ms	834120 KB	Output is correct
36	Correct	183 ms	834240 KB	Output is correct
37	Correct	189 ms	834132 KB	Output is correct
38	Correct	185 ms	834180 KB	Output is correct
39	Correct	187 ms	834144 KB	Output is correct
40	Correct	182 ms	833872 KB	Output is correct
41	Correct	186 ms	834224 KB	Output is correct
42	Correct	184 ms	834228 KB	Output is correct
43	Correct	182 ms	834128 KB	Output is correct
44	Correct	182 ms	834128 KB	Output is correct

Subtask #3
56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	362 ms	833872 KB	Output is correct
2	Correct	181 ms	833872 KB	Output is correct
3	Correct	191 ms	833724 KB	Output is correct
4	Correct	189 ms	834064 KB	Output is correct
5	Correct	185 ms	833836 KB	Output is correct
6	Correct	188 ms	833752 KB	Output is correct
7	Correct	192 ms	833868 KB	Output is correct
8	Correct	185 ms	833756 KB	Output is correct
9	Correct	197 ms	833716 KB	Output is correct
10	Correct	182 ms	833900 KB	Output is correct
11	Correct	183 ms	833876 KB	Output is correct
12	Correct	185 ms	833900 KB	Output is correct
13	Correct	184 ms	833872 KB	Output is correct
14	Correct	185 ms	833808 KB	Output is correct
15	Correct	183 ms	833872 KB	Output is correct
16	Correct	183 ms	833900 KB	Output is correct
17	Correct	185 ms	833696 KB	Output is correct
18	Correct	184 ms	833884 KB	Output is correct
19	Correct	193 ms	833784 KB	Output is correct
20	Correct	185 ms	833884 KB	Output is correct
21	Correct	189 ms	833892 KB	Output is correct
22	Correct	188 ms	833876 KB	Output is correct
23	Correct	185 ms	833700 KB	Output is correct
24	Correct	192 ms	833896 KB	Output is correct
25	Correct	185 ms	834432 KB	Output is correct
26	Correct	186 ms	834196 KB	Output is correct
27	Correct	188 ms	834128 KB	Output is correct
28	Correct	188 ms	834192 KB	Output is correct
29	Correct	197 ms	834016 KB	Output is correct
30	Correct	190 ms	834192 KB	Output is correct
31	Correct	191 ms	834188 KB	Output is correct
32	Correct	185 ms	834132 KB	Output is correct
33	Correct	190 ms	834384 KB	Output is correct
34	Correct	187 ms	834188 KB	Output is correct
35	Correct	184 ms	834120 KB	Output is correct
36	Correct	183 ms	834240 KB	Output is correct
37	Correct	189 ms	834132 KB	Output is correct
38	Correct	185 ms	834180 KB	Output is correct
39	Correct	187 ms	834144 KB	Output is correct
40	Correct	182 ms	833872 KB	Output is correct
41	Correct	186 ms	834224 KB	Output is correct
42	Correct	184 ms	834228 KB	Output is correct
43	Correct	182 ms	834128 KB	Output is correct
44	Correct	182 ms	834128 KB	Output is correct
45	Correct	290 ms	882512 KB	Output is correct
46	Correct	285 ms	882512 KB	Output is correct
47	Correct	294 ms	882512 KB	Output is correct
48	Correct	282 ms	882512 KB	Output is correct
49	Correct	279 ms	882584 KB	Output is correct
50	Correct	293 ms	882208 KB	Output is correct
51	Correct	286 ms	882196 KB	Output is correct
52	Correct	250 ms	876116 KB	Output is correct
53	Correct	271 ms	884064 KB	Output is correct
54	Correct	292 ms	886620 KB	Output is correct
55	Correct	293 ms	884240 KB	Output is correct
56	Correct	287 ms	884536 KB	Output is correct
57	Correct	252 ms	878024 KB	Output is correct
58	Correct	244 ms	876116 KB	Output is correct
59	Correct	263 ms	880720 KB	Output is correct
60	Correct	272 ms	880848 KB	Output is correct
61	Correct	271 ms	880980 KB	Output is correct
62	Correct	268 ms	880432 KB	Output is correct
63	Correct	271 ms	880460 KB	Output is correct
64	Correct	290 ms	880772 KB	Output is correct
65	Correct	376 ms	885260 KB	Output is correct
66	Correct	361 ms	885424 KB	Output is correct
67	Correct	294 ms	885368 KB	Output is correct
68	Correct	289 ms	885376 KB	Output is correct
69	Correct	299 ms	885604 KB	Output is correct
70	Correct	292 ms	885332 KB	Output is correct
71	Correct	280 ms	885792 KB	Output is correct
72	Correct	278 ms	885840 KB	Output is correct
73	Correct	279 ms	885840 KB	Output is correct
74	Correct	283 ms	885796 KB	Output is correct
75	Correct	284 ms	877892 KB	Output is correct
76	Correct	257 ms	877928 KB	Output is correct
77	Correct	254 ms	877908 KB	Output is correct
78	Correct	279 ms	882512 KB	Output is correct
79	Correct	288 ms	882560 KB	Output is correct

Subtask #4
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	362 ms	833872 KB	Output is correct
2	Correct	181 ms	833872 KB	Output is correct
3	Correct	191 ms	833724 KB	Output is correct
4	Correct	189 ms	834064 KB	Output is correct
5	Correct	185 ms	833836 KB	Output is correct
6	Correct	188 ms	833752 KB	Output is correct
7	Correct	192 ms	833868 KB	Output is correct
8	Correct	185 ms	833756 KB	Output is correct
9	Correct	197 ms	833716 KB	Output is correct
10	Correct	182 ms	833900 KB	Output is correct
11	Correct	183 ms	833876 KB	Output is correct
12	Correct	185 ms	833900 KB	Output is correct
13	Correct	184 ms	833872 KB	Output is correct
14	Correct	185 ms	833808 KB	Output is correct
15	Correct	183 ms	833872 KB	Output is correct
16	Correct	183 ms	833900 KB	Output is correct
17	Correct	185 ms	833696 KB	Output is correct
18	Correct	184 ms	833884 KB	Output is correct
19	Correct	193 ms	833784 KB	Output is correct
20	Correct	185 ms	833884 KB	Output is correct
21	Correct	189 ms	833892 KB	Output is correct
22	Correct	188 ms	833876 KB	Output is correct
23	Correct	185 ms	833700 KB	Output is correct
24	Correct	192 ms	833896 KB	Output is correct
25	Correct	185 ms	834432 KB	Output is correct
26	Correct	186 ms	834196 KB	Output is correct
27	Correct	188 ms	834128 KB	Output is correct
28	Correct	188 ms	834192 KB	Output is correct
29	Correct	197 ms	834016 KB	Output is correct
30	Correct	190 ms	834192 KB	Output is correct
31	Correct	191 ms	834188 KB	Output is correct
32	Correct	185 ms	834132 KB	Output is correct
33	Correct	190 ms	834384 KB	Output is correct
34	Correct	187 ms	834188 KB	Output is correct
35	Correct	184 ms	834120 KB	Output is correct
36	Correct	183 ms	834240 KB	Output is correct
37	Correct	189 ms	834132 KB	Output is correct
38	Correct	185 ms	834180 KB	Output is correct
39	Correct	187 ms	834144 KB	Output is correct
40	Correct	182 ms	833872 KB	Output is correct
41	Correct	186 ms	834224 KB	Output is correct
42	Correct	184 ms	834228 KB	Output is correct
43	Correct	182 ms	834128 KB	Output is correct
44	Correct	182 ms	834128 KB	Output is correct
45	Correct	290 ms	882512 KB	Output is correct
46	Correct	285 ms	882512 KB	Output is correct
47	Correct	294 ms	882512 KB	Output is correct
48	Correct	282 ms	882512 KB	Output is correct
49	Correct	279 ms	882584 KB	Output is correct
50	Correct	293 ms	882208 KB	Output is correct
51	Correct	286 ms	882196 KB	Output is correct
52	Correct	250 ms	876116 KB	Output is correct
53	Correct	271 ms	884064 KB	Output is correct
54	Correct	292 ms	886620 KB	Output is correct
55	Correct	293 ms	884240 KB	Output is correct
56	Correct	287 ms	884536 KB	Output is correct
57	Correct	252 ms	878024 KB	Output is correct
58	Correct	244 ms	876116 KB	Output is correct
59	Correct	263 ms	880720 KB	Output is correct
60	Correct	272 ms	880848 KB	Output is correct
61	Correct	271 ms	880980 KB	Output is correct
62	Correct	268 ms	880432 KB	Output is correct
63	Correct	271 ms	880460 KB	Output is correct
64	Correct	290 ms	880772 KB	Output is correct
65	Correct	376 ms	885260 KB	Output is correct
66	Correct	361 ms	885424 KB	Output is correct
67	Correct	294 ms	885368 KB	Output is correct
68	Correct	289 ms	885376 KB	Output is correct
69	Correct	299 ms	885604 KB	Output is correct
70	Correct	292 ms	885332 KB	Output is correct
71	Correct	280 ms	885792 KB	Output is correct
72	Correct	278 ms	885840 KB	Output is correct
73	Correct	279 ms	885840 KB	Output is correct
74	Correct	283 ms	885796 KB	Output is correct
75	Correct	284 ms	877892 KB	Output is correct
76	Correct	257 ms	877928 KB	Output is correct
77	Correct	254 ms	877908 KB	Output is correct
78	Correct	279 ms	882512 KB	Output is correct
79	Correct	288 ms	882560 KB	Output is correct
80	Runtime error	676 ms	1048576 KB	Execution killed with signal 9
81	Halted	0 ms	0 KB	-

답안 #975753

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