oj.uz

Submission #131674

# Submission time Handle Problem Language Result Execution time Memory
131674 2019-07-17T12:33:37 Z onjo0127 Port Facility (JOI17_port_facility) C++11
100 / 100
 4466 ms 276508 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

const int MOD = 1e9 + 7, INF = 1e9;
int N, A[1000009], B[1000009], C[1000009];
pii LA[2000009], RA[2000009];

struct segtree {
	vector<pii> T;
	void init(pii A[], int idx, int s, int e) {
		if(s == e) {
			T[idx] = A[s];
			return;
		}
		int m = s+e >> 1;
		init(A, idx<<1, s, m);
		init(A, idx<<1|1, m+1, e);
		T[idx] = max(T[idx<<1], T[idx<<1|1]);
	}
	void upd(int idx, int s, int e, int p, pii v) {
		if(p < s || e < p) return;
		if(s == e) {
			T[idx] = v;
			return;
		}
		int m = s+e >> 1;
		upd(idx<<1, s, m, p, v);
		upd(idx<<1|1, m+1, e, p, v);
		T[idx] = max(T[idx<<1], T[idx<<1|1]);
	}
	pii get(int idx, int s, int e, int l, int r) {
		if(r < s || e < l) return {-INF, -1};
		if(l <= s && e <= r) return T[idx];
		int m = s+e >> 1;
		return max(get(idx*2, s, m, l, r), get(idx*2+1, m+1, e, l, r));
	}
} LS, RS;

void dfs(int x, int c) {
	C[x] = c;
	RS.upd(1, 1, 2*N, A[x], {-INF, x});
	LS.upd(1, 1, 2*N, B[x], {-INF, x});
	while(1) {
		int lm, rm, id; tie(rm, id) = RS.get(1, 1, 2*N, A[x] + 1, B[x] - 1);
		if(rm > B[x]) {
			dfs(id, 3 - c);
			continue;
		}
		tie(lm, id) = LS.get(1, 1, 2*N, A[x] + 1, B[x] - 1); lm = -lm;
		if(lm < A[x]) {
			dfs(id, 3 - c);
			continue;
		}
		break;
	}
}

bool chk(vector<pii> &S) {
	sort(S.begin(), S.end());
	vector<int> T;
	for(auto& it: S) {
		while(T.size() && T.back() < it.first) T.pop_back();
		if(T.size() && T.back() < it.second) return false;
		T.push_back(it.second);
	}
	return true;
}

int main() {
	LS.T.resize(4200000);
	RS.T.resize(4200000);
	scanf("%d",&N);
	for(int i=1; i<=2*N; i++) LA[i] = RA[i] = {-INF, -1};
	for(int i=1; i<=N; i++) {
		scanf("%d%d",&A[i],&B[i]);
		RA[A[i]] = {B[i], i};
		LA[B[i]] = {-A[i], i};
	}
	LS.init(LA, 1, 1, 2*N); RS.init(RA, 1, 1, 2*N);
	int ans = 1;
	for(int i=1; i<=N; i++) if(!C[i]) {
		dfs(i, 1);
		ans *= 2; ans %= MOD;
	}
	vector<pii> AS, BS;
	for(int i=1; i<=N; i++) {
		if(C[i] == 1) AS.push_back({A[i], B[i]});
		if(C[i] == 2) BS.push_back({A[i], B[i]});
	}
	if(!chk(AS) || !chk(BS)) return !printf("0");
	printf("%d", ans);
	return 0;
}

Compilation message

port_facility.cpp: In member function 'void segtree::init(pii*, int, int, int)':
port_facility.cpp:16:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s+e >> 1;
           ~^~
port_facility.cpp: In member function 'void segtree::upd(int, int, int, int, pii)':
port_facility.cpp:27:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s+e >> 1;
           ~^~
port_facility.cpp: In member function 'pii segtree::get(int, int, int, int, int)':
port_facility.cpp:35:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s+e >> 1;
           ~^~
port_facility.cpp: In function 'int main()':
port_facility.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
  ~~~~~^~~~~~~~~
