Submission #21694

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
21694	2017-04-16T19:02:08 Z	pacu	Port Facility (JOI17_port_facility)	C++	78 / 100	3500 ms	126912 KB

port_facility

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

int N;
int t1[1000000], t2[1000000];

int fid[2000001];
int sz[2000001];

void init()
{
	for(int i=0;i<2*N;i++)
		fid[i] = i, sz[i] = 1;
}

int find(int i)
{
	if(fid[i]==i) return i;
	return fid[i] = find(fid[i]);
}

void join(int i,int j)
{
	i = find(i), j = find(j);
	if(i==j) return;
	if(sz[i] <= sz[j])
	{
		fid[i] = j;
		sz[j] += sz[i];
	}
	else
	{
		fid[j] = i;
		sz[i] += sz[j];
	}
}

void sameEdge(int i,int j)
{
	//cout << "same " << i << ' ' << j << '\n';
	join(2*i,2*j);
	join(2*i+1,2*j+1);
}
void difEdge(int i,int j)
{
	join(2*i+1,2*j);
	join(2*i,2*j+1);
}

#define SEG (1<<21)
int up[2*SEG],l[2*SEG],r[2*SEG],seg[2*SEG],cont[2*SEG];
int rIndex[2000000];

void segInit()
{
	for(int i=SEG;i<2*SEG;i++)
		l[i] = r[i] = i-SEG, up[i] = -1;
	for(int i=SEG-1;i>0;i--)
		l[i] = l[2*i], r[i] = r[2*i+1], up[i] = -1;
}

void push(int i)
{
	if(up[i]>-1)
	{
		if(i<SEG)
		{
			if(up[2*i]>-1 && seg[2*i]>0) sameEdge(up[i],up[2*i]);
			if(up[2*i+1]>-1 && seg[2*i+1]>0) sameEdge(up[i],up[2*i+1]);
			up[2*i] = up[2*i+1] = up[i];
		}
		else if(rIndex[i-SEG]>-1 && cont[i])
		{
			difEdge(rIndex[i-SEG],up[i]);
		}
		up[i] = -1;
	}
}

int low,high;
void update(int i,int p)
{
	if((l[i]>high)||(r[i]<low)||(seg[i]==0)) return;
	if((l[i]>=low)&&(r[i]<=high))
	{
		push(i);
		//cout << "Set " << p << " at " << l[i] << " to " << r[i] << '\n';
		up[i] = p;
		return;
	}
	push(i);
	update(2*i,p);
	update(2*i+1,p);
}

int getSum(int i)
{
	if((l[i]>high)||(r[i]<low)) return 0;
	if((l[i]>=low)&&(r[i]<=high)) return seg[i];
	return getSum(2*i) + getSum(2*i+1);
}

void add(int i)
{
	int j = 1;
	while(j < SEG)
	{
		push(j);
		seg[j]++;
		if(i <= r[2*j]) j = 2*j;
		else j = 2*j+1;
	}
	push(j);
	cont[i+SEG] = 1;
	seg[i+SEG] = 1;
}

int compAns[2000000];
int cid[1000000];

bool cmp(int a,int b)
{
	return t1[a]<t1[b];
}

int main()
{
	scanf("%d",&N);
	for(int i=0;i<N;i++)
	{
		scanf("%d %d",&t1[i],&t2[i]);
		rIndex[t1[i]] = -1;
		rIndex[t2[i]] = i;
		cid[i] = i;
	}
	sort(cid,cid+N,cmp);
	init();
	segInit();
	for(int i=0;i<N;i++)
	{
		low = t1[cid[i]];
		high = t2[cid[i]];
		update(1,cid[i]);
		add(t2[cid[i]]);
	}
	for(int i=1;i<2*SEG;i++)
		push(i);
	for(int i=0;i<N;i++)
	{
		if(find(2*i) == find(2*i+1))
		{
			printf("0\n");
			return 0;
		}
	}
	int cmp = 0;
	for(int i=0;i<2*N;i++)
		if(find(i)==i)
			cmp++;
	int ans = 1;
	for(int i=0;i<cmp/2;i++)
		ans = (2*ans)%1000000007;
	printf("%d\n",ans);
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:132:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
                ^
port_facility.cpp:135:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&t1[i],&t2[i]);
                               ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	126912 KB	Output is correct
