oj.uz

답안 #161202

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161202 2019-11-01T11:53:50 Z amoo_safar Port Facility (JOI17_port_facility) C++14
100 / 100
 4637 ms 136952 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const ll Mod = 1000000007LL;
const int Maxn = 2e6 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

int T[Maxn], st[Maxn], fn[Maxn];

int seg[4 * Maxn];
void add(int id, int ind, int x, int L, int R){
	if((ind < L) || (R <= ind)) return ;
	if((ind == L) && (R == ind + 1)){
		seg[id] = x;
		return ;
	}
	int mid = (L + R) >> 1;
	add(id << 1, ind, x, L, mid);
	add(id << 1 | 1, ind, x, mid, R);
	seg[id] = max(seg[id << 1], seg[id << 1 | 1]);
}
int get(int id, int l, int r, int L, int R){
	if((r <= L) || (R <= l)) return -1;
	if((l <= L) && (R <= r)) return seg[id];
	int mid = (L + R) >> 1;
	return max(get(id << 1, l, r, L, mid), get(id << 1 | 1, l, r, mid, R));
}

int seg2[4 * Maxn];
void add2(int id, int ind, int x, int L, int R){
	if((ind < L) || (R <= ind)) return ;
	if((ind == L) && (R == ind + 1)){
		seg2[id] = x;
		return ;
	}
	int mid = (L + R) >> 1;
	add2(id << 1, ind, x, L, mid);
	add2(id << 1 | 1, ind, x, mid, R);
	seg2[id] = min(seg2[id << 1], seg2[id << 1 | 1]);
}
int get2(int id, int l, int r, int L, int R){
	if((r <= L) || (R <= l)) return Maxn;
	if((l <= L) && (R <= r)) return seg2[id];
	int mid = (L + R) >> 1;
	return min(get2(id << 1, l, r, L, mid), get2(id << 1 | 1, l, r, mid, R));
}



int mk[Maxn];
void DFS(int u, int c){
	mk[u] = c;
	add(1, st[u], -1, 0, Maxn);
	add2(1, fn[u], Maxn, 0, Maxn);
	int adj;
	while( fn[u] < (adj = get(1, st[u], fn[u], 0, Maxn)) ) DFS(-T[adj], 3 - c);
	while( st[u] > (adj = get2(1, st[u], fn[u], 0, Maxn)) ) DFS(T[adj], 3 - c);
}


