Submission #23710

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
23710	2017-05-22T10:36:52 Z	rubabredwan	Port Facility (JOI17_port_facility)	C++14	100 / 100	3003 ms	197216 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[2*N], mx[2*N];
	void build(int _n){
		n = 2 * _n;
		for(int i = 1; i <= n; i++){
			mn[i + n - 1] = {lf[i], idx[i]};
			mx[i + n - 1] = {rf[i], idx[i]};
		}
		for(int i = n - 1; i > 0; --i){ 
			mn[i] = min(mn[i << 1], mn[i << 1 | 1]);
			mx[i] = max(mx[i << 1], mx[i << 1 | 1]);
		}
	}
	void modify(int pos){
		pos = pos - 1 + n;
		mn[pos] = {+oo, +oo};
		mx[pos] = {-oo, -oo};
		while(pos > 1){
			mn[pos >> 1] = min(mn[pos], mn[pos ^ 1]);
			mx[pos >> 1] = max(mx[pos], mx[pos ^ 1]);
			pos >>= 1;
		}
	}
	pii query_max(int l, int r){;
		--l;
		pii ret = {-oo, -oo};
		for(l += n, r += n; l < r; l >>= 1, r >>= 1){
			if(l & 1) ret = max(ret, mx[l++]);
			if(r & 1) ret = max(ret, mx[--r]);
		}
		return ret;
	}
	pii query_min(int l, int r){;
		--l;
		pii ret = {+oo, +oo};
		for(l += n, r += n; l < r; l >>= 1, r >>= 1){
			if(l & 1) ret = min(ret, mn[l++]);
			if(r & 1) ret = min(ret, mn[--r]);
		}
		return ret;
	}
} tree;

