Submission #31054

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
31054	2017-08-06T05:39:17 Z	zscoder	Port Facility (JOI17_port_facility)	C++14	100 / 100	4316 ms	611436 KB

port_facility

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
using namespace std;
#define SIZE (1<<21)
int toz[SIZE];
class segtree
{
public:
	int seg1[22][SIZE];
	int seg2[22][SIZE];
	int low[SIZE*2],u1[SIZE*2],u2[SIZE*2];
	int x[SIZE * 2];
	int pt;
	void init()
	{
		for(int i=0;i<SIZE;i++)low[i+SIZE]=u1[i+SIZE]=u2[i+SIZE]=i;
		for(int i=SIZE-1;i>=1;i--)low[i]=low[i*2],u1[i]=u1[i*2],u2[i]=u2[i*2];
	}
	void add1(int beg, int end)
	{
		int node = 1;
		int lb = 0, ub = SIZE - 1;
		int dep=0;
		for (;;)
		{
			seg1[dep][u1[node]++]=end;
			if (lb == ub)break;
			node *= 2;
			dep++;
			if (beg <= (lb + ub) / 2)ub = (lb + ub) / 2;
			else lb = (lb + ub) / 2 + 1, node++;
		}
	}
	void add2(int beg,int end)
	{
		int node = 1;
		int lb = 0, ub = SIZE - 1;
		int dep=0;
		for (;;)
		{
			seg2[dep][u2[node]++]=beg;
			if (lb == ub)break;
			node *= 2;
			dep++;
			if (end <= (lb + ub) / 2)ub = (lb + ub) / 2;
			else lb = (lb + ub) / 2 + 1, node++;
		}
	}
	void get(int beg, int end, int node, int lb, int ub, int dep)
	{
		if (end < lb || ub < beg)return;
		if (beg <= lb&&ub <= end)
		{
			for (;;)
			{
				if(low[node]==u1[node])break;
				int z=seg1[dep][u1[node]-1];
				if(z<=end)break;
				x[pt++] = toz[z];
				u1[node]--;
			}
			for (;;)
			{
				if(low[node]==u2[node])break;
				int z=seg2[dep][u2[node]-1];
				if(z>=beg)break;
				x[pt++] = toz[z];
				u2[node]--;
			}
			return;
		}
		get(beg, end, node * 2, lb, (lb + ub) / 2, dep+1);
		get(beg, end, node * 2 + 1, (lb + ub) / 2 + 1, ub,dep+1);
	}
};
segtree tree;
int a[1000000], b[1000000];
int col[2000000];
typedef pair<int, int>pii;
int main()
{
	int num;
	scanf("%d", &num);
	for (int i = 0; i < num; i++)scanf("%d%d", &a[i], &b[i]), a[i]--, b[i]--, toz[a[i]] = toz[b[i]] = i;
	tree.init();
	for(int i=0;i<num+num;i++)if(b[toz[i]]==i)tree.add1(a[toz[i]],b[toz[i]]);
	for(int i=num+num-1;i>=0;i--)if(a[toz[i]]==i)tree.add2(a[toz[i]],b[toz[i]]);
	int ans = 1;
	for (int i = 0; i < num; i++)
	{
		if (col[i] == 0)
		{
			ans = ans * 2 % 1000000007;
			queue<pii>que;
			que.push(make_pair(i, 1));
			for (;;)
			{
				if (que.empty())break;
				pii z = que.front();
				que.pop();
				if (col[z.first] != 0)
				{
					if (col[z.first] != z.second)
					{
						printf("0\n");
						return 0;
					}
					continue;
				}
				col[z.first] = z.second;
				tree.pt = 0;
				tree.get(a[z.first], b[z.first], 1, 0, SIZE - 1, 0);
				for (int j = 0; j < tree.pt; j++)que.push(make_pair(tree.x[j], -z.second));
			}
		}
	}
	printf("%d\n",ans);
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:86:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &num);
                   ^