stack<ll> A, B;

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	memset(seg, -1, sizeof seg);
	memset(seg2, 31, sizeof seg2);
	
	ll n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> st[i] >> fn[i];
		T[st[i]] = i;
		T[fn[i]] = -i;
		add(1, st[i], fn[i], 0, Maxn);
		add2(1, fn[i], st[i], 0, Maxn);
	}
	ll ans = 1;
	for(int i = 1; i <= n; i++)
		if(!mk[i]){
			DFS(i, 1);
			ans = (ans + ans) % Mod;
		}
	
	for(int i = 1; i <= n + n; i++){
		//cerr << T[i] << ' ' << mk[abs(T[i])] << '\n';
		if(T[i] > 0){
			if(mk[T[i]] == 1) A.push(T[i]);
			else B.push(T[i]);
		} else {
			if(mk[-T[i]] == 1){
				if(A.empty() || A.top() != -T[i]) return cout << 0, 0;
				else A.pop();
			} else {
				if(B.empty() || B.top() != -T[i]) return cout << 0, 0;
				else B.pop();
			}
		}
	}
	cout << ans << '\n';	
	
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 62968 KB Output is correct
2 Correct 55 ms 62968 KB Output is correct
3 Correct 55 ms 62968 KB Output is correct
4 Correct 55 ms 62972 KB Output is correct
5 Correct 54 ms 62968 KB Output is correct
6 Correct 55 ms 63096 KB Output is correct
7 Correct 55 ms 62968 KB Output is correct
8 Correct 57 ms 62968 KB Output is correct
9 Correct 60 ms 62968 KB Output is correct
10 Correct 60 ms 63024 KB Output is correct
11 Correct 60 ms 63048 KB Output is correct
12 Correct 61 ms 62968 KB Output is correct
13 Correct 57 ms 63120 KB Output is correct
14 Correct 60 ms 62968 KB Output is correct
15 Correct 58 ms 62968 KB Output is correct
16 Correct 55 ms 62968 KB Output is correct
17 Correct 57 ms 63000 KB Output is correct
18 Correct 59 ms 62968 KB Output is correct
19 Correct 60 ms 63016 KB Output is correct
20 Correct 60 ms 62976 KB Output is correct
21 Correct 60 ms 62940 KB Output is correct
22 Correct 60 ms 62968 KB Output is correct
23 Correct 60 ms 62968 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 62968 KB Output is correct
2 Correct 55 ms 62968 KB Output is correct
3 Correct 55 ms 62968 KB Output is correct
4 Correct 55 ms 62972 KB Output is correct
5 Correct 54 ms 62968 KB Output is correct
6 Correct 55 ms 63096 KB Output is correct
7 Correct 55 ms 62968 KB Output is correct
8 Correct 57 ms 62968 KB Output is correct
9 Correct 60 ms 62968 KB Output is correct
10 Correct 60 ms 63024 KB Output is correct
11 Correct 60 ms 63048 KB Output is correct
12 Correct 61 ms 62968 KB Output is correct
13 Correct 57 ms 63120 KB Output is correct
14 Correct 60 ms 62968 KB Output is correct
15 Correct 58 ms 62968 KB Output is correct
16 Correct 55 ms 62968 KB Output is correct
17 Correct 57 ms 63000 KB Output is correct
18 Correct 59 ms 62968 KB Output is correct
19 Correct 60 ms 63016 KB Output is correct
20 Correct 60 ms 62976 KB Output is correct
21 Correct 60 ms 62940 KB Output is correct
22 Correct 60 ms 62968 KB Output is correct
23 Correct 60 ms 62968 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct
25 Correct 63 ms 63100 KB Output is correct
26 Correct 64 ms 63116 KB Output is correct
27 Correct 59 ms 63068 KB Output is correct
28 Correct 60 ms 63096 KB Output is correct
29 Correct 64 ms 63224 KB Output is correct
30 Correct 60 ms 63096 KB Output is correct
31 Correct 59 ms 63224 KB Output is correct
32 Correct 60 ms 63096 KB Output is correct
33 Correct 62 ms 63084 KB Output is correct
34 Correct 60 ms 63096 KB Output is correct
35 Correct 60 ms 63168 KB Output is correct
36 Correct 59 ms 63096 KB Output is correct
37 Correct 60 ms 63224 KB Output is correct
38 Correct 61 ms 63196 KB Output is correct
39 Correct 63 ms 63048 KB Output is correct
40 Correct 59 ms 62976 KB Output is correct
41 Correct 59 ms 63088 KB Output is correct
42 Correct 60 ms 63140 KB Output is correct
43 Correct 60 ms 63096 KB Output is correct
44 Correct 59 ms 63352 KB Output is correct

