Submission #70770

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
70770	2018-08-23T10:31:33 Z	AlphaRazra	Port Facility (JOI17_port_facility)	C++14	100 / 100	2917 ms	383300 KB

port_facility

#include<bits/stdc++.h>
#define mp make_pair
#define fs first
#define sc second
#define pb push_back
#define debug(x) cout<<#x<<" = "<<(x)<<endl
#define mod 1000000007
#define INF 1e18
using namespace std;

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
* if you have no idea just guess the appropriate well-known algo instead of doing nothing :/
*/

int n;
pair<int,int> tim[1000005];
int parent[2000005];

vector<int> tree[4 * 2000005];

int caribapak(int now){
	if(parent[now] == now) return now;
	return parent[now] = caribapak(parent[now]);
}

void gabung(int a,int b){
	int x = caribapak(a);
	int y = caribapak(b);
	if(x != y){
		parent[x] = y;
		return;
	}
}


void update(int idx,int l,int r,int pos,int val){
	if(pos > r || pos < l){
		return;
	}

	tree[idx].pb(val);
	if(l == r){
		return;
	}
	update(2 * idx, l, (l + r)/2, pos, val);
	update(2 * idx + 1, (l + r)/2 + 1, r, pos, val);
}

void query(int idx,int l,int r,int kiri,int kanan,int val){
	if(kiri > r || kanan < l){
		return;
	}

	if(l >= kiri && r <= kanan){
		for(int i = 0; i < tree[idx].size(); i++){
			int now = tree[idx][i];
		//	if(val == 4) cout << now << " tes\n";
			int com = now + n;
			if(now > n) com = now - n;
			gabung(now, val + n);
			gabung(com, val);
		}
		if(tree[idx].size() > 0){
			tree[idx].clear();
			tree[idx].pb(val + n);
		}
		return;
	}
	query(2 * idx, l, (l + r)/2, kiri, kanan, val);
	query(2 * idx + 1, (l + r)/2 + 1, r, kiri, kanan, val);
}

int main(){
	ios::sync_with_stdio(0);
	cin >> n;

	for(int i = 1 ; i <= n; i++){
		cin >> tim[i].fs >> tim[i].sc;
	}
	sort(tim + 1, tim + n + 1);

	for(int i = 1; i <= 2 * n; i++){
		parent[i] = i;
	}

	for(int i = 1; i <= n; i++){
		query(1, 1, 2 * n, tim[i].fs, tim[i].sc, i);
		int x=caribapak(i);
		int y=caribapak(n+i);
		if(x == y){
			cout << "0\n";
			return 0;
		}
		update(1, 1, 2 * n, tim[i].sc, i);
	}

	for(int i = 1; i <= n; i++){
		int x = caribapak(i);
		int y = caribapak(i + n);
		if(x == y){
		//	cout << i << " haha\n";
			cout << "0\n";
			return 0;
		}
	}

	long long ans = 1;
	int nyak = 0;
	for(int i = 1; i <= 2 * n; i++){
		if(caribapak(i) == i){
			nyak++;
		//	cout << i << " here\n";
		//	ans = (ans * 2) % mod;
		}
	}
	for(int i = 0; i < nyak / 2; i++){
		ans = (ans * 2) % mod;
	}

	cout << ans << "\n";


}

Compilation message

