oj.uz

답안 #825020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
825020 2023-08-14T13:31:35 Z MohamedAhmed04 Port Facility (JOI17_port_facility) C++14
100 / 100
 3370 ms 226448 KB 
#include <bits/stdc++.h>

using namespace std ;

const int mod = 1e9 + 7 ;

int Add(int x , int y)
{
	int z = x + y ;
	if(z >= mod)
		z -= mod ;
	return z ;
}

int Sub(int x , int y)
{
	int z = x - y ;
	if(z < 0)
		z += mod ;
	return z ;
}

int Mul(int x , int y)
{
	return (1ll * x * y) % mod ;
}

int powlog(int base , int power)
{
	if(power == 0)
		return 1 ;
	int x = powlog(base , power / 2) ;
	if(power & 1)
		x = Mul(x , base) ;
	return x ;
}

const int MAX = 2e6 + 10 ;

int arr[MAX] ;
int n ;

int L[MAX] , R[MAX] ;
int to[MAX] , back[MAX] ;
int id[MAX] ;

pair<int , int>tree[2][4 * MAX] ;

void build(int node , int l , int r)
{
	if(l == r)
	{
		tree[0][node].first = to[l] ;
		tree[1][node].first = back[l] ;
		tree[0][node].second = tree[1][node].second = id[l] ;
		return ;
	}
	int mid = (l + r) >> 1 ;
	build(node << 1 , l , mid) ;
	build(node << 1 | 1 , mid+1 , r) ;
	tree[0][node] = max(tree[0][node << 1] , tree[0][node << 1 | 1]) ;
	tree[1][node] = min(tree[1][node << 1] , tree[1][node << 1 | 1]) ;
}

void update(int node , int l , int r , int idx , int val , bool t)
{
	if(idx > r || idx < l)
		return ;
	if(l == r)
	{
		tree[t][node].first = val ;
		return ;
	}
	int mid = (l + r) >> 1 ;
	if(idx <= mid)
		update(node << 1 , l , mid , idx , val , t) ;
	else
		update(node << 1 | 1 , mid+1 , r , idx , val , t) ;
	tree[0][node] = max(tree[0][node << 1] , tree[0][node << 1 | 1]) ;
	tree[1][node] = min(tree[1][node << 1] , tree[1][node << 1 | 1]) ;
}

pair<int , int>query(int node , int l , int r , int from , int to , bool t)
{
	if(from > r || to < l || from > to)
	{
		if(!t)
			return {-1e9 , -1e9} ;
		else
			return {1e9 , 1e9} ;
	}
	if(l >= from && r <= to)
		return tree[t][node] ;
	int mid = (l + r) >> 1 ;
	pair<int , int>a = query(node << 1 , l , mid , from , to , t) ;
	pair<int , int>b = query(node << 1 | 1 , mid+1 , r , from , to , t) ;
	if(!t)
		return max(a , b) ;
	else
		return min(a , b) ;
}

int vis[MAX] ;
vector< pair<int , int> >vp[2] ;

void dfs(int node , int col)
{
	vis[node] = 1 ;
	vp[col].emplace_back(L[node] , R[node]) ;
	update(1 , 1 , 2*n , L[node] , -1e9 , 0) ;
	update(1 , 1 , 2*n , R[node] , 1e9 , 1) ;
	bool ok = false ;
	while(!ok)
	{
		ok = true ;
		pair<int , int>p = query(1 , 1 , 2*n , L[node] , R[node] , 0) ;
		if(p.first > R[node])
			dfs(p.second , !col) , ok = false ;
		p = query(1 , 1 , 2*n , L[node] , R[node] , 1) ;
		if(p.first < L[node])
			dfs(p.second , !col) , ok = false ;
	}
}

bool check(bool t)
{
	sort(vp[t].begin() , vp[t].end()) ;
	set<int>s ;
	for(auto &p : vp[t])
	{
		auto it = s.lower_bound(p.second) ;
		if(it != s.begin())
		{
			it-- ;
			int x = *it ;
			if(p.first < x)
				return false ;
		}
		s.insert(p.second) ;
	}
	return true ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 1 ; i <= 2*n ; ++i)
		to[i] = -1e9 , back[i] = 1e9 ;
	for(int i = 1 ; i <= n ; ++i)
	{
		cin>>L[i]>>R[i] ;
		to[L[i]] = R[i] , back[R[i]] = L[i] ;
		id[L[i]] = id[R[i]] = i ;
	}
	build(1 , 1 , 2*n) ;
	int ans = 1 ;
	for(int i = 1 ; i <= n ; ++i)
	{
		if(vis[i])
			continue ;
		dfs(i , 0) ;
		ans = Mul(ans , 2) ;
	}
	if((!check(0)) || (!check(1)))
		ans = 0 ;
	return cout<<ans<<"\n" , 0 ;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 3 ms 712 KB Output is correct
27 Correct 3 ms 672 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 3 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 3 ms 852 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 2 ms 724 KB Output is correct
44 Correct 3 ms 724 KB Output is correct

