Submission #23708

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
23708	2017-05-22T09:52:05 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;

void scanF(int &x){
    register int c = getchar_unlocked();
    x = 0;
    for(;(c<48 || c>57);c = getchar_unlocked());
    for(;c>47 && c<58;c = getchar_unlocked()) {x = (x<<1) + (x<<3) + c - 48;}
}

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(n);
	for(int i=1;i<=n;i++){
		scanF(st[i]);
		scanF(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;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	259876 KB	Output is correct
2	Correct	9 ms	259876 KB	Output is correct
3	Correct	33 ms	259876 KB	Output is correct
4	Correct	26 ms	259876 KB	Output is correct
5	Correct	23 ms	259876 KB	Output is correct
6	Correct	29 ms	259876 KB	Output is correct
7	Correct	9 ms	259876 KB	Output is correct
8	Correct	23 ms	259876 KB	Output is correct
9	Correct	26 ms	259876 KB	Output is correct
10	Correct	19 ms	259876 KB	Output is correct
11	Correct	23 ms	259876 KB	Output is correct
12	Correct	16 ms	259876 KB	Output is correct
13	Correct	16 ms	259876 KB	Output is correct
14	Correct	23 ms	259876 KB	Output is correct
15	Correct	16 ms	259876 KB	Output is correct
16	Correct	16 ms	259876 KB	Output is correct
17	Correct	19 ms	259876 KB	Output is correct
18	Correct	19 ms	259876 KB	Output is correct
19	Correct	33 ms	259876 KB	Output is correct
20	Correct	16 ms	259876 KB	Output is correct
21	Correct	13 ms	259876 KB	Output is correct
22	Correct	16 ms	259876 KB	Output is correct
23	Correct	16 ms	259876 KB	Output is correct
24	Correct	23 ms	259876 KB	Output is correct
25	Correct	19 ms	260000 KB	Output is correct
26	Correct	23 ms	260028 KB	Output is correct
27	Correct	19 ms	259968 KB	Output is correct
28	Correct	33 ms	260008 KB	Output is correct
29	Correct	26 ms	259996 KB	Output is correct
30	Correct	29 ms	260008 KB	Output is correct
31	Correct	36 ms	260000 KB	Output is correct
32	Correct	23 ms	260036 KB	Output is correct
33	Correct	19 ms	259888 KB	Output is correct
34	Correct	29 ms	260016 KB	Output is correct
35	Correct	33 ms	259876 KB	Output is correct
36	Correct	29 ms	259876 KB	Output is correct
37	Correct	43 ms	260284 KB	Output is correct
38	Correct	16 ms	260020 KB	Output is correct
39	Correct	13 ms	259876 KB	Output is correct
40	Correct	23 ms	259876 KB	Output is correct
41	Correct	23 ms	260284 KB	Output is correct
42	Correct	19 ms	260284 KB	Output is correct
43	Correct	13 ms	260284 KB	Output is correct
44	Correct	19 ms	260280 KB	Output is correct
45	Correct	276 ms	263532 KB	Output is correct
46	Correct	306 ms	267036 KB	Output is correct
47	Correct	293 ms	261104 KB	Output is correct
48	Correct	289 ms	266932 KB	Output is correct
49	Correct	319 ms	261584 KB	Output is correct
50	Correct	269 ms	266060 KB	Output is correct
51	Correct	246 ms	265864 KB	Output is correct
52	Correct	256 ms	259876 KB	Output is correct
53	Correct	333 ms	259876 KB	Output is correct
54	Correct	269 ms	286312 KB	Output is correct
55	Correct	213 ms	273028 KB	Output is correct
56	Correct	229 ms	273028 KB	Output is correct
57	Correct	226 ms	259876 KB	Output is correct
58	Correct	216 ms	259876 KB	Output is correct
59	Correct	333 ms	259876 KB	Output is correct
60	Correct	339 ms	259876 KB	Output is correct
61	Correct	319 ms	259876 KB	Output is correct
62	Correct	239 ms	259876 KB	Output is correct
63	Correct	256 ms	259876 KB	Output is correct
64	Correct	233 ms	259876 KB	Output is correct
65	Correct	389 ms	286312 KB	Output is correct
66	Correct	396 ms	286308 KB	Output is correct
67	Correct	333 ms	273012 KB	Output is correct
68	Correct	313 ms	273016 KB	Output is correct
69	Correct	309 ms	271580 KB	Output is correct
70	Correct	269 ms	271532 KB	Output is correct
71	Correct	279 ms	286316 KB	Output is correct
72	Correct	309 ms	286312 KB	Output is correct
73	Correct	303 ms	277464 KB	Output is correct
74	Correct	346 ms	277464 KB	Output is correct
75	Correct	229 ms	275556 KB	Output is correct
76	Correct	253 ms	286312 KB	Output is correct
77	Correct	226 ms	286316 KB	Output is correct
78	Correct	349 ms	266212 KB	Output is correct
79	Correct	306 ms	263792 KB	Output is correct

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	259876 KB	Output is correct
2	Correct	9 ms	259876 KB	Output is correct
3	Correct	33 ms	259876 KB	Output is correct
4	Correct	26 ms	259876 KB	Output is correct
5	Correct	23 ms	259876 KB	Output is correct
6	Correct	29 ms	259876 KB	Output is correct
7	Correct	9 ms	259876 KB	Output is correct
8	Correct	23 ms	259876 KB	Output is correct
9	Correct	26 ms	259876 KB	Output is correct
10	Correct	19 ms	259876 KB	Output is correct
11	Correct	23 ms	259876 KB	Output is correct
12	Correct	16 ms	259876 KB	Output is correct
13	Correct	16 ms	259876 KB	Output is correct
14	Correct	23 ms	259876 KB	Output is correct
15	Correct	16 ms	259876 KB	Output is correct
16	Correct	16 ms	259876 KB	Output is correct
17	Correct	19 ms	259876 KB	Output is correct
18	Correct	19 ms	259876 KB	Output is correct
19	Correct	33 ms	259876 KB	Output is correct
20	Correct	16 ms	259876 KB	Output is correct
21	Correct	13 ms	259876 KB	Output is correct
22	Correct	16 ms	259876 KB	Output is correct
23	Correct	16 ms	259876 KB	Output is correct
24	Correct	23 ms	259876 KB	Output is correct
25	Correct	19 ms	260000 KB	Output is correct
26	Correct	23 ms	260028 KB	Output is correct
27	Correct	19 ms	259968 KB	Output is correct
28	Correct	33 ms	260008 KB	Output is correct
29	Correct	26 ms	259996 KB	Output is correct
30	Correct	29 ms	260008 KB	Output is correct
31	Correct	36 ms	260000 KB	Output is correct
32	Correct	23 ms	260036 KB	Output is correct
33	Correct	19 ms	259888 KB	Output is correct
34	Correct	29 ms	260016 KB	Output is correct
35	Correct	33 ms	259876 KB	Output is correct
36	Correct	29 ms	259876 KB	Output is correct
37	Correct	43 ms	260284 KB	Output is correct
38	Correct	16 ms	260020 KB	Output is correct
39	Correct	13 ms	259876 KB	Output is correct
40	Correct	23 ms	259876 KB	Output is correct
41	Correct	23 ms	260284 KB	Output is correct
42	Correct	19 ms	260284 KB	Output is correct
43	Correct	13 ms	260284 KB	Output is correct
44	Correct	19 ms	260280 KB	Output is correct
45	Correct	276 ms	263532 KB	Output is correct
46	Correct	306 ms	267036 KB	Output is correct
47	Correct	293 ms	261104 KB	Output is correct
48	Correct	289 ms	266932 KB	Output is correct
49	Correct	319 ms	261584 KB	Output is correct
50	Correct	269 ms	266060 KB	Output is correct
51	Correct	246 ms	265864 KB	Output is correct
52	Correct	256 ms	259876 KB	Output is correct
53	Correct	333 ms	259876 KB	Output is correct
54	Correct	269 ms	286312 KB	Output is correct
55	Correct	213 ms	273028 KB	Output is correct
56	Correct	229 ms	273028 KB	Output is correct
57	Correct	226 ms	259876 KB	Output is correct
58	Correct	216 ms	259876 KB	Output is correct
59	Correct	333 ms	259876 KB	Output is correct
60	Correct	339 ms	259876 KB	Output is correct
61	Correct	319 ms	259876 KB	Output is correct
62	Correct	239 ms	259876 KB	Output is correct
63	Correct	256 ms	259876 KB	Output is correct
64	Correct	233 ms	259876 KB	Output is correct
65	Correct	389 ms	286312 KB	Output is correct
66	Correct	396 ms	286308 KB	Output is correct
67	Correct	333 ms	273012 KB	Output is correct
68	Correct	313 ms	273016 KB	Output is correct
69	Correct	309 ms	271580 KB	Output is correct
70	Correct	269 ms	271532 KB	Output is correct
71	Correct	279 ms	286316 KB	Output is correct
72	Correct	309 ms	286312 KB	Output is correct
73	Correct	303 ms	277464 KB	Output is correct
74	Correct	346 ms	277464 KB	Output is correct
75	Correct	229 ms	275556 KB	Output is correct
76	Correct	253 ms	286312 KB	Output is correct
77	Correct	226 ms	286316 KB	Output is correct
78	Correct	349 ms	266212 KB	Output is correct
79	Correct	306 ms	263792 KB	Output is correct
80	Execution timed out	3500 ms	276212 KB	Execution timed out
81	Halted	0 ms	0 KB	-

Submission #23708

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