Subtask #3
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 62968 KB Output is correct
2 Correct 55 ms 62968 KB Output is correct
3 Correct 55 ms 62968 KB Output is correct
4 Correct 55 ms 62972 KB Output is correct
5 Correct 54 ms 62968 KB Output is correct
6 Correct 55 ms 63096 KB Output is correct
7 Correct 55 ms 62968 KB Output is correct
8 Correct 57 ms 62968 KB Output is correct
9 Correct 60 ms 62968 KB Output is correct
10 Correct 60 ms 63024 KB Output is correct
11 Correct 60 ms 63048 KB Output is correct
12 Correct 61 ms 62968 KB Output is correct
13 Correct 57 ms 63120 KB Output is correct
14 Correct 60 ms 62968 KB Output is correct
15 Correct 58 ms 62968 KB Output is correct
16 Correct 55 ms 62968 KB Output is correct
17 Correct 57 ms 63000 KB Output is correct
18 Correct 59 ms 62968 KB Output is correct
19 Correct 60 ms 63016 KB Output is correct
20 Correct 60 ms 62976 KB Output is correct
21 Correct 60 ms 62940 KB Output is correct
22 Correct 60 ms 62968 KB Output is correct
23 Correct 60 ms 62968 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct
25 Correct 63 ms 63100 KB Output is correct
26 Correct 64 ms 63116 KB Output is correct
27 Correct 59 ms 63068 KB Output is correct
28 Correct 60 ms 63096 KB Output is correct
29 Correct 64 ms 63224 KB Output is correct
30 Correct 60 ms 63096 KB Output is correct
31 Correct 59 ms 63224 KB Output is correct
32 Correct 60 ms 63096 KB Output is correct
33 Correct 62 ms 63084 KB Output is correct
34 Correct 60 ms 63096 KB Output is correct
35 Correct 60 ms 63168 KB Output is correct
36 Correct 59 ms 63096 KB Output is correct
37 Correct 60 ms 63224 KB Output is correct
38 Correct 61 ms 63196 KB Output is correct
39 Correct 63 ms 63048 KB Output is correct
40 Correct 59 ms 62976 KB Output is correct
41 Correct 59 ms 63088 KB Output is correct
42 Correct 60 ms 63140 KB Output is correct
43 Correct 60 ms 63096 KB Output is correct
44 Correct 59 ms 63352 KB Output is correct
45 Correct 327 ms 67064 KB Output is correct
46 Correct 328 ms 67576 KB Output is correct
47 Correct 322 ms 66884 KB Output is correct
48 Correct 331 ms 67756 KB Output is correct
49 Correct 321 ms 66936 KB Output is correct
50 Correct 322 ms 67320 KB Output is correct
51 Correct 331 ms 67320 KB Output is correct
52 Correct 298 ms 66496 KB Output is correct
53 Correct 319 ms 67064 KB Output is correct
54 Correct 326 ms 70260 KB Output is correct
55 Correct 315 ms 68312 KB Output is correct
56 Correct 338 ms 68312 KB Output is correct
57 Correct 296 ms 66296 KB Output is correct
58 Correct 289 ms 66296 KB Output is correct
59 Correct 309 ms 66636 KB Output is correct
60 Correct 401 ms 66672 KB Output is correct
61 Correct 331 ms 66520 KB Output is correct
62 Correct 306 ms 66628 KB Output is correct
63 Correct 323 ms 66456 KB Output is correct
64 Correct 314 ms 66396 KB Output is correct
65 Correct 370 ms 69772 KB Output is correct
66 Correct 381 ms 69880 KB Output is correct
67 Correct 331 ms 68216 KB Output is correct
68 Correct 340 ms 68428 KB Output is correct
69 Correct 356 ms 68324 KB Output is correct
70 Correct 342 ms 68216 KB Output is correct
71 Correct 328 ms 70208 KB Output is correct
72 Correct 326 ms 70136 KB Output is correct
73 Correct 322 ms 69112 KB Output is correct
74 Correct 336 ms 69356 KB Output is correct
75 Correct 420 ms 68092 KB Output is correct
76 Correct 303 ms 69524 KB Output is correct
77 Correct 292 ms 69368 KB Output is correct
78 Correct 324 ms 67576 KB Output is correct
79 Correct 322 ms 67064 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 62968 KB Output is correct
2 Correct 55 ms 62968 KB Output is correct
3 Correct 55 ms 62968 KB Output is correct
4 Correct 55 ms 62972 KB Output is correct
5 Correct 54 ms 62968 KB Output is correct
6 Correct 55 ms 63096 KB Output is correct
7 Correct 55 ms 62968 KB Output is correct
8 Correct 57 ms 62968 KB Output is correct
9 Correct 60 ms 62968 KB Output is correct
10 Correct 60 ms 63024 KB Output is correct
11 Correct 60 ms 63048 KB Output is correct
12 Correct 61 ms 62968 KB Output is correct
13 Correct 57 ms 63120 KB Output is correct
14 Correct 60 ms 62968 KB Output is correct
15 Correct 58 ms 62968 KB Output is correct
16 Correct 55 ms 62968 KB Output is correct
17 Correct 57 ms 63000 KB Output is correct
18 Correct 59 ms 62968 KB Output is correct
19 Correct 60 ms 63016 KB Output is correct
20 Correct 60 ms 62976 KB Output is correct
21 Correct 60 ms 62940 KB Output is correct
22 Correct 60 ms 62968 KB Output is correct
23 Correct 60 ms 62968 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct
25 Correct 63 ms 63100 KB Output is correct
26 Correct 64 ms 63116 KB Output is correct
27 Correct 59 ms 63068 KB Output is correct
28 Correct 60 ms 63096 KB Output is correct
29 Correct 64 ms 63224 KB Output is correct
30 Correct 60 ms 63096 KB Output is correct
31 Correct 59 ms 63224 KB Output is correct
32 Correct 60 ms 63096 KB Output is correct
33 Correct 62 ms 63084 KB Output is correct
34 Correct 60 ms 63096 KB Output is correct
35 Correct 60 ms 63168 KB Output is correct
36 Correct 59 ms 63096 KB Output is correct
37 Correct 60 ms 63224 KB Output is correct
38 Correct 61 ms 63196 KB Output is correct
39 Correct 63 ms 63048 KB Output is correct
40 Correct 59 ms 62976 KB Output is correct
41 Correct 59 ms 63088 KB Output is correct
42 Correct 60 ms 63140 KB Output is correct
43 Correct 60 ms 63096 KB Output is correct
44 Correct 59 ms 63352 KB Output is correct
45 Correct 327 ms 67064 KB Output is correct
46 Correct 328 ms 67576 KB Output is correct
47 Correct 322 ms 66884 KB Output is correct
48 Correct 331 ms 67756 KB Output is correct
49 Correct 321 ms 66936 KB Output is correct
50 Correct 322 ms 67320 KB Output is correct
51 Correct 331 ms 67320 KB Output is correct
52 Correct 298 ms 66496 KB Output is correct
53 Correct 319 ms 67064 KB Output is correct
54 Correct 326 ms 70260 KB Output is correct
55 Correct 315 ms 68312 KB Output is correct
56 Correct 338 ms 68312 KB Output is correct
57 Correct 296 ms 66296 KB Output is correct
58 Correct 289 ms 66296 KB Output is correct
59 Correct 309 ms 66636 KB Output is correct
60 Correct 401 ms 66672 KB Output is correct
61 Correct 331 ms 66520 KB Output is correct
62 Correct 306 ms 66628 KB Output is correct
63 Correct 323 ms 66456 KB Output is correct
64 Correct 314 ms 66396 KB Output is correct
65 Correct 370 ms 69772 KB Output is correct
66 Correct 381 ms 69880 KB Output is correct
67 Correct 331 ms 68216 KB Output is correct
68 Correct 340 ms 68428 KB Output is correct
69 Correct 356 ms 68324 KB Output is correct
70 Correct 342 ms 68216 KB Output is correct
71 Correct 328 ms 70208 KB Output is correct
72 Correct 326 ms 70136 KB Output is correct
73 Correct 322 ms 69112 KB Output is correct
74 Correct 336 ms 69356 KB Output is correct
75 Correct 420 ms 68092 KB Output is correct
76 Correct 303 ms 69524 KB Output is correct
77 Correct 292 ms 69368 KB Output is correct
78 Correct 324 ms 67576 KB Output is correct
79 Correct 322 ms 67064 KB Output is correct
80 Correct 3409 ms 103300 KB Output is correct
81 Correct 3446 ms 102904 KB Output is correct
82 Correct 3414 ms 101692 KB Output is correct
83 Correct 3423 ms 102956 KB Output is correct
84 Correct 3523 ms 103288 KB Output is correct
85 Correct 3379 ms 102044 KB Output is correct
86 Correct 3313 ms 102268 KB Output is correct
87 Correct 2943 ms 97324 KB Output is correct
88 Correct 3549 ms 105488 KB Output is correct
89 Correct 3431 ms 136732 KB Output is correct
90 Correct 3485 ms 116968 KB Output is correct
91 Correct 3393 ms 117068 KB Output is correct
92 Correct 3097 ms 97220 KB Output is correct
93 Correct 2980 ms 97332 KB Output is correct
94 Correct 3556 ms 100060 KB Output is correct
95 Correct 3514 ms 99936 KB Output is correct
96 Correct 3314 ms 100060 KB Output is correct
97 Correct 3415 ms 99924 KB Output is correct
98 Correct 3307 ms 99448 KB Output is correct
99 Correct 3352 ms 100084 KB Output is correct
100 Correct 4506 ms 132764 KB Output is correct
101 Correct 4637 ms 132668 KB Output is correct
102 Correct 3515 ms 117088 KB Output is correct
103 Correct 3515 ms 117168 KB Output is correct
104 Correct 3461 ms 116696 KB Output is correct
105 Correct 3498 ms 116784 KB Output is correct
106 Correct 3593 ms 136952 KB Output is correct
107 Correct 3492 ms 136760 KB Output is correct
108 Correct 3449 ms 126460 KB Output is correct
109 Correct 3564 ms 126236 KB Output is correct
110 Correct 3124 ms 127976 KB Output is correct
111 Correct 3075 ms 128448 KB Output is correct
112 Correct 3065 ms 128716 KB Output is correct
113 Correct 3402 ms 101752 KB Output is correct
114 Correct 3431 ms 102880 KB Output is correct