2	Correct	13 ms	126912 KB	Output is correct
3	Correct	26 ms	126912 KB	Output is correct
4	Correct	26 ms	126912 KB	Output is correct
5	Correct	26 ms	126912 KB	Output is correct
6	Correct	23 ms	126912 KB	Output is correct
7	Correct	33 ms	126912 KB	Output is correct
8	Correct	23 ms	126912 KB	Output is correct
9	Correct	16 ms	126912 KB	Output is correct
10	Correct	23 ms	126912 KB	Output is correct
11	Correct	19 ms	126912 KB	Output is correct
12	Correct	43 ms	126912 KB	Output is correct
13	Correct	29 ms	126912 KB	Output is correct
14	Correct	29 ms	126912 KB	Output is correct
15	Correct	29 ms	126912 KB	Output is correct
16	Correct	29 ms	126912 KB	Output is correct
17	Correct	29 ms	126912 KB	Output is correct
18	Correct	23 ms	126912 KB	Output is correct
19	Correct	26 ms	126912 KB	Output is correct
20	Correct	19 ms	126912 KB	Output is correct
21	Correct	19 ms	126912 KB	Output is correct
22	Correct	26 ms	126912 KB	Output is correct
23	Correct	29 ms	126912 KB	Output is correct
24	Correct	23 ms	126912 KB	Output is correct
25	Correct	23 ms	126912 KB	Output is correct
26	Correct	29 ms	126912 KB	Output is correct
27	Correct	29 ms	126912 KB	Output is correct
28	Correct	33 ms	126912 KB	Output is correct
29	Correct	23 ms	126912 KB	Output is correct
30	Correct	23 ms	126912 KB	Output is correct
31	Correct	23 ms	126912 KB	Output is correct
32	Correct	29 ms	126912 KB	Output is correct
33	Correct	23 ms	126912 KB	Output is correct
34	Correct	16 ms	126912 KB	Output is correct
35	Correct	23 ms	126912 KB	Output is correct
36	Correct	33 ms	126912 KB	Output is correct
37	Correct	19 ms	126912 KB	Output is correct
38	Correct	33 ms	126912 KB	Output is correct
39	Correct	19 ms	126912 KB	Output is correct
40	Correct	23 ms	126912 KB	Output is correct
41	Correct	29 ms	126912 KB	Output is correct
42	Correct	29 ms	126912 KB	Output is correct
43	Correct	33 ms	126912 KB	Output is correct
44	Correct	26 ms	126912 KB	Output is correct
45	Correct	169 ms	126912 KB	Output is correct
46	Correct	169 ms	126912 KB	Output is correct
47	Correct	143 ms	126912 KB	Output is correct
48	Correct	169 ms	126912 KB	Output is correct
49	Correct	156 ms	126912 KB	Output is correct
50	Correct	149 ms	126912 KB	Output is correct
51	Correct	139 ms	126912 KB	Output is correct
52	Correct	116 ms	126912 KB	Output is correct
53	Correct	106 ms	126912 KB	Output is correct
54	Correct	146 ms	126912 KB	Output is correct
55	Correct	143 ms	126912 KB	Output is correct
56	Correct	163 ms	126912 KB	Output is correct
57	Correct	126 ms	126912 KB	Output is correct
58	Correct	116 ms	126912 KB	Output is correct
59	Correct	123 ms	126912 KB	Output is correct
60	Correct	123 ms	126912 KB	Output is correct
61	Correct	153 ms	126912 KB	Output is correct
62	Correct	149 ms	126912 KB	Output is correct
63	Correct	159 ms	126912 KB	Output is correct
64	Correct	156 ms	126912 KB	Output is correct
65	Correct	266 ms	126912 KB	Output is correct
66	Correct	293 ms	126912 KB	Output is correct
67	Correct	159 ms	126912 KB	Output is correct
68	Correct	156 ms	126912 KB	Output is correct
69	Correct	163 ms	126912 KB	Output is correct
70	Correct	176 ms	126912 KB	Output is correct
71	Correct	113 ms	126912 KB	Output is correct
72	Correct	133 ms	126912 KB	Output is correct
73	Correct	149 ms	126912 KB	Output is correct
74	Correct	143 ms	126912 KB	Output is correct
75	Correct	139 ms	126912 KB	Output is correct
76	Correct	119 ms	126912 KB	Output is correct
77	Correct	119 ms	126912 KB	Output is correct
78	Correct	156 ms	126912 KB	Output is correct
79	Correct	166 ms	126912 KB	Output is correct

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	126912 KB	Output is correct
2	Correct	13 ms	126912 KB	Output is correct
3	Correct	26 ms	126912 KB	Output is correct
4	Correct	26 ms	126912 KB	Output is correct
5	Correct	26 ms	126912 KB	Output is correct
6	Correct	23 ms	126912 KB	Output is correct
7	Correct	33 ms	126912 KB	Output is correct
8	Correct	23 ms	126912 KB	Output is correct
9	Correct	16 ms	126912 KB	Output is correct
10	Correct	23 ms	126912 KB	Output is correct
11	Correct	19 ms	126912 KB	Output is correct
12	Correct	43 ms	126912 KB	Output is correct
13	Correct	29 ms	126912 KB	Output is correct
14	Correct	29 ms	126912 KB	Output is correct
15	Correct	29 ms	126912 KB	Output is correct
16	Correct	29 ms	126912 KB	Output is correct
17	Correct	29 ms	126912 KB	Output is correct
18	Correct	23 ms	126912 KB	Output is correct
19	Correct	26 ms	126912 KB	Output is correct
20	Correct	19 ms	126912 KB	Output is correct
21	Correct	19 ms	126912 KB	Output is correct
22	Correct	26 ms	126912 KB	Output is correct
23	Correct	29 ms	126912 KB	Output is correct
24	Correct	23 ms	126912 KB	Output is correct
25	Correct	23 ms	126912 KB	Output is correct
26	Correct	29 ms	126912 KB	Output is correct
27	Correct	29 ms	126912 KB	Output is correct
28	Correct	33 ms	126912 KB	Output is correct
29	Correct	23 ms	126912 KB	Output is correct
30	Correct	23 ms	126912 KB	Output is correct
31	Correct	23 ms	126912 KB	Output is correct
32	Correct	29 ms	126912 KB	Output is correct
33	Correct	23 ms	126912 KB	Output is correct
34	Correct	16 ms	126912 KB	Output is correct
35	Correct	23 ms	126912 KB	Output is correct
36	Correct	33 ms	126912 KB	Output is correct
37	Correct	19 ms	126912 KB	Output is correct
38	Correct	33 ms	126912 KB	Output is correct
39	Correct	19 ms	126912 KB	Output is correct
40	Correct	23 ms	126912 KB	Output is correct
41	Correct	29 ms	126912 KB	Output is correct
42	Correct	29 ms	126912 KB	Output is correct
43	Correct	33 ms	126912 KB	Output is correct
44	Correct	26 ms	126912 KB	Output is correct
45	Correct	169 ms	126912 KB	Output is correct
46	Correct	169 ms	126912 KB	Output is correct
47	Correct	143 ms	126912 KB	Output is correct
48	Correct	169 ms	126912 KB	Output is correct
49	Correct	156 ms	126912 KB	Output is correct
50	Correct	149 ms	126912 KB	Output is correct
51	Correct	139 ms	126912 KB	Output is correct
52	Correct	116 ms	126912 KB	Output is correct
53	Correct	106 ms	126912 KB	Output is correct
54	Correct	146 ms	126912 KB	Output is correct
55	Correct	143 ms	126912 KB	Output is correct
56	Correct	163 ms	126912 KB	Output is correct
57	Correct	126 ms	126912 KB	Output is correct
58	Correct	116 ms	126912 KB	Output is correct
59	Correct	123 ms	126912 KB	Output is correct
60	Correct	123 ms	126912 KB	Output is correct
61	Correct	153 ms	126912 KB	Output is correct
62	Correct	149 ms	126912 KB	Output is correct
63	Correct	159 ms	126912 KB	Output is correct
64	Correct	156 ms	126912 KB	Output is correct
65	Correct	266 ms	126912 KB	Output is correct
66	Correct	293 ms	126912 KB	Output is correct
67	Correct	159 ms	126912 KB	Output is correct
68	Correct	156 ms	126912 KB	Output is correct
69	Correct	163 ms	126912 KB	Output is correct
70	Correct	176 ms	126912 KB	Output is correct
71	Correct	113 ms	126912 KB	Output is correct
72	Correct	133 ms	126912 KB	Output is correct
73	Correct	149 ms	126912 KB	Output is correct
74	Correct	143 ms	126912 KB	Output is correct
75	Correct	139 ms	126912 KB	Output is correct
76	Correct	119 ms	126912 KB	Output is correct
77	Correct	119 ms	126912 KB	Output is correct
78	Correct	156 ms	126912 KB	Output is correct
79	Correct	166 ms	126912 KB	Output is correct
80	Correct	1783 ms	126912 KB	Output is correct
81	Correct	1729 ms	126912 KB	Output is correct
82	Correct	1746 ms	126912 KB	Output is correct
83	Correct	1739 ms	126912 KB	Output is correct
84	Correct	1829 ms	126912 KB	Output is correct
85	Correct	1769 ms	126912 KB	Output is correct
86	Correct	1759 ms	126912 KB	Output is correct
87	Correct	1273 ms	126912 KB	Output is correct
88	Correct	1186 ms	126912 KB	Output is correct
89	Correct	2036 ms	126912 KB	Output is correct
90	Correct	2025 ms	126912 KB	Output is correct
91	Correct	1826 ms	126912 KB	Output is correct
92	Correct	1223 ms	126912 KB	Output is correct
93	Correct	1176 ms	126912 KB	Output is correct
94	Correct	1476 ms	126912 KB	Output is correct
95	Correct	1576 ms	126912 KB	Output is correct
96	Correct	1623 ms	126912 KB	Output is correct
97	Correct	1459 ms	126912 KB	Output is correct
98	Correct	1669 ms	126912 KB	Output is correct
99	Correct	1783 ms	126912 KB	Output is correct
100	Execution timed out	3500 ms	126912 KB	Execution timed out
101	Halted	0 ms	0 KB	-

Submission #21694

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