void dfs(int at){
	vis[at] = 1;
	tree.modify(st[at]);
	tree.modify(en[at]);
	while(1){
		pii f = tree.query_min(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(st[at], en[at]);
		if(f.first <= en[at]) break;
		col[f.second] = col[at] ^ 1;
		dfs(f.second);
	}
}

int t[2*N], nn;

void modify(int pos, int val){
	pos = pos - 1 + nn;
	t[pos] ^= (1 << val);
	while(pos > 1){
		t[pos >> 1] = t[pos] | t[pos ^ 1];
		pos >>= 1;
	}
}

int get(int l, int r){;
	--l;
	int ret = 0;
	for(l += nn, r += nn; l < r; l >>= 1, r >>= 1){
		if(l & 1) ret |= t[l++];
		if(r & 1) ret |= t[--r];
	}
	return ret;
}

bool check(){
	for(int i = 1; i <= n + n; i++){
		if(st[idx[i]] == i) modify(st[idx[i]], col[idx[i]]);
		else{
			int g1 = get(st[idx[i]]+1, en[idx[i]]);
			int g2 = 1 << col[idx[i]];
			if(g1 & g2) return false;
			modify(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(n);
	nn = n + n;
	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:120:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
port_facility.cpp:122: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	0 ms	134836 KB	Output is correct
2	Correct	9 ms	134836 KB	Output is correct
3	Correct	6 ms	134836 KB	Output is correct
4	Correct	3 ms	134836 KB	Output is correct
5	Correct	3 ms	134836 KB	Output is correct
6	Correct	3 ms	134836 KB	Output is correct
7	Correct	3 ms	134836 KB	Output is correct
8	Correct	6 ms	134836 KB	Output is correct
9	Correct	3 ms	134836 KB	Output is correct
10	Correct	3 ms	134836 KB	Output is correct
11	Correct	3 ms	134836 KB	Output is correct
12	Correct	6 ms	134836 KB	Output is correct
13	Correct	3 ms	134836 KB	Output is correct
14	Correct	13 ms	134836 KB	Output is correct
15	Correct	3 ms	134836 KB	Output is correct
16	Correct	9 ms	134836 KB	Output is correct
17	Correct	3 ms	134836 KB	Output is correct
18	Correct	3 ms	134836 KB	Output is correct
19	Correct	3 ms	134836 KB	Output is correct
20	Correct	6 ms	134836 KB	Output is correct
21	Correct	6 ms	134836 KB	Output is correct
22	Correct	6 ms	134836 KB	Output is correct
23	Correct	9 ms	134836 KB	Output is correct
24	Correct	0 ms	134836 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	134836 KB	Output is correct
2	Correct	9 ms	134836 KB	Output is correct
3	Correct	6 ms	134836 KB	Output is correct
4	Correct	3 ms	134836 KB	Output is correct
5	Correct	3 ms	134836 KB	Output is correct
6	Correct	3 ms	134836 KB	Output is correct
7	Correct	3 ms	134836 KB	Output is correct
8	Correct	6 ms	134836 KB	Output is correct
9	Correct	3 ms	134836 KB	Output is correct
10	Correct	3 ms	134836 KB	Output is correct
11	Correct	3 ms	134836 KB	Output is correct
12	Correct	6 ms	134836 KB	Output is correct
13	Correct	3 ms	134836 KB	Output is correct
14	Correct	13 ms	134836 KB	Output is correct
15	Correct	3 ms	134836 KB	Output is correct
16	Correct	9 ms	134836 KB	Output is correct
17	Correct	3 ms	134836 KB	Output is correct
18	Correct	3 ms	134836 KB	Output is correct
19	Correct	3 ms	134836 KB	Output is correct
20	Correct	6 ms	134836 KB	Output is correct
21	Correct	6 ms	134836 KB	Output is correct
22	Correct	6 ms	134836 KB	Output is correct
23	Correct	9 ms	134836 KB	Output is correct
24	Correct	0 ms	134836 KB	Output is correct
25	Correct	9 ms	134836 KB	Output is correct
26	Correct	6 ms	134836 KB	Output is correct
27	Correct	9 ms	134836 KB	Output is correct
28	Correct	16 ms	134836 KB	Output is correct
29	Correct	6 ms	134836 KB	Output is correct
30	Correct	13 ms	134836 KB	Output is correct
31	Correct	6 ms	134836 KB	Output is correct
32	Correct	9 ms	134836 KB	Output is correct
33	Correct	6 ms	134836 KB	Output is correct
34	Correct	13 ms	134836 KB	Output is correct
35	Correct	9 ms	134836 KB	Output is correct
36	Correct	13 ms	134836 KB	Output is correct
37	Correct	6 ms	134836 KB	Output is correct
38	Correct	6 ms	134836 KB	Output is correct
39	Correct	6 ms	134836 KB	Output is correct
40	Correct	9 ms	134836 KB	Output is correct
41	Correct	9 ms	134840 KB	Output is correct
42	Correct	9 ms	134836 KB	Output is correct
43	Correct	3 ms	134836 KB	Output is correct
44	Correct	3 ms	134836 KB	Output is correct
45	Correct	176 ms	135604 KB	Output is correct
46	Correct	176 ms	136428 KB	Output is correct
47	Correct	173 ms	135028 KB	Output is correct
48	Correct	179 ms	136396 KB	Output is correct
49	Correct	179 ms	135144 KB	Output is correct
50	Correct	166 ms	136192 KB	Output is correct
51	Correct	146 ms	136148 KB	Output is correct
52	Correct	103 ms	134836 KB	Output is correct
53	Correct	159 ms	134836 KB	Output is correct
54	Correct	139 ms	140956 KB	Output is correct
55	Correct	123 ms	137840 KB	Output is correct
56	Correct	139 ms	137840 KB	Output is correct
57	Correct	116 ms	134836 KB	Output is correct
58	Correct	126 ms	134836 KB	Output is correct
59	Correct	163 ms	134836 KB	Output is correct
60	Correct	149 ms	134836 KB	Output is correct
61	Correct	163 ms	134836 KB	Output is correct
62	Correct	159 ms	134836 KB	Output is correct
63	Correct	123 ms	134836 KB	Output is correct
64	Correct	153 ms	134836 KB	Output is correct
65	Correct	206 ms	140960 KB	Output is correct
66	Correct	229 ms	140960 KB	Output is correct
67	Correct	166 ms	137832 KB	Output is correct
68	Correct	173 ms	137832 KB	Output is correct
69	Correct	176 ms	137492 KB	Output is correct
70	Correct	179 ms	137484 KB	Output is correct
71	Correct	163 ms	140964 KB	Output is correct
72	Correct	156 ms	140956 KB	Output is correct
73	Correct	163 ms	138876 KB	Output is correct
74	Correct	153 ms	138876 KB	Output is correct
75	Correct	129 ms	138432 KB	Output is correct
76	Correct	119 ms	140964 KB	Output is correct
77	Correct	109 ms	140964 KB	Output is correct
78	Correct	149 ms	136236 KB	Output is correct
79	Correct	163 ms	135664 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	134836 KB	Output is correct
2	Correct	9 ms	134836 KB	Output is correct
3	Correct	6 ms	134836 KB	Output is correct
4	Correct	3 ms	134836 KB	Output is correct
5	Correct	3 ms	134836 KB	Output is correct
6	Correct	3 ms	134836 KB	Output is correct
7	Correct	3 ms	134836 KB	Output is correct
8	Correct	6 ms	134836 KB	Output is correct
9	Correct	3 ms	134836 KB	Output is correct
10	Correct	3 ms	134836 KB	Output is correct
11	Correct	3 ms	134836 KB	Output is correct
12	Correct	6 ms	134836 KB	Output is correct
13	Correct	3 ms	134836 KB	Output is correct
14	Correct	13 ms	134836 KB	Output is correct
15	Correct	3 ms	134836 KB	Output is correct
16	Correct	9 ms	134836 KB	Output is correct
17	Correct	3 ms	134836 KB	Output is correct
18	Correct	3 ms	134836 KB	Output is correct
19	Correct	3 ms	134836 KB	Output is correct
20	Correct	6 ms	134836 KB	Output is correct
21	Correct	6 ms	134836 KB	Output is correct
22	Correct	6 ms	134836 KB	Output is correct
23	Correct	9 ms	134836 KB	Output is correct
24	Correct	0 ms	134836 KB	Output is correct
25	Correct	9 ms	134836 KB	Output is correct
26	Correct	6 ms	134836 KB	Output is correct
27	Correct	9 ms	134836 KB	Output is correct
28	Correct	16 ms	134836 KB	Output is correct
29	Correct	6 ms	134836 KB	Output is correct
30	Correct	13 ms	134836 KB	Output is correct
31	Correct	6 ms	134836 KB	Output is correct
32	Correct	9 ms	134836 KB	Output is correct
33	Correct	6 ms	134836 KB	Output is correct
34	Correct	13 ms	134836 KB	Output is correct
35	Correct	9 ms	134836 KB	Output is correct
36	Correct	13 ms	134836 KB	Output is correct
37	Correct	6 ms	134836 KB	Output is correct
38	Correct	6 ms	134836 KB	Output is correct
39	Correct	6 ms	134836 KB	Output is correct
40	Correct	9 ms	134836 KB	Output is correct
41	Correct	9 ms	134840 KB	Output is correct
42	Correct	9 ms	134836 KB	Output is correct
43	Correct	3 ms	134836 KB	Output is correct
44	Correct	3 ms	134836 KB	Output is correct
45	Correct	176 ms	135604 KB	Output is correct
46	Correct	176 ms	136428 KB	Output is correct
47	Correct	173 ms	135028 KB	Output is correct
48	Correct	179 ms	136396 KB	Output is correct
49	Correct	179 ms	135144 KB	Output is correct
50	Correct	166 ms	136192 KB	Output is correct
51	Correct	146 ms	136148 KB	Output is correct
52	Correct	103 ms	134836 KB	Output is correct
53	Correct	159 ms	134836 KB	Output is correct
54	Correct	139 ms	140956 KB	Output is correct
55	Correct	123 ms	137840 KB	Output is correct
56	Correct	139 ms	137840 KB	Output is correct
57	Correct	116 ms	134836 KB	Output is correct
58	Correct	126 ms	134836 KB	Output is correct
59	Correct	163 ms	134836 KB	Output is correct
60	Correct	149 ms	134836 KB	Output is correct
61	Correct	163 ms	134836 KB	Output is correct
62	Correct	159 ms	134836 KB	Output is correct
63	Correct	123 ms	134836 KB	Output is correct
64	Correct	153 ms	134836 KB	Output is correct
65	Correct	206 ms	140960 KB	Output is correct
66	Correct	229 ms	140960 KB	Output is correct
67	Correct	166 ms	137832 KB	Output is correct
68	Correct	173 ms	137832 KB	Output is correct
69	Correct	176 ms	137492 KB	Output is correct
70	Correct	179 ms	137484 KB	Output is correct
71	Correct	163 ms	140964 KB	Output is correct
72	Correct	156 ms	140956 KB	Output is correct
73	Correct	163 ms	138876 KB	Output is correct
74	Correct	153 ms	138876 KB	Output is correct
75	Correct	129 ms	138432 KB	Output is correct
76	Correct	119 ms	140964 KB	Output is correct
77	Correct	109 ms	140964 KB	Output is correct
78	Correct	149 ms	136236 KB	Output is correct
79	Correct	163 ms	135664 KB	Output is correct
80	Correct	2323 ms	138580 KB	Output is correct
81	Correct	2239 ms	137804 KB	Output is correct
82	Correct	2276 ms	135268 KB	Output is correct
83	Correct	2246 ms	137920 KB	Output is correct
84	Correct	2016 ms	138580 KB	Output is correct
85	Correct	2066 ms	135712 KB	Output is correct
86	Correct	1953 ms	137948 KB	Output is correct
87	Correct	1639 ms	134836 KB	Output is correct
88	Correct	2356 ms	134836 KB	Output is correct
89	Correct	1966 ms	197212 KB	Output is correct
90	Correct	1983 ms	165960 KB	Output is correct
91	Correct	1869 ms	165956 KB	Output is correct
92	Correct	1923 ms	134836 KB	Output is correct
93	Correct	1643 ms	134836 KB	Output is correct
94	Correct	2069 ms	134836 KB	Output is correct
95	Correct	1906 ms	134836 KB	Output is correct
96	Correct	2043 ms	134836 KB	Output is correct
97	Correct	1793 ms	134836 KB	Output is correct
98	Correct	1783 ms	134836 KB	Output is correct
99	Correct	1843 ms	134836 KB	Output is correct
100	Correct	3003 ms	197212 KB	Output is correct
101	Correct	2989 ms	197208 KB	Output is correct
102	Correct	2459 ms	165984 KB	Output is correct
103	Correct	2389 ms	165936 KB	Output is correct
104	Correct	2333 ms	162488 KB	Output is correct
105	Correct	2453 ms	162488 KB	Output is correct
106	Correct	2263 ms	197216 KB	Output is correct
107	Correct	2196 ms	197212 KB	Output is correct
108	Correct	2193 ms	176376 KB	Output is correct
109	Correct	2013 ms	176376 KB	Output is correct
110	Correct	1513 ms	195944 KB	Output is correct
111	Correct	1506 ms	197212 KB	Output is correct
112	Correct	1293 ms	197212 KB	Output is correct
113	Correct	2163 ms	135276 KB	Output is correct
114	Correct	2189 ms	137736 KB	Output is correct

Submission #23710

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