port_facility.cpp: In function 'void query(int, int, int, int, int, int)':
port_facility.cpp:59:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < tree[idx].size(); i++){
                  ~~^~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	166 ms	188152 KB	Output is correct
2	Correct	178 ms	188528 KB	Output is correct
3	Correct	183 ms	188528 KB	Output is correct
4	Correct	176 ms	188528 KB	Output is correct
5	Correct	175 ms	188528 KB	Output is correct
6	Correct	184 ms	188528 KB	Output is correct
7	Correct	204 ms	188528 KB	Output is correct
8	Correct	173 ms	188528 KB	Output is correct
9	Correct	176 ms	188544 KB	Output is correct
10	Correct	175 ms	188576 KB	Output is correct
11	Correct	188 ms	188576 KB	Output is correct
12	Correct	184 ms	188576 KB	Output is correct
13	Correct	189 ms	188576 KB	Output is correct
14	Correct	171 ms	188576 KB	Output is correct
15	Correct	189 ms	188576 KB	Output is correct
16	Correct	167 ms	188576 KB	Output is correct
17	Correct	197 ms	188576 KB	Output is correct
18	Correct	196 ms	188576 KB	Output is correct
19	Correct	176 ms	188576 KB	Output is correct
20	Correct	181 ms	188576 KB	Output is correct
21	Correct	200 ms	188576 KB	Output is correct
22	Correct	205 ms	188576 KB	Output is correct
23	Correct	186 ms	188576 KB	Output is correct
24	Correct	196 ms	188576 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	166 ms	188152 KB	Output is correct
2	Correct	178 ms	188528 KB	Output is correct
3	Correct	183 ms	188528 KB	Output is correct
4	Correct	176 ms	188528 KB	Output is correct
5	Correct	175 ms	188528 KB	Output is correct
6	Correct	184 ms	188528 KB	Output is correct
7	Correct	204 ms	188528 KB	Output is correct
8	Correct	173 ms	188528 KB	Output is correct
9	Correct	176 ms	188544 KB	Output is correct
10	Correct	175 ms	188576 KB	Output is correct
11	Correct	188 ms	188576 KB	Output is correct
12	Correct	184 ms	188576 KB	Output is correct
13	Correct	189 ms	188576 KB	Output is correct
14	Correct	171 ms	188576 KB	Output is correct
15	Correct	189 ms	188576 KB	Output is correct
16	Correct	167 ms	188576 KB	Output is correct
17	Correct	197 ms	188576 KB	Output is correct
18	Correct	196 ms	188576 KB	Output is correct
19	Correct	176 ms	188576 KB	Output is correct
20	Correct	181 ms	188576 KB	Output is correct
21	Correct	200 ms	188576 KB	Output is correct
22	Correct	205 ms	188576 KB	Output is correct
23	Correct	186 ms	188576 KB	Output is correct
24	Correct	196 ms	188576 KB	Output is correct
25	Correct	176 ms	188780 KB	Output is correct
26	Correct	183 ms	188780 KB	Output is correct
27	Correct	170 ms	188780 KB	Output is correct
28	Correct	184 ms	188780 KB	Output is correct
29	Correct	184 ms	188860 KB	Output is correct
30	Correct	174 ms	188860 KB	Output is correct
31	Correct	175 ms	188860 KB	Output is correct
32	Correct	167 ms	188860 KB	Output is correct
33	Correct	227 ms	188860 KB	Output is correct
34	Correct	181 ms	188860 KB	Output is correct
35	Correct	172 ms	188860 KB	Output is correct
36	Correct	171 ms	188860 KB	Output is correct
37	Correct	186 ms	188860 KB	Output is correct
38	Correct	190 ms	188860 KB	Output is correct
39	Correct	200 ms	188860 KB	Output is correct
40	Correct	174 ms	188860 KB	Output is correct
41	Correct	170 ms	188860 KB	Output is correct
42	Correct	188 ms	188860 KB	Output is correct
43	Correct	192 ms	188860 KB	Output is correct
44	Correct	200 ms	188860 KB	Output is correct

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	166 ms	188152 KB	Output is correct
2	Correct	178 ms	188528 KB	Output is correct
3	Correct	183 ms	188528 KB	Output is correct
4	Correct	176 ms	188528 KB	Output is correct
5	Correct	175 ms	188528 KB	Output is correct
6	Correct	184 ms	188528 KB	Output is correct
7	Correct	204 ms	188528 KB	Output is correct
8	Correct	173 ms	188528 KB	Output is correct
9	Correct	176 ms	188544 KB	Output is correct
10	Correct	175 ms	188576 KB	Output is correct
11	Correct	188 ms	188576 KB	Output is correct
12	Correct	184 ms	188576 KB	Output is correct
13	Correct	189 ms	188576 KB	Output is correct
14	Correct	171 ms	188576 KB	Output is correct
15	Correct	189 ms	188576 KB	Output is correct
16	Correct	167 ms	188576 KB	Output is correct
17	Correct	197 ms	188576 KB	Output is correct
18	Correct	196 ms	188576 KB	Output is correct
19	Correct	176 ms	188576 KB	Output is correct
20	Correct	181 ms	188576 KB	Output is correct
21	Correct	200 ms	188576 KB	Output is correct
22	Correct	205 ms	188576 KB	Output is correct
23	Correct	186 ms	188576 KB	Output is correct
24	Correct	196 ms	188576 KB	Output is correct
25	Correct	176 ms	188780 KB	Output is correct
26	Correct	183 ms	188780 KB	Output is correct
27	Correct	170 ms	188780 KB	Output is correct
28	Correct	184 ms	188780 KB	Output is correct
29	Correct	184 ms	188860 KB	Output is correct
30	Correct	174 ms	188860 KB	Output is correct
31	Correct	175 ms	188860 KB	Output is correct
32	Correct	167 ms	188860 KB	Output is correct
33	Correct	227 ms	188860 KB	Output is correct
34	Correct	181 ms	188860 KB	Output is correct
35	Correct	172 ms	188860 KB	Output is correct
36	Correct	171 ms	188860 KB	Output is correct
37	Correct	186 ms	188860 KB	Output is correct
38	Correct	190 ms	188860 KB	Output is correct
39	Correct	200 ms	188860 KB	Output is correct
40	Correct	174 ms	188860 KB	Output is correct
41	Correct	170 ms	188860 KB	Output is correct
42	Correct	188 ms	188860 KB	Output is correct
43	Correct	192 ms	188860 KB	Output is correct
44	Correct	200 ms	188860 KB	Output is correct
45	Correct	425 ms	204880 KB	Output is correct
46	Correct	402 ms	204880 KB	Output is correct
47	Correct	408 ms	205032 KB	Output is correct
48	Correct	395 ms	205032 KB	Output is correct
49	Correct	418 ms	205032 KB	Output is correct
50	Correct	236 ms	205032 KB	Output is correct
51	Correct	279 ms	205032 KB	Output is correct
52	Correct	372 ms	206304 KB	Output is correct
53	Correct	356 ms	206304 KB	Output is correct
54	Correct	224 ms	206304 KB	Output is correct
55	Correct	205 ms	206304 KB	Output is correct
56	Correct	235 ms	206304 KB	Output is correct
57	Correct	387 ms	206304 KB	Output is correct
58	Correct	355 ms	206304 KB	Output is correct
59	Correct	463 ms	206944 KB	Output is correct
60	Correct	350 ms	206944 KB	Output is correct
61	Correct	377 ms	206944 KB	Output is correct
62	Correct	222 ms	206944 KB	Output is correct
63	Correct	202 ms	206944 KB	Output is correct
64	Correct	225 ms	206944 KB	Output is correct
65	Correct	199 ms	206944 KB	Output is correct
66	Correct	240 ms	206944 KB	Output is correct
67	Correct	371 ms	206944 KB	Output is correct
68	Correct	417 ms	206944 KB	Output is correct
69	Correct	391 ms	206944 KB	Output is correct
70	Correct	400 ms	206944 KB	Output is correct
71	Correct	390 ms	206944 KB	Output is correct
72	Correct	363 ms	206944 KB	Output is correct
73	Correct	393 ms	206944 KB	Output is correct
74	Correct	376 ms	206944 KB	Output is correct
75	Correct	373 ms	207808 KB	Output is correct
76	Correct	315 ms	207808 KB	Output is correct
77	Correct	376 ms	207984 KB	Output is correct
78	Correct	465 ms	207984 KB	Output is correct
79	Correct	415 ms	207984 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	166 ms	188152 KB	Output is correct
2	Correct	178 ms	188528 KB	Output is correct
3	Correct	183 ms	188528 KB	Output is correct
4	Correct	176 ms	188528 KB	Output is correct
5	Correct	175 ms	188528 KB	Output is correct
6	Correct	184 ms	188528 KB	Output is correct
7	Correct	204 ms	188528 KB	Output is correct
8	Correct	173 ms	188528 KB	Output is correct
9	Correct	176 ms	188544 KB	Output is correct
10	Correct	175 ms	188576 KB	Output is correct
11	Correct	188 ms	188576 KB	Output is correct
12	Correct	184 ms	188576 KB	Output is correct
13	Correct	189 ms	188576 KB	Output is correct
14	Correct	171 ms	188576 KB	Output is correct
15	Correct	189 ms	188576 KB	Output is correct
16	Correct	167 ms	188576 KB	Output is correct
17	Correct	197 ms	188576 KB	Output is correct
18	Correct	196 ms	188576 KB	Output is correct
19	Correct	176 ms	188576 KB	Output is correct
20	Correct	181 ms	188576 KB	Output is correct
21	Correct	200 ms	188576 KB	Output is correct
22	Correct	205 ms	188576 KB	Output is correct
23	Correct	186 ms	188576 KB	Output is correct
24	Correct	196 ms	188576 KB	Output is correct
25	Correct	176 ms	188780 KB	Output is correct
26	Correct	183 ms	188780 KB	Output is correct
27	Correct	170 ms	188780 KB	Output is correct
28	Correct	184 ms	188780 KB	Output is correct
29	Correct	184 ms	188860 KB	Output is correct
30	Correct	174 ms	188860 KB	Output is correct
31	Correct	175 ms	188860 KB	Output is correct
32	Correct	167 ms	188860 KB	Output is correct
33	Correct	227 ms	188860 KB	Output is correct
34	Correct	181 ms	188860 KB	Output is correct
35	Correct	172 ms	188860 KB	Output is correct
36	Correct	171 ms	188860 KB	Output is correct
37	Correct	186 ms	188860 KB	Output is correct
38	Correct	190 ms	188860 KB	Output is correct
39	Correct	200 ms	188860 KB	Output is correct
40	Correct	174 ms	188860 KB	Output is correct
41	Correct	170 ms	188860 KB	Output is correct
42	Correct	188 ms	188860 KB	Output is correct
43	Correct	192 ms	188860 KB	Output is correct
44	Correct	200 ms	188860 KB	Output is correct
45	Correct	425 ms	204880 KB	Output is correct
46	Correct	402 ms	204880 KB	Output is correct
47	Correct	408 ms	205032 KB	Output is correct
48	Correct	395 ms	205032 KB	Output is correct
49	Correct	418 ms	205032 KB	Output is correct
50	Correct	236 ms	205032 KB	Output is correct
51	Correct	279 ms	205032 KB	Output is correct
52	Correct	372 ms	206304 KB	Output is correct
53	Correct	356 ms	206304 KB	Output is correct
54	Correct	224 ms	206304 KB	Output is correct
55	Correct	205 ms	206304 KB	Output is correct
56	Correct	235 ms	206304 KB	Output is correct
57	Correct	387 ms	206304 KB	Output is correct
58	Correct	355 ms	206304 KB	Output is correct
59	Correct	463 ms	206944 KB	Output is correct
60	Correct	350 ms	206944 KB	Output is correct
61	Correct	377 ms	206944 KB	Output is correct
62	Correct	222 ms	206944 KB	Output is correct
63	Correct	202 ms	206944 KB	Output is correct
64	Correct	225 ms	206944 KB	Output is correct
65	Correct	199 ms	206944 KB	Output is correct
66	Correct	240 ms	206944 KB	Output is correct
67	Correct	371 ms	206944 KB	Output is correct
68	Correct	417 ms	206944 KB	Output is correct
69	Correct	391 ms	206944 KB	Output is correct
70	Correct	400 ms	206944 KB	Output is correct
71	Correct	390 ms	206944 KB	Output is correct
72	Correct	363 ms	206944 KB	Output is correct
73	Correct	393 ms	206944 KB	Output is correct
74	Correct	376 ms	206944 KB	Output is correct
75	Correct	373 ms	207808 KB	Output is correct
76	Correct	315 ms	207808 KB	Output is correct
77	Correct	376 ms	207984 KB	Output is correct
78	Correct	465 ms	207984 KB	Output is correct
79	Correct	415 ms	207984 KB	Output is correct
80	Correct	2896 ms	362344 KB	Output is correct
81	Correct	2753 ms	362524 KB	Output is correct
82	Correct	2795 ms	364080 KB	Output is correct
83	Correct	2516 ms	364080 KB	Output is correct
84	Correct	2610 ms	364080 KB	Output is correct
85	Correct	1356 ms	364080 KB	Output is correct
86	Correct	1604 ms	364080 KB	Output is correct
87	Correct	2063 ms	367528 KB	Output is correct
88	Correct	2264 ms	367528 KB	Output is correct
89	Correct	605 ms	367528 KB	Output is correct
90	Correct	611 ms	367528 KB	Output is correct
91	Correct	564 ms	367528 KB	Output is correct
92	Correct	2048 ms	367528 KB	Output is correct
93	Correct	2056 ms	367528 KB	Output is correct
94	Correct	2414 ms	378424 KB	Output is correct
95	Correct	2585 ms	378424 KB	Output is correct
96	Correct	2371 ms	378424 KB	Output is correct
97	Correct	1100 ms	378424 KB	Output is correct
98	Correct	1345 ms	378424 KB	Output is correct
99	Correct	841 ms	378424 KB	Output is correct
100	Correct	536 ms	378424 KB	Output is correct
101	Correct	540 ms	378424 KB	Output is correct
102	Correct	2648 ms	378424 KB	Output is correct
103	Correct	2603 ms	378424 KB	Output is correct
104	Correct	2527 ms	378424 KB	Output is correct
105	Correct	2524 ms	378424 KB	Output is correct
106	Correct	2096 ms	378424 KB	Output is correct
107	Correct	2192 ms	378424 KB	Output is correct
108	Correct	2206 ms	378424 KB	Output is correct
109	Correct	2384 ms	378424 KB	Output is correct
110	Correct	2125 ms	383128 KB	Output is correct
111	Correct	2223 ms	383268 KB	Output is correct
112	Correct	2293 ms	383300 KB	Output is correct
113	Correct	2633 ms	383300 KB	Output is correct
114	Correct	2917 ms	383300 KB	Output is correct

Submission #70770

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 56.0 / 56.0

Subtask #4 22.0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
56.0 / 56.0

Subtask #4
22.0 / 22.0