port_facility.cpp:87:101: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < num; i++)scanf("%d%d", &a[i], &b[i]), a[i]--, b[i]--, toz[a[i]] = toz[b[i]] = i;
                                                                                                     ^
port_facility.cpp:62:20: warning: array subscript is above array bounds [-Warray-bounds]
     x[pt++] = toz[z];
                    ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	451740 KB	Output is correct
2	Correct	13 ms	451740 KB	Output is correct
3	Correct	9 ms	451740 KB	Output is correct
4	Correct	26 ms	451740 KB	Output is correct
5	Correct	19 ms	451740 KB	Output is correct
6	Correct	23 ms	451740 KB	Output is correct
7	Correct	19 ms	451740 KB	Output is correct
8	Correct	29 ms	451740 KB	Output is correct
9	Correct	19 ms	451740 KB	Output is correct
10	Correct	13 ms	451740 KB	Output is correct
11	Correct	9 ms	451740 KB	Output is correct
12	Correct	9 ms	451740 KB	Output is correct
13	Correct	13 ms	451740 KB	Output is correct
14	Correct	13 ms	451740 KB	Output is correct
15	Correct	16 ms	451740 KB	Output is correct
16	Correct	9 ms	451740 KB	Output is correct
17	Correct	3 ms	451740 KB	Output is correct
18	Correct	19 ms	451740 KB	Output is correct
19	Correct	13 ms	451740 KB	Output is correct
20	Correct	16 ms	451740 KB	Output is correct
21	Correct	13 ms	451740 KB	Output is correct
22	Correct	23 ms	451740 KB	Output is correct
23	Correct	6 ms	451740 KB	Output is correct
24	Correct	9 ms	451740 KB	Output is correct
25	Correct	6 ms	451740 KB	Output is correct
26	Correct	16 ms	451740 KB	Output is correct
27	Correct	6 ms	451740 KB	Output is correct
28	Correct	23 ms	451740 KB	Output is correct
29	Correct	19 ms	451740 KB	Output is correct
30	Correct	6 ms	451740 KB	Output is correct
31	Correct	33 ms	451740 KB	Output is correct
32	Correct	33 ms	451740 KB	Output is correct
33	Correct	16 ms	451740 KB	Output is correct
34	Correct	19 ms	451740 KB	Output is correct
35	Correct	13 ms	451740 KB	Output is correct
36	Correct	9 ms	451740 KB	Output is correct
37	Correct	19 ms	451872 KB	Output is correct
38	Correct	9 ms	451872 KB	Output is correct
39	Correct	29 ms	451740 KB	Output is correct
40	Correct	19 ms	451740 KB	Output is correct
41	Correct	16 ms	451740 KB	Output is correct
42	Correct	23 ms	451740 KB	Output is correct
43	Correct	19 ms	451740 KB	Output is correct
44	Correct	29 ms	451740 KB	Output is correct
45	Correct	179 ms	451740 KB	Output is correct
46	Correct	186 ms	451872 KB	Output is correct
47	Correct	163 ms	451740 KB	Output is correct
48	Correct	159 ms	451740 KB	Output is correct
49	Correct	153 ms	451740 KB	Output is correct
50	Correct	136 ms	451872 KB	Output is correct
51	Correct	106 ms	452004 KB	Output is correct
52	Correct	179 ms	451740 KB	Output is correct
53	Correct	239 ms	451740 KB	Output is correct
54	Correct	193 ms	465444 KB	Output is correct
55	Correct	159 ms	457896 KB	Output is correct
56	Correct	116 ms	458152 KB	Output is correct
57	Correct	136 ms	451740 KB	Output is correct
58	Correct	136 ms	451740 KB	Output is correct
59	Correct	203 ms	451740 KB	Output is correct
60	Correct	183 ms	451740 KB	Output is correct
61	Correct	203 ms	451740 KB	Output is correct
62	Correct	116 ms	452268 KB	Output is correct
63	Correct	109 ms	452004 KB	Output is correct
64	Correct	86 ms	451872 KB	Output is correct
65	Correct	259 ms	463020 KB	Output is correct
66	Correct	293 ms	464604 KB	Output is correct
67	Correct	163 ms	457580 KB	Output is correct
68	Correct	186 ms	456408 KB	Output is correct
69	Correct	186 ms	456920 KB	Output is correct
70	Correct	146 ms	457976 KB	Output is correct
71	Correct	149 ms	453852 KB	Output is correct
72	Correct	149 ms	453852 KB	Output is correct
73	Correct	159 ms	453608 KB	Output is correct
74	Correct	143 ms	453588 KB	Output is correct
75	Correct	143 ms	451740 KB	Output is correct
76	Correct	143 ms	451740 KB	Output is correct
77	Correct	146 ms	451740 KB	Output is correct
78	Correct	186 ms	451740 KB	Output is correct
79	Correct	176 ms	451740 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	451740 KB	Output is correct
2	Correct	13 ms	451740 KB	Output is correct
3	Correct	9 ms	451740 KB	Output is correct
4	Correct	26 ms	451740 KB	Output is correct
5	Correct	19 ms	451740 KB	Output is correct
6	Correct	23 ms	451740 KB	Output is correct
7	Correct	19 ms	451740 KB	Output is correct
8	Correct	29 ms	451740 KB	Output is correct
9	Correct	19 ms	451740 KB	Output is correct
10	Correct	13 ms	451740 KB	Output is correct
11	Correct	9 ms	451740 KB	Output is correct
12	Correct	9 ms	451740 KB	Output is correct
13	Correct	13 ms	451740 KB	Output is correct
14	Correct	13 ms	451740 KB	Output is correct
15	Correct	16 ms	451740 KB	Output is correct
16	Correct	9 ms	451740 KB	Output is correct
17	Correct	3 ms	451740 KB	Output is correct
18	Correct	19 ms	451740 KB	Output is correct
19	Correct	13 ms	451740 KB	Output is correct
20	Correct	16 ms	451740 KB	Output is correct
21	Correct	13 ms	451740 KB	Output is correct
22	Correct	23 ms	451740 KB	Output is correct
23	Correct	6 ms	451740 KB	Output is correct
24	Correct	9 ms	451740 KB	Output is correct
25	Correct	6 ms	451740 KB	Output is correct
26	Correct	16 ms	451740 KB	Output is correct
27	Correct	6 ms	451740 KB	Output is correct
28	Correct	23 ms	451740 KB	Output is correct
29	Correct	19 ms	451740 KB	Output is correct
30	Correct	6 ms	451740 KB	Output is correct
31	Correct	33 ms	451740 KB	Output is correct
32	Correct	33 ms	451740 KB	Output is correct
33	Correct	16 ms	451740 KB	Output is correct
34	Correct	19 ms	451740 KB	Output is correct
35	Correct	13 ms	451740 KB	Output is correct
36	Correct	9 ms	451740 KB	Output is correct
37	Correct	19 ms	451872 KB	Output is correct
38	Correct	9 ms	451872 KB	Output is correct
39	Correct	29 ms	451740 KB	Output is correct
40	Correct	19 ms	451740 KB	Output is correct
41	Correct	16 ms	451740 KB	Output is correct
42	Correct	23 ms	451740 KB	Output is correct
43	Correct	19 ms	451740 KB	Output is correct
44	Correct	29 ms	451740 KB	Output is correct
45	Correct	179 ms	451740 KB	Output is correct
46	Correct	186 ms	451872 KB	Output is correct
47	Correct	163 ms	451740 KB	Output is correct
48	Correct	159 ms	451740 KB	Output is correct
49	Correct	153 ms	451740 KB	Output is correct
50	Correct	136 ms	451872 KB	Output is correct
51	Correct	106 ms	452004 KB	Output is correct
52	Correct	179 ms	451740 KB	Output is correct
53	Correct	239 ms	451740 KB	Output is correct
54	Correct	193 ms	465444 KB	Output is correct
55	Correct	159 ms	457896 KB	Output is correct
56	Correct	116 ms	458152 KB	Output is correct
57	Correct	136 ms	451740 KB	Output is correct
58	Correct	136 ms	451740 KB	Output is correct
59	Correct	203 ms	451740 KB	Output is correct
60	Correct	183 ms	451740 KB	Output is correct
61	Correct	203 ms	451740 KB	Output is correct
62	Correct	116 ms	452268 KB	Output is correct
63	Correct	109 ms	452004 KB	Output is correct
64	Correct	86 ms	451872 KB	Output is correct
65	Correct	259 ms	463020 KB	Output is correct
66	Correct	293 ms	464604 KB	Output is correct
67	Correct	163 ms	457580 KB	Output is correct
68	Correct	186 ms	456408 KB	Output is correct
69	Correct	186 ms	456920 KB	Output is correct
70	Correct	146 ms	457976 KB	Output is correct
71	Correct	149 ms	453852 KB	Output is correct
72	Correct	149 ms	453852 KB	Output is correct
73	Correct	159 ms	453608 KB	Output is correct
74	Correct	143 ms	453588 KB	Output is correct
75	Correct	143 ms	451740 KB	Output is correct
76	Correct	143 ms	451740 KB	Output is correct
77	Correct	146 ms	451740 KB	Output is correct
78	Correct	186 ms	451740 KB	Output is correct
79	Correct	176 ms	451740 KB	Output is correct
80	Correct	1913 ms	451872 KB	Output is correct
81	Correct	1879 ms	451872 KB	Output is correct
82	Correct	2069 ms	451872 KB	Output is correct
83	Correct	2206 ms	451948 KB	Output is correct
84	Correct	1899 ms	451872 KB	Output is correct
85	Correct	1356 ms	453192 KB	Output is correct
86	Correct	1299 ms	453060 KB	Output is correct
87	Correct	1599 ms	451740 KB	Output is correct
88	Correct	3413 ms	451740 KB	Output is correct
89	Correct	1939 ms	611436 KB	Output is correct
90	Correct	1419 ms	527564 KB	Output is correct
91	Correct	1629 ms	527564 KB	Output is correct
92	Correct	1929 ms	451740 KB	Output is correct
93	Correct	1989 ms	451740 KB	Output is correct
94	Correct	2679 ms	451740 KB	Output is correct
95	Correct	2209 ms	451740 KB	Output is correct
96	Correct	2005 ms	451740 KB	Output is correct
97	Correct	1008 ms	454512 KB	Output is correct
98	Correct	1276 ms	453324 KB	Output is correct
99	Correct	1193 ms	455996 KB	Output is correct
100	Correct	4206 ms	595464 KB	Output is correct
101	Correct	4316 ms	583848 KB	Output is correct
102	Correct	1739 ms	520436 KB	Output is correct
103	Correct	2033 ms	510272 KB	Output is correct
104	Correct	2089 ms	513704 KB	Output is correct
105	Correct	1676 ms	502656 KB	Output is correct
106	Correct	1426 ms	468752 KB	Output is correct
107	Correct	1546 ms	468752 KB	Output is correct
108	Correct	1556 ms	471920 KB	Output is correct
109	Correct	1473 ms	471524 KB	Output is correct
110	Correct	1469 ms	451740 KB	Output is correct
111	Correct	1216 ms	451740 KB	Output is correct
112	Correct	1603 ms	451740 KB	Output is correct
113	Correct	1709 ms	451872 KB	Output is correct
114	Correct	1769 ms	451948 KB	Output is correct

Submission #31054

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