Submission #23707

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
23707	2017-05-22T09:37:53 Z	rubabredwan	Port Facility (JOI17_port_facility)	C++14	78 / 100	3500 ms	286316 KB

port_facility

/*  Bismillahir Rahmanir Rahim  */

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

const int N = 2000005;
const int oo = 1e9;

int n, st[N], en[N];
int lf[N], rf[N], idx[N];
int col[N], vis[N];

struct segtree{
	int n; 
	pii mn[N*4], mx[N*4];
	void build(int b, int e, int node){
		if(b == e){
			mn[node] = {lf[b], idx[b]};
			mx[node] = {rf[b], idx[b]};
			return;
		}
		int mid = (b + e) / 2, l = 2 * node, h = l + 1;
		build(b, mid, l);
		build(mid+1, e, h);
		mn[node] = min(mn[l], mn[h]);
		mx[node] = max(mx[l], mx[h]);
	}
	void update(int b, int e, int node, int pos){
		if(b == e){
			mx[node] = {-oo, -oo};
			mn[node] = {+oo, +oo};
			return;
		}
		int mid = (b + e) / 2, l = 2 * node, h = l + 1;
		if(pos <= mid) update(b, mid, l, pos);
		else update(mid+1, e, h, pos);
		mn[node] = min(mn[l], mn[h]);
		mx[node] = max(mx[l], mx[h]);
	}
	pii query_max(int b, int e, int node, int x, int y){
		if(y < b || e < x) return {-oo, -oo};
		if(b >= x && e <= y) return mx[node];
		int mid = (b + e) / 2, l = 2 * node, h = l + 1;
		return max(query_max(b, mid, l, x, y), query_max(mid+1, e, h, x, y));
	}
	pii query_min(int b, int e, int node, int x, int y){
		if(y < b || e < x) return {+oo, +oo};
		if(b >= x && e <= y) return mn[node];
		int mid = (b + e) / 2, l = 2 * node, h = l + 1;
		return min(query_min(b, mid, l, x, y), query_min(mid+1, e, h, x, y));
	}
} tree;

void dfs(int at){
	vis[at] = 1;
	tree.update(1, n+n, 1, st[at]);
	tree.update(1, n+n, 1, en[at]);
	while(1){
		pii f = tree.query_min(1, n+n, 1, st[at], en[at]);
		if(f.first >= st[at]) break;
		col[f.second] = col[at] ^ 1;
		dfs(f.second);
	}
	while(1){
		pii f = tree.query_max(1, n+n, 1, st[at], en[at]);
		if(f.first <= en[at]) break;
		col[f.second] = col[at] ^ 1;
		dfs(f.second);
	}
}

vector<int>g[N];
int flag;
int t[N*4];

void update(int b, int e, int node, int pos, int val){
	if(b == e){
		t[node] ^= (1 << val);
		return;
	}
	int mid = (b + e) / 2, l = 2 * node, h = l + 1;
	if(pos <= mid) update(b, mid, l, pos, val);
	else update(mid+1, e, h, pos, val);
	t[node] = t[l] | t[h];
}

int get(int b, int e, int node, int x, int y){
	if(y < b ||e < x) return 0;
	if(b >= x && e <= y) return t[node];
	int mid = (b + e) / 2, l = 2 * node, h = l + 1;
	return get(b, mid, l, x, y) | get(mid+1, e, h, x, y);
}

bool check(){
	for(int i=1;i<=n+n;i++){
        if(st[idx[i]] == i){
            update(1, n+n, 1, st[idx[i]], col[idx[i]]);
        }
        else{
			int g1 = get(1, n+n, 1, st[idx[i]]+1, en[idx[i]]);
			int g2 = 1 << col[idx[i]];
			if(g1 & g2) return false;
			update(1, n+n, 1, st[idx[i]], col[idx[i]]);
		}
	}
	return true;
}