port_facility.cpp:76:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&A[i],&B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 66168 KB Output is correct
2 Correct 73 ms 66168 KB Output is correct
3 Correct 60 ms 66180 KB Output is correct
4 Correct 59 ms 66112 KB Output is correct
5 Correct 59 ms 66168 KB Output is correct
6 Correct 62 ms 66040 KB Output is correct
7 Correct 59 ms 66168 KB Output is correct
8 Correct 59 ms 66168 KB Output is correct
9 Correct 59 ms 66168 KB Output is correct
10 Correct 58 ms 66168 KB Output is correct
11 Correct 59 ms 66296 KB Output is correct
12 Correct 59 ms 66168 KB Output is correct
13 Correct 59 ms 66168 KB Output is correct
14 Correct 58 ms 66140 KB Output is correct
15 Correct 59 ms 66168 KB Output is correct
16 Correct 58 ms 66056 KB Output is correct
17 Correct 69 ms 66084 KB Output is correct
18 Correct 60 ms 66132 KB Output is correct
19 Correct 61 ms 66040 KB Output is correct
20 Correct 58 ms 66168 KB Output is correct
21 Correct 59 ms 66168 KB Output is correct
22 Correct 59 ms 66124 KB Output is correct
23 Correct 58 ms 66040 KB Output is correct
24 Correct 58 ms 66040 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 66168 KB Output is correct
2 Correct 73 ms 66168 KB Output is correct
3 Correct 60 ms 66180 KB Output is correct
4 Correct 59 ms 66112 KB Output is correct
5 Correct 59 ms 66168 KB Output is correct
6 Correct 62 ms 66040 KB Output is correct
7 Correct 59 ms 66168 KB Output is correct
8 Correct 59 ms 66168 KB Output is correct
9 Correct 59 ms 66168 KB Output is correct
10 Correct 58 ms 66168 KB Output is correct
11 Correct 59 ms 66296 KB Output is correct
12 Correct 59 ms 66168 KB Output is correct
13 Correct 59 ms 66168 KB Output is correct
14 Correct 58 ms 66140 KB Output is correct
15 Correct 59 ms 66168 KB Output is correct
16 Correct 58 ms 66056 KB Output is correct
17 Correct 69 ms 66084 KB Output is correct
18 Correct 60 ms 66132 KB Output is correct
19 Correct 61 ms 66040 KB Output is correct
20 Correct 58 ms 66168 KB Output is correct
21 Correct 59 ms 66168 KB Output is correct
22 Correct 59 ms 66124 KB Output is correct
23 Correct 58 ms 66040 KB Output is correct
24 Correct 58 ms 66040 KB Output is correct
25 Correct 63 ms 66448 KB Output is correct
26 Correct 62 ms 66396 KB Output is correct
27 Correct 62 ms 66300 KB Output is correct
28 Correct 61 ms 66396 KB Output is correct
29 Correct 64 ms 66424 KB Output is correct
30 Correct 62 ms 66296 KB Output is correct
31 Correct 61 ms 66444 KB Output is correct
32 Correct 62 ms 66412 KB Output is correct
33 Correct 61 ms 66264 KB Output is correct
34 Correct 61 ms 66356 KB Output is correct
35 Correct 60 ms 66188 KB Output is correct
36 Correct 61 ms 66168 KB Output is correct
37 Correct 63 ms 66524 KB Output is correct
38 Correct 61 ms 66304 KB Output is correct
39 Correct 60 ms 66268 KB Output is correct
40 Correct 60 ms 66204 KB Output is correct
41 Correct 61 ms 66468 KB Output is correct
42 Correct 62 ms 66460 KB Output is correct
43 Correct 61 ms 66424 KB Output is correct
44 Correct 60 ms 66524 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 66168 KB Output is correct
2 Correct 73 ms 66168 KB Output is correct
3 Correct 60 ms 66180 KB Output is correct
4 Correct 59 ms 66112 KB Output is correct
5 Correct 59 ms 66168 KB Output is correct
6 Correct 62 ms 66040 KB Output is correct
7 Correct 59 ms 66168 KB Output is correct
8 Correct 59 ms 66168 KB Output is correct
9 Correct 59 ms 66168 KB Output is correct
10 Correct 58 ms 66168 KB Output is correct
11 Correct 59 ms 66296 KB Output is correct
12 Correct 59 ms 66168 KB Output is correct
13 Correct 59 ms 66168 KB Output is correct
14 Correct 58 ms 66140 KB Output is correct
15 Correct 59 ms 66168 KB Output is correct
16 Correct 58 ms 66056 KB Output is correct
17 Correct 69 ms 66084 KB Output is correct
18 Correct 60 ms 66132 KB Output is correct
19 Correct 61 ms 66040 KB Output is correct
20 Correct 58 ms 66168 KB Output is correct
21 Correct 59 ms 66168 KB Output is correct
22 Correct 59 ms 66124 KB Output is correct
23 Correct 58 ms 66040 KB Output is correct
24 Correct 58 ms 66040 KB Output is correct
25 Correct 63 ms 66448 KB Output is correct
26 Correct 62 ms 66396 KB Output is correct
27 Correct 62 ms 66300 KB Output is correct
28 Correct 61 ms 66396 KB Output is correct
29 Correct 64 ms 66424 KB Output is correct
30 Correct 62 ms 66296 KB Output is correct
31 Correct 61 ms 66444 KB Output is correct
32 Correct 62 ms 66412 KB Output is correct
33 Correct 61 ms 66264 KB Output is correct
34 Correct 61 ms 66356 KB Output is correct
35 Correct 60 ms 66188 KB Output is correct
36 Correct 61 ms 66168 KB Output is correct
37 Correct 63 ms 66524 KB Output is correct
38 Correct 61 ms 66304 KB Output is correct
39 Correct 60 ms 66268 KB Output is correct
40 Correct 60 ms 66204 KB Output is correct
41 Correct 61 ms 66468 KB Output is correct
42 Correct 62 ms 66460 KB Output is correct
43 Correct 61 ms 66424 KB Output is correct
44 Correct 60 ms 66524 KB Output is correct
45 Correct 275 ms 73464 KB Output is correct
46 Correct 279 ms 75504 KB Output is correct
47 Correct 278 ms 72180 KB Output is correct
48 Correct 278 ms 75376 KB Output is correct
49 Correct 277 ms 72604 KB Output is correct
50 Correct 270 ms 74948 KB Output is correct
51 Correct 273 ms 74776 KB Output is correct
52 Correct 208 ms 71544 KB Output is correct
53 Correct 256 ms 72164 KB Output is correct
54 Correct 286 ms 85404 KB Output is correct
55 Correct 285 ms 78388 KB Output is correct
56 Correct 290 ms 78364 KB Output is correct
57 Correct 235 ms 71664 KB Output is correct
58 Correct 213 ms 71624 KB Output is correct
59 Correct 244 ms 71536 KB Output is correct
60 Correct 268 ms 71892 KB Output is correct
61 Correct 267 ms 71556 KB Output is correct
62 Correct 226 ms 71972 KB Output is correct
63 Correct 253 ms 71868 KB Output is correct
64 Correct 262 ms 71536 KB Output is correct
65 Correct 365 ms 85492 KB Output is correct
66 Correct 368 ms 85372 KB Output is correct
67 Correct 305 ms 78800 KB Output is correct
68 Correct 290 ms 78760 KB Output is correct
69 Correct 275 ms 78300 KB Output is correct
70 Correct 282 ms 78192 KB Output is correct
71 Correct 322 ms 85892 KB Output is correct
72 Correct 284 ms 85768 KB Output is correct
73 Correct 277 ms 81488 KB Output is correct
74 Correct 279 ms 81360 KB Output is correct
75 Correct 242 ms 79752 KB Output is correct
76 Correct 225 ms 85408 KB Output is correct
77 Correct 224 ms 85556 KB Output is correct
78 Correct 304 ms 74992 KB Output is correct
79 Correct 276 ms 73660 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 66168 KB Output is correct
2 Correct 73 ms 66168 KB Output is correct
3 Correct 60 ms 66180 KB Output is correct
4 Correct 59 ms 66112 KB Output is correct
5 Correct 59 ms 66168 KB Output is correct
6 Correct 62 ms 66040 KB Output is correct
7 Correct 59 ms 66168 KB Output is correct
8 Correct 59 ms 66168 KB Output is correct
9 Correct 59 ms 66168 KB Output is correct
10 Correct 58 ms 66168 KB Output is correct
11 Correct 59 ms 66296 KB Output is correct
12 Correct 59 ms 66168 KB Output is correct
13 Correct 59 ms 66168 KB Output is correct
14 Correct 58 ms 66140 KB Output is correct
15 Correct 59 ms 66168 KB Output is correct
16 Correct 58 ms 66056 KB Output is correct
17 Correct 69 ms 66084 KB Output is correct
18 Correct 60 ms 66132 KB Output is correct
19 Correct 61 ms 66040 KB Output is correct
20 Correct 58 ms 66168 KB Output is correct
21 Correct 59 ms 66168 KB Output is correct
22 Correct 59 ms 66124 KB Output is correct
23 Correct 58 ms 66040 KB Output is correct
24 Correct 58 ms 66040 KB Output is correct
25 Correct 63 ms 66448 KB Output is correct
26 Correct 62 ms 66396 KB Output is correct
27 Correct 62 ms 66300 KB Output is correct
28 Correct 61 ms 66396 KB Output is correct
29 Correct 64 ms 66424 KB Output is correct
30 Correct 62 ms 66296 KB Output is correct
31 Correct 61 ms 66444 KB Output is correct
32 Correct 62 ms 66412 KB Output is correct
33 Correct 61 ms 66264 KB Output is correct
34 Correct 61 ms 66356 KB Output is correct
35 Correct 60 ms 66188 KB Output is correct
36 Correct 61 ms 66168 KB Output is correct
37 Correct 63 ms 66524 KB Output is correct
38 Correct 61 ms 66304 KB Output is correct
39 Correct 60 ms 66268 KB Output is correct
40 Correct 60 ms 66204 KB Output is correct
41 Correct 61 ms 66468 KB Output is correct
42 Correct 62 ms 66460 KB Output is correct
43 Correct 61 ms 66424 KB Output is correct
44 Correct 60 ms 66524 KB Output is correct
45 Correct 275 ms 73464 KB Output is correct
46 Correct 279 ms 75504 KB Output is correct
47 Correct 278 ms 72180 KB Output is correct
48 Correct 278 ms 75376 KB Output is correct
49 Correct 277 ms 72604 KB Output is correct
50 Correct 270 ms 74948 KB Output is correct
51 Correct 273 ms 74776 KB Output is correct
52 Correct 208 ms 71544 KB Output is correct
53 Correct 256 ms 72164 KB Output is correct
54 Correct 286 ms 85404 KB Output is correct
55 Correct 285 ms 78388 KB Output is correct
56 Correct 290 ms 78364 KB Output is correct
57 Correct 235 ms 71664 KB Output is correct
58 Correct 213 ms 71624 KB Output is correct
59 Correct 244 ms 71536 KB Output is correct
60 Correct 268 ms 71892 KB Output is correct
61 Correct 267 ms 71556 KB Output is correct
62 Correct 226 ms 71972 KB Output is correct
63 Correct 253 ms 71868 KB Output is correct
64 Correct 262 ms 71536 KB Output is correct
65 Correct 365 ms 85492 KB Output is correct
66 Correct 368 ms 85372 KB Output is correct
67 Correct 305 ms 78800 KB Output is correct
68 Correct 290 ms 78760 KB Output is correct
69 Correct 275 ms 78300 KB Output is correct
70 Correct 282 ms 78192 KB Output is correct
71 Correct 322 ms 85892 KB Output is correct
72 Correct 284 ms 85768 KB Output is correct
73 Correct 277 ms 81488 KB Output is correct
74 Correct 279 ms 81360 KB Output is correct
75 Correct 242 ms 79752 KB Output is correct
76 Correct 225 ms 85408 KB Output is correct
77 Correct 224 ms 85556 KB Output is correct
78 Correct 304 ms 74992 KB Output is correct
79 Correct 276 ms 73660 KB Output is correct
80 Correct 2854 ms 128976 KB Output is correct
81 Correct 2854 ms 141820 KB Output is correct
82 Correct 2780 ms 136136 KB Output is correct
83 Correct 2846 ms 142000 KB Output is correct
84 Correct 2838 ms 143624 KB Output is correct
85 Correct 2745 ms 137256 KB Output is correct
86 Correct 2808 ms 142104 KB Output is correct
87 Correct 2136 ms 132064 KB Output is correct
88 Correct 3133 ms 139564 KB Output is correct
89 Correct 3140 ms 272636 KB Output is correct
90 Correct 3029 ms 202136 KB Output is correct
91 Correct 3092 ms 202092 KB Output is correct
92 Correct 2441 ms 133444 KB Output is correct
93 Correct 2402 ms 132136 KB Output is correct
94 Correct 2658 ms 134680 KB Output is correct
95 Correct 2688 ms 134132 KB Output is correct
96 Correct 2672 ms 134756 KB Output is correct
97 Correct 2661 ms 133556 KB Output is correct
98 Correct 2630 ms 135980 KB Output is correct
99 Correct 2592 ms 135080 KB Output is correct
100 Correct 4449 ms 272592 KB Output is correct
101 Correct 4466 ms 272628 KB Output is correct
102 Correct 3064 ms 206124 KB Output is correct
103 Correct 3062 ms 206024 KB Output is correct
104 Correct 2923 ms 200828 KB Output is correct
105 Correct 2942 ms 202932 KB Output is correct
106 Correct 3071 ms 276508 KB Output is correct
107 Correct 3066 ms 276500 KB Output is correct
108 Correct 2858 ms 232284 KB Output is correct
109 Correct 2924 ms 232196 KB Output is correct
110 Correct 2783 ms 269644 KB Output is correct
111 Correct 2428 ms 272604 KB Output is correct
112 Correct 2358 ms 272688 KB Output is correct
113 Correct 2885 ms 136224 KB Output is correct
114 Correct 2815 ms 141712 KB Output is correct