Submission #23706

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
23706	2017-05-22T08:25:12 Z	rubabredwan	Port Facility (JOI17_port_facility)	C++14	22 / 100	3500 ms	246536 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;

void bfs(int at){
	vis[at] = 1;
	for(auto u : g[at]){
		if(!vis[u]){
			col[u] = col[at] ^ 1;
			bfs(u);
		}
		if(col[u] == col[at]) flag = 1;
	}
}

bool brute(){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(st[j] < st[i] && st[i] < en[j] && en[i] > en[j]){
				g[i].push_back(j);
				g[j].push_back(i);
			}
		}
	}
	memset(vis, 0, sizeof(vis));
	memset(col, 0, sizeof(col));
	for(int i=1;i<=n;i++){
		if(vis[i]) continue;
		col[i] = 0;
		bfs(i);
	}
	if(flag) return false;
	else 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(!brute()) 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:110:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
port_facility.cpp:112: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	19 ms	228624 KB	Output is correct
2	Correct	16 ms	228624 KB	Output is correct
3	Correct	33 ms	228624 KB	Output is correct
4	Correct	19 ms	228624 KB	Output is correct
5	Correct	29 ms	228624 KB	Output is correct
6	Correct	23 ms	228624 KB	Output is correct
7	Correct	19 ms	228624 KB	Output is correct
8	Correct	23 ms	228624 KB	Output is correct
9	Correct	23 ms	228624 KB	Output is correct
10	Correct	16 ms	228624 KB	Output is correct
11	Correct	33 ms	228624 KB	Output is correct
12	Correct	33 ms	228624 KB	Output is correct
13	Correct	13 ms	228624 KB	Output is correct
14	Correct	23 ms	228624 KB	Output is correct
15	Correct	23 ms	228624 KB	Output is correct
16	Correct	19 ms	228624 KB	Output is correct
17	Correct	19 ms	228624 KB	Output is correct
18	Correct	26 ms	228624 KB	Output is correct
19	Correct	19 ms	228624 KB	Output is correct
20	Correct	33 ms	228624 KB	Output is correct
21	Correct	23 ms	228624 KB	Output is correct
22	Correct	26 ms	228624 KB	Output is correct
23	Correct	36 ms	228624 KB	Output is correct
24	Correct	19 ms	228624 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	228624 KB	Output is correct
2	Correct	16 ms	228624 KB	Output is correct
3	Correct	33 ms	228624 KB	Output is correct
4	Correct	19 ms	228624 KB	Output is correct
5	Correct	29 ms	228624 KB	Output is correct
6	Correct	23 ms	228624 KB	Output is correct
7	Correct	19 ms	228624 KB	Output is correct
8	Correct	23 ms	228624 KB	Output is correct
9	Correct	23 ms	228624 KB	Output is correct
10	Correct	16 ms	228624 KB	Output is correct
11	Correct	33 ms	228624 KB	Output is correct
12	Correct	33 ms	228624 KB	Output is correct
13	Correct	13 ms	228624 KB	Output is correct
14	Correct	23 ms	228624 KB	Output is correct
15	Correct	23 ms	228624 KB	Output is correct
16	Correct	19 ms	228624 KB	Output is correct
17	Correct	19 ms	228624 KB	Output is correct
18	Correct	26 ms	228624 KB	Output is correct
19	Correct	19 ms	228624 KB	Output is correct
20	Correct	33 ms	228624 KB	Output is correct
21	Correct	23 ms	228624 KB	Output is correct
22	Correct	26 ms	228624 KB	Output is correct
23	Correct	36 ms	228624 KB	Output is correct
24	Correct	19 ms	228624 KB	Output is correct
25	Correct	56 ms	229028 KB	Output is correct
26	Correct	59 ms	229192 KB	Output is correct
27	Correct	59 ms	228996 KB	Output is correct
28	Correct	69 ms	229304 KB	Output is correct
29	Correct	56 ms	229160 KB	Output is correct
30	Correct	56 ms	229300 KB	Output is correct
31	Correct	63 ms	229152 KB	Output is correct
32	Correct	43 ms	229064 KB	Output is correct
33	Correct	46 ms	228904 KB	Output is correct
34	Correct	56 ms	229040 KB	Output is correct
35	Correct	53 ms	228624 KB	Output is correct
36	Correct	46 ms	228624 KB	Output is correct
37	Correct	126 ms	246536 KB	Output is correct
38	Correct	79 ms	237492 KB	Output is correct
39	Correct	56 ms	228756 KB	Output is correct
40	Correct	49 ms	228624 KB	Output is correct
41	Correct	76 ms	237112 KB	Output is correct
42	Correct	56 ms	237112 KB	Output is correct
43	Correct	39 ms	229192 KB	Output is correct
44	Correct	53 ms	229192 KB	Output is correct

