oj.uz

Submission #825029

# Submission time Handle Problem Language Result Execution time Memory
825029 2023-08-14T13:44:11 Z MohamedAhmed04 Port Facility (JOI17_port_facility) C++14
100 / 100
 2471 ms 156156 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 ;
	update(node << 1 , l , mid , idx , val , t) ;
	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< pair<int , int> , pair<int , int> >query(int node , int l , int r , int from , int to)
{
	if(from > r || to < l || from > to)
		return {{-1e9 , -1e9} , {1e9 , 1e9}} ;
	if(l >= from && r <= to)
		return {tree[0][node] , tree[1][node]} ;
	int mid = (l + r) >> 1 ;
	pair< pair<int , int> , pair<int , int> >a = query(node << 1 , l , mid , from , to) ;
	pair< pair<int , int> , pair<int , int> >b = query(node << 1 | 1 , mid+1 , r , from , to) ;
	return {max(a.first , b.first) , min(a.second , b.second)} ;
}

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

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

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 ;
		bfs(i) ;
		ans = Mul(ans , 2) ;
	}
	if((!check(0)) || (!check(1)))
		ans = 0 ;
	return cout<<ans<<"\n" , 0 ;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 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 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 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 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 712 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 3 ms 716 KB Output is correct
32 Correct 2 ms 708 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 580 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 2 ms 716 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 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 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 712 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 3 ms 716 KB Output is correct
32 Correct 2 ms 708 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 580 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 2 ms 716 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 132 ms 16140 KB Output is correct
46 Correct 132 ms 16224 KB Output is correct
47 Correct 136 ms 16256 KB Output is correct
48 Correct 137 ms 16308 KB Output is correct
49 Correct 131 ms 16168 KB Output is correct
50 Correct 112 ms 13892 KB Output is correct
51 Correct 112 ms 14376 KB Output is correct
52 Correct 114 ms 17724 KB Output is correct
53 Correct 144 ms 17688 KB Output is correct
54 Correct 107 ms 14112 KB Output is correct
55 Correct 122 ms 13908 KB Output is correct
56 Correct 112 ms 13896 KB Output is correct
57 Correct 130 ms 15748 KB Output is correct
58 Correct 111 ms 17640 KB Output is correct
59 Correct 127 ms 17648 KB Output is correct
60 Correct 160 ms 16720 KB Output is correct
61 Correct 133 ms 16408 KB Output is correct
62 Correct 104 ms 13932 KB Output is correct
63 Correct 131 ms 14164 KB Output is correct
64 Correct 118 ms 14076 KB Output is correct
65 Correct 135 ms 13944 KB Output is correct
66 Correct 146 ms 14300 KB Output is correct
67 Correct 146 ms 15704 KB Output is correct
68 Correct 128 ms 15800 KB Output is correct
69 Correct 121 ms 16572 KB Output is correct
70 Correct 124 ms 16532 KB Output is correct
71 Correct 120 ms 15812 KB Output is correct
72 Correct 117 ms 15776 KB Output is correct
73 Correct 124 ms 16504 KB Output is correct
74 Correct 119 ms 16552 KB Output is correct
75 Correct 120 ms 15708 KB Output is correct
76 Correct 111 ms 15788 KB Output is correct
77 Correct 107 ms 15752 KB Output is correct
78 Correct 140 ms 16248 KB Output is correct
79 Correct 134 ms 16140 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 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 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 712 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 3 ms 716 KB Output is correct
32 Correct 2 ms 708 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 580 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 2 ms 716 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 132 ms 16140 KB Output is correct
46 Correct 132 ms 16224 KB Output is correct
47 Correct 136 ms 16256 KB Output is correct
48 Correct 137 ms 16308 KB Output is correct
49 Correct 131 ms 16168 KB Output is correct
50 Correct 112 ms 13892 KB Output is correct
51 Correct 112 ms 14376 KB Output is correct
52 Correct 114 ms 17724 KB Output is correct
53 Correct 144 ms 17688 KB Output is correct
54 Correct 107 ms 14112 KB Output is correct
55 Correct 122 ms 13908 KB Output is correct
56 Correct 112 ms 13896 KB Output is correct
57 Correct 130 ms 15748 KB Output is correct
58 Correct 111 ms 17640 KB Output is correct
59 Correct 127 ms 17648 KB Output is correct
60 Correct 160 ms 16720 KB Output is correct
61 Correct 133 ms 16408 KB Output is correct
62 Correct 104 ms 13932 KB Output is correct
63 Correct 131 ms 14164 KB Output is correct
64 Correct 118 ms 14076 KB Output is correct
65 Correct 135 ms 13944 KB Output is correct
66 Correct 146 ms 14300 KB Output is correct
67 Correct 146 ms 15704 KB Output is correct
68 Correct 128 ms 15800 KB Output is correct
69 Correct 121 ms 16572 KB Output is correct
70 Correct 124 ms 16532 KB Output is correct
71 Correct 120 ms 15812 KB Output is correct
72 Correct 117 ms 15776 KB Output is correct
73 Correct 124 ms 16504 KB Output is correct
74 Correct 119 ms 16552 KB Output is correct
75 Correct 120 ms 15708 KB Output is correct
76 Correct 111 ms 15788 KB Output is correct
77 Correct 107 ms 15752 KB Output is correct
78 Correct 140 ms 16248 KB Output is correct
79 Correct 134 ms 16140 KB Output is correct
80 Correct 1841 ms 141160 KB Output is correct
81 Correct 1868 ms 141140 KB Output is correct
82 Correct 1802 ms 141144 KB Output is correct
83 Correct 1933 ms 141196 KB Output is correct
84 Correct 1810 ms 141196 KB Output is correct
85 Correct 1667 ms 122668 KB Output is correct
86 Correct 1707 ms 125972 KB Output is correct
87 Correct 1526 ms 156156 KB Output is correct
88 Correct 2173 ms 156068 KB Output is correct
89 Correct 1649 ms 117696 KB Output is correct
90 Correct 1762 ms 115608 KB Output is correct
91 Correct 1699 ms 115648 KB Output is correct
92 Correct 1764 ms 136500 KB Output is correct
93 Correct 1737 ms 156144 KB Output is correct
94 Correct 2070 ms 151840 KB Output is correct
95 Correct 2128 ms 143628 KB Output is correct
96 Correct 2083 ms 141388 KB Output is correct
97 Correct 1723 ms 123868 KB Output is correct
98 Correct 1833 ms 125204 KB Output is correct
99 Correct 2031 ms 116836 KB Output is correct
100 Correct 2405 ms 119616 KB Output is correct
101 Correct 2471 ms 123940 KB Output is correct
102 Correct 1920 ms 136648 KB Output is correct
103 Correct 1926 ms 136644 KB Output is correct
104 Correct 1771 ms 144432 KB Output is correct
105 Correct 1899 ms 144404 KB Output is correct
106 Correct 2175 ms 136656 KB Output is correct
107 Correct 1811 ms 136660 KB Output is correct
108 Correct 2428 ms 144408 KB Output is correct
109 Correct 2358 ms 144424 KB Output is correct
110 Correct 1687 ms 136500 KB Output is correct
111 Correct 1741 ms 136516 KB Output is correct
112 Correct 1754 ms 136528 KB Output is correct
113 Correct 2008 ms 141136 KB Output is correct
114 Correct 1945 ms 141208 KB Output is correct