oj.uz

Submission #889056

# Submission time Handle Problem Language Result Execution time Memory
889056 2023-12-18T17:52:06 Z vjudge1 Port Facility (JOI17_port_facility) C++17
78 / 100
 6000 ms 240596 KB 
    #include "bits/stdc++.h"
    using namespace std;
     
    #define ar array
     
    const int N = 2e6 + 5;
    const int mod = 1e9 + 7;
     
    struct ST{
    	ar<int, 2> tree[N << 2];
    	void sett(int i, int v, int lx = 0, int rx = N, int x = 1){
    		if(lx == rx) { tree[x] = {v, v}; return; }
    		int m = (lx + rx) >> 1;
    		if(i <= m) sett(i, v, lx, m, x<<1);
    		else sett(i, v, m+1, rx, x<<1|1);
    		tree[x][0] = min(tree[x<<1][0], tree[x<<1|1][0]);
    		tree[x][1] = max(tree[x<<1][1], tree[x<<1|1][1]);
    	}
    	
    	ar<int, 2> get(int l, int r, int lx = 0, int rx = N, int x = 1){
    		if(lx > r || rx < l) return {N, -N};
    		if(lx >= l && rx <= r) return tree[x];
    		int m = (lx + rx) >> 1;
    		auto L = get(l, r, lx, m, x<<1);
    		auto R = get(l, r, m+1, rx, x<<1|1);
    		return {min(L[0], R[0]), max(L[1], R[1])};
    	}
    }tree;
     
    vector<int> edges[N], sub[N];
    int l[N], r[N], id[N], used[N];
    int c[N], par[N];
     
    signed main(){
    	ios::sync_with_stdio(0); cin.tie(0);
    	
    	int n; cin>>n;
    	vector<int> cmp;
    	for(int i=0;i<n;i++){
    		cin>>l[i]>>r[i];
    		tree.sett(l[i], r[i]);
    		tree.sett(r[i], l[i]);
    		id[l[i]] = id[r[i]] = i;
    		par[i] = i, cmp.push_back(i);
    		sub[i].push_back(i);
    	}
    	
    	while(true){
    		vector<ar<int, 2>> merge;
    		for(auto i : cmp){
    			for(auto x : sub[i]){
    				tree.sett(l[x], l[x]);
    				tree.sett(r[x], r[x]);
    			}
    			
    			for(auto x : sub[i]){
    				auto m = tree.get(l[x], r[x]);
    				if(m[0] < l[x]){
    					merge.push_back({x, id[m[0]]});
    					break;
    				} if(r[x] < m[1]){
    					merge.push_back({x, id[m[1]]});
    					break;
    				}
    			}
    			
    			for(auto x : sub[i]){
    				tree.sett(l[x], r[x]);
    				tree.sett(r[x], l[x]);
    			}
    		}
    		
    		for(auto x : merge){
    			int a = par[x[0]], b = par[x[1]];
    			if(a == b) continue;
    			edges[x[0]].push_back(x[1]);
    			edges[x[1]].push_back(x[0]);
    			if(sub[a].size() < sub[b].size()) swap(a, b);
    			for(auto x : sub[b]) par[x] = a, sub[a].push_back(x);
    			sub[b].clear();
    		}
    		int last = cmp.size();
    		cmp.clear();
    		for(int i=0;i<n;i++){
    			if(i == par[i]) cmp.push_back(i);
    		}
    		
    		if((int)cmp.size() == last) break;
    	}
    	
    	for(int i=0;i<n;i++) tree.sett(l[i], l[i]), tree.sett(r[i], r[i]);
    	
    	vector<int> tt[2];
    	function<void(int)> dfs = [&](int u){
    		used[u] = 1;
    		tt[c[u]].push_back(u);
    		for(auto x : edges[u]){
    			if(!used[x]){
    				c[x] = c[u] ^ 1;
    				dfs(x);
    			}
    		}
    	};
    	
    	int cnt=0;
    	for(int i=0;i<n;i++){
    		if(used[i]) continue;
    		dfs(i);
    		for(int t=0;t<2;t++){
    			for(auto x : tt[t]){
    				tree.sett(l[x], r[x]);
    				tree.sett(r[x], l[x]);
    			}
    			
    			for(auto x : tt[t]){
    				auto m = tree.get(l[x], r[x]);
    				if(m[0] < l[x] || r[x] < m[1]){
    					cout<<0<<"\n";
    					return 0;
    				}
    			}
    			
    			for(auto x : tt[t]){
    				tree.sett(l[x], l[x]);
    				tree.sett(r[x], r[x]);
    			} tt[t].clear();
    		} cnt++;
    	}
    	
    	int res = 1;
    	while(cnt--){
    		res = res * 2ll % mod;
    	}
    	
    	cout<<res<<"\n";
    }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 111196 KB Output is correct