Subtask #3
0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	228624 KB	Output is correct
2	Correct	16 ms	228624 KB	Output is correct
3	Correct	33 ms	228624 KB	Output is correct
4	Correct	19 ms	228624 KB	Output is correct
5	Correct	29 ms	228624 KB	Output is correct
6	Correct	23 ms	228624 KB	Output is correct
7	Correct	19 ms	228624 KB	Output is correct
8	Correct	23 ms	228624 KB	Output is correct
9	Correct	23 ms	228624 KB	Output is correct
10	Correct	16 ms	228624 KB	Output is correct
11	Correct	33 ms	228624 KB	Output is correct
12	Correct	33 ms	228624 KB	Output is correct
13	Correct	13 ms	228624 KB	Output is correct
14	Correct	23 ms	228624 KB	Output is correct
15	Correct	23 ms	228624 KB	Output is correct
16	Correct	19 ms	228624 KB	Output is correct
17	Correct	19 ms	228624 KB	Output is correct
18	Correct	26 ms	228624 KB	Output is correct
19	Correct	19 ms	228624 KB	Output is correct
20	Correct	33 ms	228624 KB	Output is correct
21	Correct	23 ms	228624 KB	Output is correct
22	Correct	26 ms	228624 KB	Output is correct
23	Correct	36 ms	228624 KB	Output is correct
24	Correct	19 ms	228624 KB	Output is correct
25	Correct	56 ms	229028 KB	Output is correct
26	Correct	59 ms	229192 KB	Output is correct
27	Correct	59 ms	228996 KB	Output is correct
28	Correct	69 ms	229304 KB	Output is correct
29	Correct	56 ms	229160 KB	Output is correct
30	Correct	56 ms	229300 KB	Output is correct
31	Correct	63 ms	229152 KB	Output is correct
32	Correct	43 ms	229064 KB	Output is correct
33	Correct	46 ms	228904 KB	Output is correct
34	Correct	56 ms	229040 KB	Output is correct
35	Correct	53 ms	228624 KB	Output is correct
36	Correct	46 ms	228624 KB	Output is correct
37	Correct	126 ms	246536 KB	Output is correct
38	Correct	79 ms	237492 KB	Output is correct
39	Correct	56 ms	228756 KB	Output is correct
40	Correct	49 ms	228624 KB	Output is correct
41	Correct	76 ms	237112 KB	Output is correct
42	Correct	56 ms	237112 KB	Output is correct
43	Correct	39 ms	229192 KB	Output is correct
44	Correct	53 ms	229192 KB	Output is correct
45	Execution timed out	3500 ms	234348 KB	Execution timed out
46	Halted	0 ms	0 KB	-

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	228624 KB	Output is correct
2	Correct	16 ms	228624 KB	Output is correct
3	Correct	33 ms	228624 KB	Output is correct
4	Correct	19 ms	228624 KB	Output is correct
5	Correct	29 ms	228624 KB	Output is correct
6	Correct	23 ms	228624 KB	Output is correct
7	Correct	19 ms	228624 KB	Output is correct
8	Correct	23 ms	228624 KB	Output is correct
9	Correct	23 ms	228624 KB	Output is correct
10	Correct	16 ms	228624 KB	Output is correct
11	Correct	33 ms	228624 KB	Output is correct
12	Correct	33 ms	228624 KB	Output is correct
13	Correct	13 ms	228624 KB	Output is correct
14	Correct	23 ms	228624 KB	Output is correct
15	Correct	23 ms	228624 KB	Output is correct
16	Correct	19 ms	228624 KB	Output is correct
17	Correct	19 ms	228624 KB	Output is correct
18	Correct	26 ms	228624 KB	Output is correct
19	Correct	19 ms	228624 KB	Output is correct
20	Correct	33 ms	228624 KB	Output is correct
21	Correct	23 ms	228624 KB	Output is correct
22	Correct	26 ms	228624 KB	Output is correct
23	Correct	36 ms	228624 KB	Output is correct
24	Correct	19 ms	228624 KB	Output is correct
25	Correct	56 ms	229028 KB	Output is correct
26	Correct	59 ms	229192 KB	Output is correct
27	Correct	59 ms	228996 KB	Output is correct
28	Correct	69 ms	229304 KB	Output is correct
29	Correct	56 ms	229160 KB	Output is correct
30	Correct	56 ms	229300 KB	Output is correct
31	Correct	63 ms	229152 KB	Output is correct
32	Correct	43 ms	229064 KB	Output is correct
33	Correct	46 ms	228904 KB	Output is correct
34	Correct	56 ms	229040 KB	Output is correct
35	Correct	53 ms	228624 KB	Output is correct
36	Correct	46 ms	228624 KB	Output is correct
37	Correct	126 ms	246536 KB	Output is correct
38	Correct	79 ms	237492 KB	Output is correct
39	Correct	56 ms	228756 KB	Output is correct
40	Correct	49 ms	228624 KB	Output is correct
41	Correct	76 ms	237112 KB	Output is correct
42	Correct	56 ms	237112 KB	Output is correct
43	Correct	39 ms	229192 KB	Output is correct
44	Correct	53 ms	229192 KB	Output is correct
45	Execution timed out	3500 ms	234348 KB	Execution timed out
46	Halted	0 ms	0 KB	-

Submission #23706

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 56.0

Subtask #4 0 / 22.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 56.0

Subtask #4
0 / 22.0