int main(){
	scanf("%d", &n);
	for(int i=1;i<=n;i++){
		scanf("%d %d", &st[i], &en[i]);
		lf[en[i]] = st[i];
		lf[st[i]] = +oo;
		rf[st[i]] = en[i];
		rf[en[i]] = -oo;
		idx[st[i]] = i;
		idx[en[i]] = i;
	}
	tree.build(1, n+n, 1);
	int comp = 0;
	for(int i=1;i<=n;i++){
		if(!vis[i]){
			dfs(i);
			++comp;
		}
	}
	if(check() == false) printf("0\n");
	else{
		long long ret = 1LL;
		long long mod = 1e9 + 7;
		for(int i=1;i<=comp;i++){
			ret *= 2LL;
			ret %= mod;
		}
		printf("%lld\n", ret);
	}
	return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:113:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
port_facility.cpp:115:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &st[i], &en[i]);
                                 ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	259876 KB	Output is correct
2	Correct	19 ms	259876 KB	Output is correct
3	Correct	13 ms	259876 KB	Output is correct
4	Correct	23 ms	259876 KB	Output is correct
5	Correct	29 ms	259876 KB	Output is correct
6	Correct	16 ms	259876 KB	Output is correct
7	Correct	19 ms	259876 KB	Output is correct
8	Correct	26 ms	259876 KB	Output is correct
9	Correct	23 ms	259876 KB	Output is correct
10	Correct	19 ms	259876 KB	Output is correct
11	Correct	6 ms	259876 KB	Output is correct
12	Correct	19 ms	259876 KB	Output is correct
13	Correct	9 ms	259876 KB	Output is correct
14	Correct	19 ms	259876 KB	Output is correct
15	Correct	9 ms	259876 KB	Output is correct
16	Correct	16 ms	259876 KB	Output is correct
17	Correct	16 ms	259876 KB	Output is correct
18	Correct	19 ms	259876 KB	Output is correct
19	Correct	23 ms	259876 KB	Output is correct
20	Correct	23 ms	259876 KB	Output is correct
21	Correct	26 ms	259876 KB	Output is correct
22	Correct	26 ms	259876 KB	Output is correct
23	Correct	19 ms	259876 KB	Output is correct
24	Correct	13 ms	259876 KB	Output is correct
25	Correct	36 ms	260004 KB	Output is correct
26	Correct	23 ms	260028 KB	Output is correct
27	Correct	19 ms	259968 KB	Output is correct
28	Correct	19 ms	260004 KB	Output is correct
29	Correct	16 ms	260000 KB	Output is correct
30	Correct	33 ms	260008 KB	Output is correct
31	Correct	26 ms	260000 KB	Output is correct
32	Correct	26 ms	260036 KB	Output is correct
33	Correct	16 ms	259884 KB	Output is correct
34	Correct	23 ms	260020 KB	Output is correct
35	Correct	13 ms	259876 KB	Output is correct
36	Correct	29 ms	259876 KB	Output is correct
37	Correct	36 ms	260284 KB	Output is correct
38	Correct	19 ms	260020 KB	Output is correct
39	Correct	33 ms	259876 KB	Output is correct
40	Correct	23 ms	259876 KB	Output is correct
41	Correct	33 ms	260284 KB	Output is correct
42	Correct	23 ms	260280 KB	Output is correct
43	Correct	16 ms	260284 KB	Output is correct
44	Correct	23 ms	260280 KB	Output is correct

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	259876 KB	Output is correct
2	Correct	19 ms	259876 KB	Output is correct
3	Correct	13 ms	259876 KB	Output is correct
4	Correct	23 ms	259876 KB	Output is correct
5	Correct	29 ms	259876 KB	Output is correct
6	Correct	16 ms	259876 KB	Output is correct
7	Correct	19 ms	259876 KB	Output is correct
8	Correct	26 ms	259876 KB	Output is correct
9	Correct	23 ms	259876 KB	Output is correct
10	Correct	19 ms	259876 KB	Output is correct
11	Correct	6 ms	259876 KB	Output is correct
12	Correct	19 ms	259876 KB	Output is correct
13	Correct	9 ms	259876 KB	Output is correct
14	Correct	19 ms	259876 KB	Output is correct
15	Correct	9 ms	259876 KB	Output is correct
16	Correct	16 ms	259876 KB	Output is correct
17	Correct	16 ms	259876 KB	Output is correct
18	Correct	19 ms	259876 KB	Output is correct
19	Correct	23 ms	259876 KB	Output is correct
20	Correct	23 ms	259876 KB	Output is correct
21	Correct	26 ms	259876 KB	Output is correct
22	Correct	26 ms	259876 KB	Output is correct
23	Correct	19 ms	259876 KB	Output is correct
24	Correct	13 ms	259876 KB	Output is correct
25	Correct	36 ms	260004 KB	Output is correct
26	Correct	23 ms	260028 KB	Output is correct
27	Correct	19 ms	259968 KB	Output is correct
28	Correct	19 ms	260004 KB	Output is correct
29	Correct	16 ms	260000 KB	Output is correct
30	Correct	33 ms	260008 KB	Output is correct
31	Correct	26 ms	260000 KB	Output is correct
32	Correct	26 ms	260036 KB	Output is correct
33	Correct	16 ms	259884 KB	Output is correct
34	Correct	23 ms	260020 KB	Output is correct
35	Correct	13 ms	259876 KB	Output is correct
36	Correct	29 ms	259876 KB	Output is correct
37	Correct	36 ms	260284 KB	Output is correct
38	Correct	19 ms	260020 KB	Output is correct
39	Correct	33 ms	259876 KB	Output is correct
40	Correct	23 ms	259876 KB	Output is correct
41	Correct	33 ms	260284 KB	Output is correct
42	Correct	23 ms	260280 KB	Output is correct
43	Correct	16 ms	260284 KB	Output is correct
44	Correct	23 ms	260280 KB	Output is correct
45	Correct	363 ms	263536 KB	Output is correct
46	Correct	339 ms	267032 KB	Output is correct
47	Correct	329 ms	261104 KB	Output is correct
48	Correct	343 ms	266936 KB	Output is correct
49	Correct	339 ms	261588 KB	Output is correct
50	Correct	336 ms	266064 KB	Output is correct
51	Correct	296 ms	265868 KB	Output is correct
52	Correct	239 ms	259876 KB	Output is correct
53	Correct	389 ms	259876 KB	Output is correct
54	Correct	293 ms	286312 KB	Output is correct
55	Correct	309 ms	273032 KB	Output is correct
56	Correct	299 ms	273036 KB	Output is correct
57	Correct	279 ms	259876 KB	Output is correct
58	Correct	226 ms	259876 KB	Output is correct
59	Correct	349 ms	259876 KB	Output is correct
60	Correct	336 ms	259876 KB	Output is correct
61	Correct	316 ms	259876 KB	Output is correct
62	Correct	286 ms	259876 KB	Output is correct
63	Correct	273 ms	259876 KB	Output is correct
64	Correct	313 ms	259876 KB	Output is correct
65	Correct	403 ms	286308 KB	Output is correct
66	Correct	413 ms	286312 KB	Output is correct
67	Correct	373 ms	273008 KB	Output is correct
68	Correct	336 ms	273016 KB	Output is correct
69	Correct	376 ms	271584 KB	Output is correct
70	Correct	389 ms	271532 KB	Output is correct
71	Correct	333 ms	286308 KB	Output is correct
72	Correct	323 ms	286316 KB	Output is correct
73	Correct	273 ms	277460 KB	Output is correct
74	Correct	343 ms	277460 KB	Output is correct
75	Correct	273 ms	275556 KB	Output is correct
76	Correct	293 ms	286312 KB	Output is correct
77	Correct	219 ms	286312 KB	Output is correct
78	Correct	373 ms	266212 KB	Output is correct
79	Correct	346 ms	263792 KB	Output is correct

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	259876 KB	Output is correct
2	Correct	19 ms	259876 KB	Output is correct
3	Correct	13 ms	259876 KB	Output is correct
4	Correct	23 ms	259876 KB	Output is correct
5	Correct	29 ms	259876 KB	Output is correct
6	Correct	16 ms	259876 KB	Output is correct
7	Correct	19 ms	259876 KB	Output is correct
8	Correct	26 ms	259876 KB	Output is correct
9	Correct	23 ms	259876 KB	Output is correct
10	Correct	19 ms	259876 KB	Output is correct
11	Correct	6 ms	259876 KB	Output is correct
12	Correct	19 ms	259876 KB	Output is correct
13	Correct	9 ms	259876 KB	Output is correct
14	Correct	19 ms	259876 KB	Output is correct
15	Correct	9 ms	259876 KB	Output is correct
16	Correct	16 ms	259876 KB	Output is correct
17	Correct	16 ms	259876 KB	Output is correct
18	Correct	19 ms	259876 KB	Output is correct
19	Correct	23 ms	259876 KB	Output is correct
20	Correct	23 ms	259876 KB	Output is correct
21	Correct	26 ms	259876 KB	Output is correct
22	Correct	26 ms	259876 KB	Output is correct
23	Correct	19 ms	259876 KB	Output is correct
24	Correct	13 ms	259876 KB	Output is correct
25	Correct	36 ms	260004 KB	Output is correct
26	Correct	23 ms	260028 KB	Output is correct
27	Correct	19 ms	259968 KB	Output is correct
28	Correct	19 ms	260004 KB	Output is correct
29	Correct	16 ms	260000 KB	Output is correct
30	Correct	33 ms	260008 KB	Output is correct
31	Correct	26 ms	260000 KB	Output is correct
32	Correct	26 ms	260036 KB	Output is correct
33	Correct	16 ms	259884 KB	Output is correct
34	Correct	23 ms	260020 KB	Output is correct
35	Correct	13 ms	259876 KB	Output is correct
36	Correct	29 ms	259876 KB	Output is correct
37	Correct	36 ms	260284 KB	Output is correct
38	Correct	19 ms	260020 KB	Output is correct
39	Correct	33 ms	259876 KB	Output is correct
40	Correct	23 ms	259876 KB	Output is correct
41	Correct	33 ms	260284 KB	Output is correct
42	Correct	23 ms	260280 KB	Output is correct
43	Correct	16 ms	260284 KB	Output is correct
44	Correct	23 ms	260280 KB	Output is correct
45	Correct	363 ms	263536 KB	Output is correct
46	Correct	339 ms	267032 KB	Output is correct
47	Correct	329 ms	261104 KB	Output is correct
48	Correct	343 ms	266936 KB	Output is correct
49	Correct	339 ms	261588 KB	Output is correct
50	Correct	336 ms	266064 KB	Output is correct
51	Correct	296 ms	265868 KB	Output is correct
52	Correct	239 ms	259876 KB	Output is correct
53	Correct	389 ms	259876 KB	Output is correct
54	Correct	293 ms	286312 KB	Output is correct
55	Correct	309 ms	273032 KB	Output is correct
56	Correct	299 ms	273036 KB	Output is correct
57	Correct	279 ms	259876 KB	Output is correct
58	Correct	226 ms	259876 KB	Output is correct
59	Correct	349 ms	259876 KB	Output is correct
60	Correct	336 ms	259876 KB	Output is correct
61	Correct	316 ms	259876 KB	Output is correct
62	Correct	286 ms	259876 KB	Output is correct
63	Correct	273 ms	259876 KB	Output is correct
64	Correct	313 ms	259876 KB	Output is correct
65	Correct	403 ms	286308 KB	Output is correct
66	Correct	413 ms	286312 KB	Output is correct
67	Correct	373 ms	273008 KB	Output is correct
68	Correct	336 ms	273016 KB	Output is correct
69	Correct	376 ms	271584 KB	Output is correct
70	Correct	389 ms	271532 KB	Output is correct
71	Correct	333 ms	286308 KB	Output is correct
72	Correct	323 ms	286316 KB	Output is correct
73	Correct	273 ms	277460 KB	Output is correct
74	Correct	343 ms	277460 KB	Output is correct
75	Correct	273 ms	275556 KB	Output is correct
76	Correct	293 ms	286312 KB	Output is correct
77	Correct	219 ms	286312 KB	Output is correct
78	Correct	373 ms	266212 KB	Output is correct
79	Correct	346 ms	263792 KB	Output is correct
80	Execution timed out	3500 ms	276212 KB	Execution timed out
81	Halted	0 ms	0 KB	-

Submission #23707

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