Submission #74224

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
74224	2018-08-30T13:41:57 Z	TadijaSebez	Port Facility (JOI17_port_facility)	C++11	100 / 100	3085 ms	562856 KB

port_facility

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
const int N=2000050;
const int M=N*2;
const int mod=1e9+7;
int pos(int x){ return x<<1;}
int neg(int x){ return x<<1|1;}
struct DSU
{
	int p[M];
	void init(){ for(int i=0;i<N;i++) p[i]=i;}
	DSU(){ init();}
	int Find(int x){ return p[x]==x?x:p[x]=Find(p[x]);}
	void Union(int x, int y){ p[Find(x)]=Find(y);}
} Tree;
set<pair<int,int> > st;
int l[N],r[N],id[N];
bool comp(int i, int j){ return l[i]<l[j] || l[i]==l[j] && r[i]<r[j];}
int main()
{
	int n,i;
	scanf("%i",&n);
	for(i=1;i<=n;i++) scanf("%i %i",&l[i],&r[i]),id[i]=i;
	sort(id+1,id+1+n,comp);
	for(i=1;i<=n;i++)
	{
		int j=id[i];
		set<pair<int,int> >::iterator it;
		it=st.upper_bound(mp(r[j],j));
		int lst=0;
		if(it!=st.begin()){ it--;lst=it->second;}
		for(it=st.lower_bound(mp(l[j],j));it!=st.upper_bound(mp(r[j],j));it++)
		{
			Tree.Union(pos(it->second),neg(j));
			Tree.Union(neg(it->second),pos(j));
			if(Tree.Find(pos(j))==Tree.Find(neg(lst))) break;
		}
		st.insert(mp(r[j],j));
	}
	int sol=1;
	for(i=1;i<=n;i++)
	{
		if(Tree.Find(pos(i))==pos(i)) sol=sol*2%mod;
		if(Tree.Find(pos(i))==Tree.Find(neg(i))) sol=0;
	}
	printf("%i\n",sol);
	return 0;
}

Compilation message

port_facility.cpp: In function 'bool comp(int, int)':
port_facility.cpp:21:57: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
 bool comp(int i, int j){ return l[i]<l[j] || l[i]==l[j] && r[i]<r[j];}
                                              ~~~~~~~~~~~^~~~~~~~~~~~
port_facility.cpp: In function 'int main()':
port_facility.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
port_facility.cpp:26:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=n;i++) scanf("%i %i",&l[i],&r[i]),id[i]=i;
                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	8184 KB	Output is correct