Subtask #3
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 3 ms 712 KB Output is correct
27 Correct 3 ms 672 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 3 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 3 ms 852 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 2 ms 724 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 195 ms 16996 KB Output is correct
46 Correct 193 ms 18200 KB Output is correct
47 Correct 173 ms 16104 KB Output is correct
48 Correct 181 ms 18228 KB Output is correct
49 Correct 176 ms 16328 KB Output is correct
50 Correct 159 ms 15740 KB Output is correct
51 Correct 158 ms 16080 KB Output is correct
52 Correct 125 ms 17536 KB Output is correct
53 Correct 173 ms 17512 KB Output is correct
54 Correct 175 ms 22504 KB Output is correct
55 Correct 182 ms 17992 KB Output is correct
56 Correct 167 ms 17736 KB Output is correct
57 Correct 171 ms 15224 KB Output is correct
58 Correct 123 ms 17472 KB Output is correct
59 Correct 164 ms 17320 KB Output is correct
60 Correct 177 ms 16260 KB Output is correct
61 Correct 198 ms 15808 KB Output is correct
62 Correct 136 ms 13432 KB Output is correct
63 Correct 149 ms 13572 KB Output is correct
64 Correct 152 ms 13024 KB Output is correct
65 Correct 220 ms 22388 KB Output is correct
66 Correct 228 ms 22568 KB Output is correct
67 Correct 188 ms 19916 KB Output is correct
68 Correct 212 ms 19856 KB Output is correct
69 Correct 189 ms 20192 KB Output is correct
70 Correct 191 ms 20168 KB Output is correct
71 Correct 200 ms 24592 KB Output is correct
72 Correct 193 ms 24572 KB Output is correct
73 Correct 197 ms 22256 KB Output is correct
74 Correct 193 ms 22232 KB Output is correct
75 Correct 140 ms 20816 KB Output is correct
76 Correct 137 ms 24548 KB Output is correct
77 Correct 127 ms 22644 KB Output is correct
78 Correct 176 ms 17920 KB Output is correct
79 Correct 174 ms 17128 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 3 ms 712 KB Output is correct
27 Correct 3 ms 672 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 596 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 3 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 3 ms 852 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 2 ms 724 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 195 ms 16996 KB Output is correct
46 Correct 193 ms 18200 KB Output is correct
47 Correct 173 ms 16104 KB Output is correct
48 Correct 181 ms 18228 KB Output is correct
49 Correct 176 ms 16328 KB Output is correct
50 Correct 159 ms 15740 KB Output is correct
51 Correct 158 ms 16080 KB Output is correct
52 Correct 125 ms 17536 KB Output is correct
53 Correct 173 ms 17512 KB Output is correct
54 Correct 175 ms 22504 KB Output is correct
55 Correct 182 ms 17992 KB Output is correct
56 Correct 167 ms 17736 KB Output is correct
57 Correct 171 ms 15224 KB Output is correct
58 Correct 123 ms 17472 KB Output is correct
59 Correct 164 ms 17320 KB Output is correct
60 Correct 177 ms 16260 KB Output is correct
61 Correct 198 ms 15808 KB Output is correct
62 Correct 136 ms 13432 KB Output is correct
63 Correct 149 ms 13572 KB Output is correct
64 Correct 152 ms 13024 KB Output is correct
65 Correct 220 ms 22388 KB Output is correct
66 Correct 228 ms 22568 KB Output is correct
67 Correct 188 ms 19916 KB Output is correct
68 Correct 212 ms 19856 KB Output is correct
69 Correct 189 ms 20192 KB Output is correct
70 Correct 191 ms 20168 KB Output is correct
71 Correct 200 ms 24592 KB Output is correct
72 Correct 193 ms 24572 KB Output is correct
73 Correct 197 ms 22256 KB Output is correct
74 Correct 193 ms 22232 KB Output is correct
75 Correct 140 ms 20816 KB Output is correct
76 Correct 137 ms 24548 KB Output is correct
77 Correct 127 ms 22644 KB Output is correct
78 Correct 176 ms 17920 KB Output is correct
79 Correct 174 ms 17128 KB Output is correct
80 Correct 2245 ms 143052 KB Output is correct
81 Correct 2235 ms 141912 KB Output is correct
82 Correct 2246 ms 137984 KB Output is correct
83 Correct 2151 ms 141888 KB Output is correct
84 Correct 2217 ms 143000 KB Output is correct
85 Correct 2037 ms 120132 KB Output is correct
86 Correct 2032 ms 126864 KB Output is correct
87 Correct 1872 ms 155916 KB Output is correct
88 Correct 2428 ms 156024 KB Output is correct
89 Correct 2238 ms 203152 KB Output is correct
90 Correct 2114 ms 156168 KB Output is correct
91 Correct 2254 ms 156236 KB Output is correct
92 Correct 1803 ms 132560 KB Output is correct
93 Correct 1764 ms 156088 KB Output is correct
94 Correct 2101 ms 147804 KB Output is correct
95 Correct 2117 ms 139636 KB Output is correct
96 Correct 2212 ms 137500 KB Output is correct
97 Correct 1940 ms 132892 KB Output is correct
98 Correct 1980 ms 127036 KB Output is correct
99 Correct 1941 ms 112928 KB Output is correct
100 Correct 3370 ms 203164 KB Output is correct
101 Correct 3324 ms 203144 KB Output is correct
102 Correct 2586 ms 179560 KB Output is correct
103 Correct 2648 ms 179412 KB Output is correct
104 Correct 2753 ms 182148 KB Output is correct
105 Correct 2597 ms 182100 KB Output is correct
106 Correct 2723 ms 226396 KB Output is correct
107 Correct 2813 ms 226392 KB Output is correct
108 Correct 2681 ms 202956 KB Output is correct
109 Correct 2676 ms 202992 KB Output is correct
110 Correct 2109 ms 224496 KB Output is correct
111 Correct 1948 ms 226448 KB Output is correct
112 Correct 1713 ms 208856 KB Output is correct
113 Correct 2365 ms 137992 KB Output is correct
114 Correct 2424 ms 141712 KB Output is correct