2 Correct 22 ms 111196 KB Output is correct
3 Correct 22 ms 111196 KB Output is correct
4 Correct 22 ms 111196 KB Output is correct
5 Correct 23 ms 111196 KB Output is correct
6 Correct 23 ms 111196 KB Output is correct
7 Correct 22 ms 111196 KB Output is correct
8 Correct 24 ms 111444 KB Output is correct
9 Correct 22 ms 111192 KB Output is correct
10 Correct 23 ms 111196 KB Output is correct
11 Correct 23 ms 111196 KB Output is correct
12 Correct 22 ms 111196 KB Output is correct
13 Correct 22 ms 111196 KB Output is correct
14 Correct 22 ms 111196 KB Output is correct
15 Correct 22 ms 111196 KB Output is correct
16 Correct 22 ms 111096 KB Output is correct
17 Correct 23 ms 111196 KB Output is correct
18 Correct 23 ms 111252 KB Output is correct
19 Correct 24 ms 111560 KB Output is correct
20 Correct 22 ms 111288 KB Output is correct
21 Correct 23 ms 111196 KB Output is correct
22 Correct 23 ms 111284 KB Output is correct
23 Correct 23 ms 111192 KB Output is correct
24 Correct 22 ms 111284 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 111196 KB Output is correct
2 Correct 22 ms 111196 KB Output is correct
3 Correct 22 ms 111196 KB Output is correct
4 Correct 22 ms 111196 KB Output is correct
5 Correct 23 ms 111196 KB Output is correct
6 Correct 23 ms 111196 KB Output is correct
7 Correct 22 ms 111196 KB Output is correct
8 Correct 24 ms 111444 KB Output is correct
9 Correct 22 ms 111192 KB Output is correct
10 Correct 23 ms 111196 KB Output is correct
11 Correct 23 ms 111196 KB Output is correct
12 Correct 22 ms 111196 KB Output is correct
13 Correct 22 ms 111196 KB Output is correct
14 Correct 22 ms 111196 KB Output is correct
15 Correct 22 ms 111196 KB Output is correct
16 Correct 22 ms 111096 KB Output is correct
17 Correct 23 ms 111196 KB Output is correct
18 Correct 23 ms 111252 KB Output is correct
19 Correct 24 ms 111560 KB Output is correct
20 Correct 22 ms 111288 KB Output is correct
21 Correct 23 ms 111196 KB Output is correct
22 Correct 23 ms 111284 KB Output is correct
23 Correct 23 ms 111192 KB Output is correct
24 Correct 22 ms 111284 KB Output is correct
25 Correct 30 ms 111452 KB Output is correct
26 Correct 30 ms 111460 KB Output is correct
27 Correct 29 ms 111452 KB Output is correct
28 Correct 30 ms 111420 KB Output is correct
29 Correct 28 ms 111448 KB Output is correct
30 Correct 31 ms 111448 KB Output is correct
31 Correct 32 ms 111452 KB Output is correct
32 Correct 29 ms 111472 KB Output is correct
33 Correct 29 ms 111452 KB Output is correct
34 Correct 28 ms 111452 KB Output is correct
35 Correct 26 ms 111196 KB Output is correct
36 Correct 26 ms 111196 KB Output is correct
37 Correct 27 ms 111704 KB Output is correct
38 Correct 26 ms 111460 KB Output is correct
39 Correct 27 ms 111452 KB Output is correct
40 Correct 26 ms 111196 KB Output is correct
41 Correct 30 ms 111400 KB Output is correct
42 Correct 28 ms 111448 KB Output is correct
43 Correct 27 ms 111448 KB Output is correct
44 Correct 27 ms 111452 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 111196 KB Output is correct
2 Correct 22 ms 111196 KB Output is correct
3 Correct 22 ms 111196 KB Output is correct
4 Correct 22 ms 111196 KB Output is correct
5 Correct 23 ms 111196 KB Output is correct
6 Correct 23 ms 111196 KB Output is correct
7 Correct 22 ms 111196 KB Output is correct
8 Correct 24 ms 111444 KB Output is correct
9 Correct 22 ms 111192 KB Output is correct
10 Correct 23 ms 111196 KB Output is correct
11 Correct 23 ms 111196 KB Output is correct
12 Correct 22 ms 111196 KB Output is correct
13 Correct 22 ms 111196 KB Output is correct
14 Correct 22 ms 111196 KB Output is correct
15 Correct 22 ms 111196 KB Output is correct
16 Correct 22 ms 111096 KB Output is correct
17 Correct 23 ms 111196 KB Output is correct
18 Correct 23 ms 111252 KB Output is correct
19 Correct 24 ms 111560 KB Output is correct
20 Correct 22 ms 111288 KB Output is correct
21 Correct 23 ms 111196 KB Output is correct
22 Correct 23 ms 111284 KB Output is correct
23 Correct 23 ms 111192 KB Output is correct
24 Correct 22 ms 111284 KB Output is correct
25 Correct 30 ms 111452 KB Output is correct
26 Correct 30 ms 111460 KB Output is correct
27 Correct 29 ms 111452 KB Output is correct
28 Correct 30 ms 111420 KB Output is correct
29 Correct 28 ms 111448 KB Output is correct
30 Correct 31 ms 111448 KB Output is correct
31 Correct 32 ms 111452 KB Output is correct
32 Correct 29 ms 111472 KB Output is correct
33 Correct 29 ms 111452 KB Output is correct
34 Correct 28 ms 111452 KB Output is correct
35 Correct 26 ms 111196 KB Output is correct
36 Correct 26 ms 111196 KB Output is correct
37 Correct 27 ms 111704 KB Output is correct
38 Correct 26 ms 111460 KB Output is correct
39 Correct 27 ms 111452 KB Output is correct
40 Correct 26 ms 111196 KB Output is correct
41 Correct 30 ms 111400 KB Output is correct
42 Correct 28 ms 111448 KB Output is correct
43 Correct 27 ms 111448 KB Output is correct
44 Correct 27 ms 111452 KB Output is correct
45 Correct 486 ms 125648 KB Output is correct
46 Correct 537 ms 126160 KB Output is correct
47 Correct 485 ms 125688 KB Output is correct
48 Correct 493 ms 126212 KB Output is correct
49 Correct 491 ms 125892 KB Output is correct
50 Correct 418 ms 125904 KB Output is correct
51 Correct 417 ms 125896 KB Output is correct
52 Correct 223 ms 121292 KB Output is correct
53 Correct 267 ms 121324 KB Output is correct
54 Correct 287 ms 126524 KB Output is correct
55 Correct 268 ms 126200 KB Output is correct
56 Correct 280 ms 126364 KB Output is correct
57 Correct 299 ms 125004 KB Output is correct
58 Correct 226 ms 121308 KB Output is correct
59 Correct 314 ms 122316 KB Output is correct
60 Correct 389 ms 123716 KB Output is correct
61 Correct 434 ms 124912 KB Output is correct
62 Correct 250 ms 123664 KB Output is correct
63 Correct 376 ms 124236 KB Output is correct
64 Correct 368 ms 124908 KB Output is correct
65 Correct 273 ms 126776 KB Output is correct
66 Correct 281 ms 126512 KB Output is correct
67 Correct 353 ms 126440 KB Output is correct
68 Correct 339 ms 126440 KB Output is correct
69 Correct 343 ms 127024 KB Output is correct
70 Correct 344 ms 126488 KB Output is correct
71 Correct 338 ms 126512 KB Output is correct
72 Correct 338 ms 126492 KB Output is correct
73 Correct 349 ms 126512 KB Output is correct
74 Correct 338 ms 126764 KB Output is correct
75 Correct 327 ms 133432 KB Output is correct
76 Correct 324 ms 132920 KB Output is correct
77 Correct 305 ms 135244 KB Output is correct
78 Correct 515 ms 126104 KB Output is correct
79 Correct 484 ms 126196 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 111196 KB Output is correct
2 Correct 22 ms 111196 KB Output is correct
3 Correct 22 ms 111196 KB Output is correct
4 Correct 22 ms 111196 KB Output is correct
5 Correct 23 ms 111196 KB Output is correct
6 Correct 23 ms 111196 KB Output is correct
7 Correct 22 ms 111196 KB Output is correct
8 Correct 24 ms 111444 KB Output is correct
9 Correct 22 ms 111192 KB Output is correct
10 Correct 23 ms 111196 KB Output is correct
11 Correct 23 ms 111196 KB Output is correct
12 Correct 22 ms 111196 KB Output is correct
13 Correct 22 ms 111196 KB Output is correct
14 Correct 22 ms 111196 KB Output is correct
15 Correct 22 ms 111196 KB Output is correct
16 Correct 22 ms 111096 KB Output is correct
17 Correct 23 ms 111196 KB Output is correct
18 Correct 23 ms 111252 KB Output is correct
19 Correct 24 ms 111560 KB Output is correct
20 Correct 22 ms 111288 KB Output is correct
21 Correct 23 ms 111196 KB Output is correct
22 Correct 23 ms 111284 KB Output is correct
23 Correct 23 ms 111192 KB Output is correct
24 Correct 22 ms 111284 KB Output is correct
25 Correct 30 ms 111452 KB Output is correct
26 Correct 30 ms 111460 KB Output is correct
27 Correct 29 ms 111452 KB Output is correct
28 Correct 30 ms 111420 KB Output is correct
29 Correct 28 ms 111448 KB Output is correct
30 Correct 31 ms 111448 KB Output is correct
31 Correct 32 ms 111452 KB Output is correct
32 Correct 29 ms 111472 KB Output is correct
33 Correct 29 ms 111452 KB Output is correct
34 Correct 28 ms 111452 KB Output is correct
35 Correct 26 ms 111196 KB Output is correct
36 Correct 26 ms 111196 KB Output is correct
37 Correct 27 ms 111704 KB Output is correct
38 Correct 26 ms 111460 KB Output is correct
39 Correct 27 ms 111452 KB Output is correct
40 Correct 26 ms 111196 KB Output is correct
41 Correct 30 ms 111400 KB Output is correct
42 Correct 28 ms 111448 KB Output is correct
43 Correct 27 ms 111448 KB Output is correct
44 Correct 27 ms 111452 KB Output is correct
45 Correct 486 ms 125648 KB Output is correct
46 Correct 537 ms 126160 KB Output is correct
47 Correct 485 ms 125688 KB Output is correct
48 Correct 493 ms 126212 KB Output is correct
49 Correct 491 ms 125892 KB Output is correct
50 Correct 418 ms 125904 KB Output is correct
51 Correct 417 ms 125896 KB Output is correct
52 Correct 223 ms 121292 KB Output is correct
53 Correct 267 ms 121324 KB Output is correct
54 Correct 287 ms 126524 KB Output is correct
55 Correct 268 ms 126200 KB Output is correct
56 Correct 280 ms 126364 KB Output is correct
57 Correct 299 ms 125004 KB Output is correct
58 Correct 226 ms 121308 KB Output is correct
59 Correct 314 ms 122316 KB Output is correct
60 Correct 389 ms 123716 KB Output is correct
61 Correct 434 ms 124912 KB Output is correct
62 Correct 250 ms 123664 KB Output is correct
63 Correct 376 ms 124236 KB Output is correct
64 Correct 368 ms 124908 KB Output is correct
65 Correct 273 ms 126776 KB Output is correct
66 Correct 281 ms 126512 KB Output is correct
67 Correct 353 ms 126440 KB Output is correct
68 Correct 339 ms 126440 KB Output is correct
69 Correct 343 ms 127024 KB Output is correct
70 Correct 344 ms 126488 KB Output is correct
71 Correct 338 ms 126512 KB Output is correct
72 Correct 338 ms 126492 KB Output is correct
73 Correct 349 ms 126512 KB Output is correct
74 Correct 338 ms 126764 KB Output is correct
75 Correct 327 ms 133432 KB Output is correct
76 Correct 324 ms 132920 KB Output is correct
77 Correct 305 ms 135244 KB Output is correct
78 Correct 515 ms 126104 KB Output is correct
79 Correct 484 ms 126196 KB Output is correct
80 Execution timed out 6103 ms 240596 KB Time limit exceeded
81 Halted 0 ms 0 KB -