2	Correct	8 ms	8368 KB	Output is correct
3	Correct	10 ms	8368 KB	Output is correct
4	Correct	8 ms	8368 KB	Output is correct
5	Correct	8 ms	8404 KB	Output is correct
6	Correct	8 ms	8404 KB	Output is correct
7	Correct	8 ms	8404 KB	Output is correct
8	Correct	8 ms	8404 KB	Output is correct
9	Correct	8 ms	8404 KB	Output is correct
10	Correct	8 ms	8452 KB	Output is correct
11	Correct	8 ms	8452 KB	Output is correct
12	Correct	8 ms	8452 KB	Output is correct
13	Correct	8 ms	8452 KB	Output is correct
14	Correct	8 ms	8452 KB	Output is correct
15	Correct	8 ms	8452 KB	Output is correct
16	Correct	8 ms	8452 KB	Output is correct
17	Correct	8 ms	8452 KB	Output is correct
18	Correct	8 ms	8452 KB	Output is correct
19	Correct	10 ms	8452 KB	Output is correct
20	Correct	8 ms	8540 KB	Output is correct
21	Correct	8 ms	8540 KB	Output is correct
22	Correct	10 ms	8540 KB	Output is correct
23	Correct	8 ms	8540 KB	Output is correct
24	Correct	11 ms	8540 KB	Output is correct
25	Correct	12 ms	8544 KB	Output is correct
26	Correct	10 ms	8544 KB	Output is correct
27	Correct	10 ms	8544 KB	Output is correct
28	Correct	10 ms	8544 KB	Output is correct
29	Correct	11 ms	8616 KB	Output is correct
30	Correct	10 ms	8616 KB	Output is correct
31	Correct	10 ms	8616 KB	Output is correct
32	Correct	10 ms	8616 KB	Output is correct
33	Correct	12 ms	8616 KB	Output is correct
34	Correct	10 ms	8616 KB	Output is correct
35	Correct	10 ms	8684 KB	Output is correct
36	Correct	9 ms	8684 KB	Output is correct
37	Correct	10 ms	8684 KB	Output is correct
38	Correct	10 ms	8684 KB	Output is correct
39	Correct	10 ms	8684 KB	Output is correct
40	Correct	10 ms	8684 KB	Output is correct
41	Correct	10 ms	8684 KB	Output is correct
42	Correct	11 ms	8684 KB	Output is correct
43	Correct	9 ms	8684 KB	Output is correct
44	Correct	10 ms	8684 KB	Output is correct
45	Correct	114 ms	14312 KB	Output is correct
46	Correct	114 ms	14312 KB	Output is correct
47	Correct	114 ms	14332 KB	Output is correct
48	Correct	114 ms	14460 KB	Output is correct
49	Correct	122 ms	14460 KB	Output is correct
50	Correct	111 ms	14460 KB	Output is correct
51	Correct	110 ms	14460 KB	Output is correct
52	Correct	129 ms	14460 KB	Output is correct
53	Correct	124 ms	14460 KB	Output is correct
54	Correct	131 ms	15220 KB	Output is correct
55	Correct	155 ms	15220 KB	Output is correct
56	Correct	132 ms	15220 KB	Output is correct
57	Correct	131 ms	15220 KB	Output is correct
58	Correct	120 ms	15220 KB	Output is correct
59	Correct	108 ms	15220 KB	Output is correct
60	Correct	108 ms	15220 KB	Output is correct
61	Correct	107 ms	15220 KB	Output is correct
62	Correct	105 ms	15220 KB	Output is correct
63	Correct	105 ms	15220 KB	Output is correct
64	Correct	120 ms	15220 KB	Output is correct
65	Correct	168 ms	15220 KB	Output is correct
66	Correct	172 ms	15220 KB	Output is correct
67	Correct	130 ms	15220 KB	Output is correct
68	Correct	125 ms	15220 KB	Output is correct
69	Correct	122 ms	15220 KB	Output is correct
70	Correct	124 ms	15220 KB	Output is correct
71	Correct	136 ms	15220 KB	Output is correct
72	Correct	130 ms	15220 KB	Output is correct
73	Correct	134 ms	15356 KB	Output is correct
74	Correct	132 ms	15356 KB	Output is correct
75	Correct	140 ms	15356 KB	Output is correct
76	Correct	132 ms	15896 KB	Output is correct
77	Correct	139 ms	15896 KB	Output is correct
78	Correct	112 ms	15896 KB	Output is correct
79	Correct	112 ms	15896 KB	Output is correct

