oj.uz

Submission #79769

# Submission time Handle Problem Language Result Execution time Memory
79769 2018-10-16T09:08:18 Z Plurm Port Facility (JOI17_port_facility) C++11
100 / 100
 3645 ms 661808 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> g[1000005];
int segTmin[4*1000005];
int segTmax[4*1000005];
int lb[4*1000005];
int rb[4*1000005];
vector<tuple<int,int,int> > pts;
int p[1000005];
int bck[2*1000005];
int fn(int x){
	if(p[x] == -1) return x;
	else return p[x] = fn(p[x]);
}
void un(int x,int y){
	x = fn(x);
	y = fn(y);
	if(x != y) p[x] = y;
}
void build(int c,int l,int r){
	lb[c] = l;
	rb[c] = r;
	if(l == r){
		segTmin[c] = get<1>(pts[l]);
		segTmax[c] = get<2>(pts[l]);
		return;
	}
	int k = (l + r)/2;
	build(2*c,l,k);
	build(2*c+1,k+1,r);
	segTmin[c] = min(segTmin[2*c],segTmin[2*c+1]);
	segTmax[c] = max(segTmax[2*c],segTmax[2*c+1]);
}
int querymin(int c,int l,int r){
	if(lb[c] == l && rb[c] == r) return segTmin[c];
	int k = (lb[c] + rb[c])/2;
	if(l <= k && k < r) return min(querymin(2*c,l,k),querymin(2*c+1,k+1,r));
	else if(r <= k) return querymin(2*c,l,r);
	else return querymin(2*c+1,l,r);
}
int querymax(int c,int l,int r){
	if(lb[c] == l && rb[c] == r) return segTmax[c]; 
	int k = (lb[c] + rb[c])/2;
	if(l <= k && k < r) return max(querymax(2*c,l,k),querymax(2*c+1,k+1,r));
	else if(r <= k) return querymax(2*c,l,r);
	else return querymax(2*c+1,l,r);
}
int col[1000005];
bool dfs(int u,int p = -1,int c = 1){
	col[u] = c;
	c = c % 2 + 1;
	for(int v : g[u]){
		if(v == p) continue;
		if(col[v] && col[v] != c) return false;
		if(col[v]) continue;
		if(!dfs(v,u,c)) return false;
	}
	return true;
}
int main(){
	memset(p,-1,sizeof(p));
	int n;
	scanf("%d",&n);
	int a,b;
	for(int i = 0; i < n; i++){
		scanf("%d%d",&a,&b);
		pts.emplace_back(i,a,b);
	}
	sort(pts.begin(),pts.end(),[](tuple<int,int,int> x,tuple<int,int,int> y){
		return get<2>(x) < get<2>(y);
	});
	for(int i = 0; i < n; i++){
		bck[get<1>(pts[i])] = get<0>(pts[i]);
	}
	int c = 0;
	build(1,0,pts.size()-1);
	for(int i = 0; i < n; i++){
		int idx = upper_bound(pts.begin(),pts.end(),make_tuple(0,0,get<1>(pts[i])),[](tuple<int,int,int> x,tuple<int,int,int> y){
			return get<2>(x) < get<2>(y);
		}) - pts.begin();
		if(idx <= i-1 && querymin(1,idx,i-1) < get<1>(pts[i])){
			int l = querymin(1,idx,i-1);
			un(bck[l],get<0>(pts[i]));
			g[bck[l]].push_back(get<0>(pts[i]));
			g[get<0>(pts[i])].push_back(bck[l]);
		}
	}
	sort(pts.begin(),pts.end(),[](tuple<int,int,int> x,tuple<int,int,int> y){
		return get<1>(x) < get<1>(y);
	});
	for(int i = 0; i < n; i++){
		bck[get<2>(pts[i])] = get<0>(pts[i]);
	}
	build(1,0,pts.size()-1);
	for(int i = n-1; i >= 0; i--){
		int idx = lower_bound(pts.begin(),pts.end(),make_tuple(0,get<2>(pts[i]),0),[](tuple<int,int,int> x,tuple<int,int,int> y){
			return get<1>(x) < get<1>(y);
		}) - pts.begin() - 1;
		if(idx >= i+1 && querymax(1,i+1,idx) > get<2>(pts[i])){
			int r = querymax(1,i+1,idx);
			un(bck[r],get<0>(pts[i]));
			g[bck[r]].push_back(get<0>(pts[i]));
			g[get<0>(pts[i])].push_back(bck[r]);
		}
	}
	for(int i = 0; i < pts.size(); i++){
		if(col[i]) continue;
		if(!dfs(i)){
			printf("0\n");
			return 0;
		}
	}
	set<int> s;
	for(int i = 0; i < n; i++){
		s.insert(fn(i));
	}
	c = s.size();
	int ans = 1;
	for(int i = 0; i < c; i++){
		ans *= 2;
		ans %= 1000000007;
	}
	printf("%d\n",ans);
	return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:106:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < pts.size(); i++){
                 ~~^~~~~~~~~~~~
port_facility.cpp:63:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
port_facility.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&a,&b);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27768 KB Output is correct
2 Correct 26 ms 27768 KB Output is correct
3 Correct 27 ms 27844 KB Output is correct
4 Correct 29 ms 27916 KB Output is correct
5 Correct 27 ms 27936 KB Output is correct
6 Correct 27 ms 28140 KB Output is correct
7 Correct 26 ms 28140 KB Output is correct
8 Correct 26 ms 28140 KB Output is correct
9 Correct 27 ms 28140 KB Output is correct
10 Correct 27 ms 28140 KB Output is correct
11 Correct 26 ms 28140 KB Output is correct
12 Correct 27 ms 28140 KB Output is correct
13 Correct 27 ms 28140 KB Output is correct
14 Correct 27 ms 28140 KB Output is correct
15 Correct 30 ms 28140 KB Output is correct
16 Correct 26 ms 28140 KB Output is correct
17 Correct 26 ms 28140 KB Output is correct
18 Correct 27 ms 28140 KB Output is correct
19 Correct 28 ms 28140 KB Output is correct
20 Correct 26 ms 28140 KB Output is correct
21 Correct 30 ms 28140 KB Output is correct
22 Correct 27 ms 28140 KB Output is correct
23 Correct 27 ms 28140 KB Output is correct
24 Correct 26 ms 28140 KB Output is correct
25 Correct 28 ms 28156 KB Output is correct
26 Correct 29 ms 28156 KB Output is correct
27 Correct 29 ms 28156 KB Output is correct
28 Correct 28 ms 28180 KB Output is correct
29 Correct 28 ms 28180 KB Output is correct
30 Correct 29 ms 28180 KB Output is correct
31 Correct 35 ms 28180 KB Output is correct
32 Correct 29 ms 28180 KB Output is correct
33 Correct 28 ms 28180 KB Output is correct
34 Correct 28 ms 28204 KB Output is correct
35 Correct 29 ms 28304 KB Output is correct
36 Correct 27 ms 28304 KB Output is correct
37 Correct 28 ms 28304 KB Output is correct
38 Correct 29 ms 28304 KB Output is correct
39 Correct 29 ms 28304 KB Output is correct
40 Correct 30 ms 28304 KB Output is correct
41 Correct 30 ms 28304 KB Output is correct
42 Correct 28 ms 28304 KB Output is correct
43 Correct 28 ms 28312 KB Output is correct
44 Correct 29 ms 28312 KB Output is correct
45 Correct 198 ms 38228 KB Output is correct
46 Correct 191 ms 39572 KB Output is correct
47 Correct 189 ms 40844 KB Output is correct
48 Correct 191 ms 42192 KB Output is correct
49 Correct 198 ms 43468 KB Output is correct
50 Correct 160 ms 43632 KB Output is correct
51 Correct 208 ms 44664 KB Output is correct
52 Correct 116 ms 48116 KB Output is correct
53 Correct 135 ms 49380 KB Output is correct
54 Correct 140 ms 50032 KB Output is correct
55 Correct 157 ms 51116 KB Output is correct
56 Correct 166 ms 52484 KB Output is correct
57 Correct 178 ms 55184 KB Output is correct
58 Correct 131 ms 55684 KB Output is correct
59 Correct 155 ms 57244 KB Output is correct
60 Correct 198 ms 58148 KB Output is correct
61 Correct 195 ms 58688 KB Output is correct
62 Correct 150 ms 58688 KB Output is correct
63 Correct 158 ms 59228 KB Output is correct
64 Correct 167 ms 61072 KB Output is correct
65 Correct 222 ms 64128 KB Output is correct
66 Correct 220 ms 65308 KB Output is correct
67 Correct 164 ms 66576 KB Output is correct
68 Correct 176 ms 67592 KB Output is correct
69 Correct 165 ms 69492 KB Output is correct
70 Correct 169 ms 70592 KB Output is correct
71 Correct 162 ms 71792 KB Output is correct
72 Correct 147 ms 72920 KB Output is correct
73 Correct 146 ms 74184 KB Output is correct
74 Correct 155 ms 75476 KB Output is correct
75 Correct 162 ms 78376 KB Output is correct
76 Correct 171 ms 81676 KB Output is correct
77 Correct 173 ms 82820 KB Output is correct
78 Correct 189 ms 82820 KB Output is correct
79 Correct 184 ms 82820 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27768 KB Output is correct
2 Correct 26 ms 27768 KB Output is correct
3 Correct 27 ms 27844 KB Output is correct
4 Correct 29 ms 27916 KB Output is correct
5 Correct 27 ms 27936 KB Output is correct
6 Correct 27 ms 28140 KB Output is correct
7 Correct 26 ms 28140 KB Output is correct
8 Correct 26 ms 28140 KB Output is correct
9 Correct 27 ms 28140 KB Output is correct
10 Correct 27 ms 28140 KB Output is correct
11 Correct 26 ms 28140 KB Output is correct
12 Correct 27 ms 28140 KB Output is correct
13 Correct 27 ms 28140 KB Output is correct
14 Correct 27 ms 28140 KB Output is correct
15 Correct 30 ms 28140 KB Output is correct
16 Correct 26 ms 28140 KB Output is correct
17 Correct 26 ms 28140 KB Output is correct
18 Correct 27 ms 28140 KB Output is correct
19 Correct 28 ms 28140 KB Output is correct
20 Correct 26 ms 28140 KB Output is correct
21 Correct 30 ms 28140 KB Output is correct
22 Correct 27 ms 28140 KB Output is correct
23 Correct 27 ms 28140 KB Output is correct
24 Correct 26 ms 28140 KB Output is correct
25 Correct 28 ms 28156 KB Output is correct
26 Correct 29 ms 28156 KB Output is correct
27 Correct 29 ms 28156 KB Output is correct
28 Correct 28 ms 28180 KB Output is correct
29 Correct 28 ms 28180 KB Output is correct
30 Correct 29 ms 28180 KB Output is correct
31 Correct 35 ms 28180 KB Output is correct
32 Correct 29 ms 28180 KB Output is correct
33 Correct 28 ms 28180 KB Output is correct
34 Correct 28 ms 28204 KB Output is correct
35 Correct 29 ms 28304 KB Output is correct
36 Correct 27 ms 28304 KB Output is correct
37 Correct 28 ms 28304 KB Output is correct
38 Correct 29 ms 28304 KB Output is correct
39 Correct 29 ms 28304 KB Output is correct
40 Correct 30 ms 28304 KB Output is correct
41 Correct 30 ms 28304 KB Output is correct
42 Correct 28 ms 28304 KB Output is correct
43 Correct 28 ms 28312 KB Output is correct
44 Correct 29 ms 28312 KB Output is correct
45 Correct 198 ms 38228 KB Output is correct
46 Correct 191 ms 39572 KB Output is correct
47 Correct 189 ms 40844 KB Output is correct
48 Correct 191 ms 42192 KB Output is correct
49 Correct 198 ms 43468 KB Output is correct
50 Correct 160 ms 43632 KB Output is correct
51 Correct 208 ms 44664 KB Output is correct
52 Correct 116 ms 48116 KB Output is correct
53 Correct 135 ms 49380 KB Output is correct
54 Correct 140 ms 50032 KB Output is correct
55 Correct 157 ms 51116 KB Output is correct
56 Correct 166 ms 52484 KB Output is correct
57 Correct 178 ms 55184 KB Output is correct
58 Correct 131 ms 55684 KB Output is correct
59 Correct 155 ms 57244 KB Output is correct
60 Correct 198 ms 58148 KB Output is correct
61 Correct 195 ms 58688 KB Output is correct
62 Correct 150 ms 58688 KB Output is correct
63 Correct 158 ms 59228 KB Output is correct
64 Correct 167 ms 61072 KB Output is correct
65 Correct 222 ms 64128 KB Output is correct
66 Correct 220 ms 65308 KB Output is correct
67 Correct 164 ms 66576 KB Output is correct
68 Correct 176 ms 67592 KB Output is correct
69 Correct 165 ms 69492 KB Output is correct
70 Correct 169 ms 70592 KB Output is correct
71 Correct 162 ms 71792 KB Output is correct
72 Correct 147 ms 72920 KB Output is correct
73 Correct 146 ms 74184 KB Output is correct
74 Correct 155 ms 75476 KB Output is correct
75 Correct 162 ms 78376 KB Output is correct
76 Correct 171 ms 81676 KB Output is correct
77 Correct 173 ms 82820 KB Output is correct
78 Correct 189 ms 82820 KB Output is correct
79 Correct 184 ms 82820 KB Output is correct
80 Correct 2289 ms 179376 KB Output is correct
81 Correct 2288 ms 193944 KB Output is correct
82 Correct 2314 ms 208644 KB Output is correct
83 Correct 2353 ms 223068 KB Output is correct
84 Correct 2295 ms 237336 KB Output is correct
85 Correct 2173 ms 242332 KB Output is correct
86 Correct 2001 ms 253008 KB Output is correct
87 Correct 1110 ms 289896 KB Output is correct
88 Correct 1456 ms 303040 KB Output is correct
89 Correct 1835 ms 309896 KB Output is correct
90 Correct 2116 ms 322864 KB Output is correct
91 Correct 1883 ms 337368 KB Output is correct
92 Correct 2451 ms 366916 KB Output is correct
93 Correct 1454 ms 372700 KB Output is correct
94 Correct 2013 ms 387576 KB Output is correct
95 Correct 2541 ms 394364 KB Output is correct
96 Correct 2374 ms 405072 KB Output is correct
97 Correct 1595 ms 405072 KB Output is correct
98 Correct 1912 ms 417012 KB Output is correct
99 Correct 2044 ms 434856 KB Output is correct
100 Correct 3461 ms 460592 KB Output is correct
101 Correct 3645 ms 473464 KB Output is correct
102 Correct 2065 ms 486844 KB Output is correct
103 Correct 1918 ms 503772 KB Output is correct
104 Correct 2057 ms 518096 KB Output is correct
105 Correct 1998 ms 526580 KB Output is correct
106 Correct 1784 ms 541044 KB Output is correct
107 Correct 1783 ms 559256 KB Output is correct
108 Correct 1758 ms 574344 KB Output is correct
109 Correct 1714 ms 586616 KB Output is correct
110 Correct 2165 ms 635192 KB Output is correct
111 Correct 2136 ms 649128 KB Output is correct
112 Correct 2125 ms 661808 KB Output is correct
113 Correct 2351 ms 661808 KB Output is correct
114 Correct 2293 ms 661808 KB Output is correct