Subtask #4
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	8184 KB	Output is correct
2	Correct	8 ms	8368 KB	Output is correct
3	Correct	10 ms	8368 KB	Output is correct
4	Correct	8 ms	8368 KB	Output is correct
5	Correct	8 ms	8404 KB	Output is correct
6	Correct	8 ms	8404 KB	Output is correct
7	Correct	8 ms	8404 KB	Output is correct
8	Correct	8 ms	8404 KB	Output is correct
9	Correct	8 ms	8404 KB	Output is correct
10	Correct	8 ms	8452 KB	Output is correct
11	Correct	8 ms	8452 KB	Output is correct
12	Correct	8 ms	8452 KB	Output is correct
13	Correct	8 ms	8452 KB	Output is correct
14	Correct	8 ms	8452 KB	Output is correct
15	Correct	8 ms	8452 KB	Output is correct
16	Correct	8 ms	8452 KB	Output is correct
17	Correct	8 ms	8452 KB	Output is correct
18	Correct	8 ms	8452 KB	Output is correct
19	Correct	10 ms	8452 KB	Output is correct
20	Correct	8 ms	8540 KB	Output is correct
21	Correct	8 ms	8540 KB	Output is correct
22	Correct	10 ms	8540 KB	Output is correct
23	Correct	8 ms	8540 KB	Output is correct
24	Correct	11 ms	8540 KB	Output is correct
25	Correct	12 ms	8544 KB	Output is correct
26	Correct	10 ms	8544 KB	Output is correct
27	Correct	10 ms	8544 KB	Output is correct
28	Correct	10 ms	8544 KB	Output is correct
29	Correct	11 ms	8616 KB	Output is correct
30	Correct	10 ms	8616 KB	Output is correct
31	Correct	10 ms	8616 KB	Output is correct
32	Correct	10 ms	8616 KB	Output is correct
33	Correct	12 ms	8616 KB	Output is correct
34	Correct	10 ms	8616 KB	Output is correct
35	Correct	10 ms	8684 KB	Output is correct
36	Correct	9 ms	8684 KB	Output is correct
37	Correct	10 ms	8684 KB	Output is correct
38	Correct	10 ms	8684 KB	Output is correct
39	Correct	10 ms	8684 KB	Output is correct
40	Correct	10 ms	8684 KB	Output is correct
41	Correct	10 ms	8684 KB	Output is correct
42	Correct	11 ms	8684 KB	Output is correct
43	Correct	9 ms	8684 KB	Output is correct
44	Correct	10 ms	8684 KB	Output is correct
45	Correct	114 ms	14312 KB	Output is correct
46	Correct	114 ms	14312 KB	Output is correct
47	Correct	114 ms	14332 KB	Output is correct
48	Correct	114 ms	14460 KB	Output is correct
49	Correct	122 ms	14460 KB	Output is correct
50	Correct	111 ms	14460 KB	Output is correct
51	Correct	110 ms	14460 KB	Output is correct
52	Correct	129 ms	14460 KB	Output is correct
53	Correct	124 ms	14460 KB	Output is correct
54	Correct	131 ms	15220 KB	Output is correct
55	Correct	155 ms	15220 KB	Output is correct
56	Correct	132 ms	15220 KB	Output is correct
57	Correct	131 ms	15220 KB	Output is correct
58	Correct	120 ms	15220 KB	Output is correct
59	Correct	108 ms	15220 KB	Output is correct
60	Correct	108 ms	15220 KB	Output is correct
61	Correct	107 ms	15220 KB	Output is correct
62	Correct	105 ms	15220 KB	Output is correct
63	Correct	105 ms	15220 KB	Output is correct
64	Correct	120 ms	15220 KB	Output is correct
65	Correct	168 ms	15220 KB	Output is correct
66	Correct	172 ms	15220 KB	Output is correct
67	Correct	130 ms	15220 KB	Output is correct
68	Correct	125 ms	15220 KB	Output is correct
69	Correct	122 ms	15220 KB	Output is correct
70	Correct	124 ms	15220 KB	Output is correct
71	Correct	136 ms	15220 KB	Output is correct
72	Correct	130 ms	15220 KB	Output is correct
73	Correct	134 ms	15356 KB	Output is correct
74	Correct	132 ms	15356 KB	Output is correct
75	Correct	140 ms	15356 KB	Output is correct
76	Correct	132 ms	15896 KB	Output is correct
77	Correct	139 ms	15896 KB	Output is correct
78	Correct	112 ms	15896 KB	Output is correct
79	Correct	112 ms	15896 KB	Output is correct
80	Correct	1394 ms	67324 KB	Output is correct
81	Correct	1375 ms	81916 KB	Output is correct
82	Correct	1487 ms	96504 KB	Output is correct
83	Correct	1480 ms	110932 KB	Output is correct
84	Correct	1496 ms	125652 KB	Output is correct
85	Correct	1447 ms	140072 KB	Output is correct
86	Correct	1473 ms	154888 KB	Output is correct
87	Correct	2059 ms	169248 KB	Output is correct
88	Correct	2032 ms	183756 KB	Output is correct
89	Correct	2209 ms	206832 KB	Output is correct
90	Correct	2080 ms	220024 KB	Output is correct
91	Correct	2021 ms	234008 KB	Output is correct
92	Correct	2035 ms	242076 KB	Output is correct
93	Correct	2072 ms	256828 KB	Output is correct
94	Correct	1251 ms	271400 KB	Output is correct
95	Correct	1357 ms	286024 KB	Output is correct
96	Correct	1351 ms	300416 KB	Output is correct
97	Correct	1251 ms	317632 KB	Output is correct
98	Correct	1358 ms	330468 KB	Output is correct
99	Correct	1465 ms	344824 KB	Output is correct
100	Correct	3085 ms	358916 KB	Output is correct
101	Correct	3016 ms	373420 KB	Output is correct
102	Correct	2058 ms	389460 KB	Output is correct
103	Correct	2029 ms	406416 KB	Output is correct
104	Correct	1925 ms	419724 KB	Output is correct
105	Correct	1899 ms	434236 KB	Output is correct
106	Correct	2134 ms	452408 KB	Output is correct
107	Correct	2069 ms	466600 KB	Output is correct
108	Correct	2128 ms	479264 KB	Output is correct
109	Correct	2154 ms	498572 KB	Output is correct
110	Correct	2255 ms	514680 KB	Output is correct
111	Correct	2198 ms	534844 KB	Output is correct
112	Correct	2427 ms	549248 KB	Output is correct
113	Correct	1401 ms	549248 KB	Output is correct
114	Correct	1381 ms	562856 KB	Output is correct

Submission #74224

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