oj.uz

답안 #411090

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
411090 2021-05-24T10:15:56 Z alishahali1382 Port Facility (JOI17_port_facility) C++14
100 / 100
 1309 ms 69452 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=1000010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN], B[MAXN];
int L[MAXN], R[MAXN];
int par[MAXN], parx[MAXN];
int seg[MAXN<<3];
bool sz[MAXN<<3];

pii getpar(int x){
	if (par[x]==x) return {x, 0};
	pii p=getpar(par[x]);
	par[x]=p.first;
	parx[x]^=p.second;
	return {par[x], parx[x]};
}
int join(int x, int y, int w){
	pii xx=getpar(x);
	pii yy=getpar(y);
	if (xx.first!=yy.first){
		par[xx.first]=yy.first;
		parx[xx.first]=xx.second^yy.second^w;
		ans--;
		return 1;
	}
	if (xx.second^yy.second^w){
		cout<<"0\n";
		exit(0);
	}
	return 0;
}
void Set(int id, int tl, int tr, int pos, int x){
	if (pos<tl || tr<=pos) return ;
	sz[id]=1;
	if (tr-tl==1){
		seg[id]=x;
		return ;
	}
	int mid=(tl+tr)>>1;
	Set(id<<1, tl, mid, pos, x);
	Set(id<<1 | 1, mid, tr, pos, x);
	seg[id]=0;
	if (!sz[id<<1] || !sz[id<<1 | 1]) seg[id]=seg[id<<1]+seg[id<<1 | 1];
}
void Merge(int id, int tl, int tr, int l, int r, int x){
	if (r<=tl || tr<=l || !sz[id]) return ;
	if (l<=tl && tr<=r){
		if (seg[id]) join(x, seg[id], 1);
		else{
			int mid=(tl+tr)>>1;
			Merge(id<<1, tl, mid, l, r, x);
			Merge(id<<1 | 1, mid, tr, l, r, x);
			seg[id]=max(seg[id<<1], seg[id<<1 | 1]);
		}
		return ;
	}
	int mid=(tl+tr)>>1;
	Merge(id<<1, tl, mid, l, r, x);
	Merge(id<<1 | 1, mid, tr, l, r, x);
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=n; i++){
		cin>>L[i]>>R[i];
		B[L[i]]=i;
		B[R[i]]=-i;
		par[i]=i;
	}
	ans=n;
	for (int i=1; i<=2*n; i++) if (B[i]>0){
		int x=B[i];
		Set(1, 1, 2*n+1, R[x], x);
		Merge(1, 1, 2*n+1, L[x], R[x], x);
	}	
	
	ll res=1;
	while (ans--) res=res*2%mod;
	cout<<res<<"\n";
	
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 2 ms 464 KB Output is correct
41 Correct 2 ms 456 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 87 ms 5368 KB Output is correct
46 Correct 94 ms 5440 KB Output is correct
47 Correct 85 ms 5548 KB Output is correct
48 Correct 96 ms 5488 KB Output is correct
49 Correct 86 ms 5468 KB Output is correct
50 Correct 39 ms 3520 KB Output is correct
51 Correct 55 ms 4272 KB Output is correct
52 Correct 68 ms 5060 KB Output is correct
53 Correct 65 ms 3836 KB Output is correct
54 Correct 27 ms 2656 KB Output is correct
55 Correct 25 ms 2592 KB Output is correct
56 Correct 23 ms 2628 KB Output is correct
57 Correct 88 ms 5540 KB Output is correct
58 Correct 68 ms 5060 KB Output is correct
59 Correct 78 ms 5572 KB Output is correct
60 Correct 81 ms 5528 KB Output is correct
61 Correct 82 ms 5484 KB Output is correct
62 Correct 25 ms 3060 KB Output is correct
63 Correct 23 ms 2656 KB Output is correct
64 Correct 33 ms 3056 KB Output is correct
65 Correct 24 ms 2616 KB Output is correct
66 Correct 24 ms 2756 KB Output is correct
67 Correct 86 ms 6492 KB Output is correct
68 Correct 86 ms 6492 KB Output is correct
69 Correct 85 ms 6188 KB Output is correct
70 Correct 85 ms 6116 KB Output is correct
71 Correct 70 ms 5444 KB Output is correct
72 Correct 70 ms 4604 KB Output is correct
73 Correct 87 ms 4648 KB Output is correct
74 Correct 79 ms 5316 KB Output is correct
75 Correct 73 ms 5428 KB Output is correct
76 Correct 73 ms 5632 KB Output is correct
77 Correct 72 ms 5536 KB Output is correct
78 Correct 86 ms 5424 KB Output is correct
79 Correct 88 ms 5576 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 2 ms 464 KB Output is correct
41 Correct 2 ms 456 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 87 ms 5368 KB Output is correct
46 Correct 94 ms 5440 KB Output is correct
47 Correct 85 ms 5548 KB Output is correct
48 Correct 96 ms 5488 KB Output is correct
49 Correct 86 ms 5468 KB Output is correct
50 Correct 39 ms 3520 KB Output is correct
51 Correct 55 ms 4272 KB Output is correct
52 Correct 68 ms 5060 KB Output is correct
53 Correct 65 ms 3836 KB Output is correct
54 Correct 27 ms 2656 KB Output is correct
55 Correct 25 ms 2592 KB Output is correct
56 Correct 23 ms 2628 KB Output is correct
57 Correct 88 ms 5540 KB Output is correct
58 Correct 68 ms 5060 KB Output is correct
59 Correct 78 ms 5572 KB Output is correct
60 Correct 81 ms 5528 KB Output is correct
61 Correct 82 ms 5484 KB Output is correct
62 Correct 25 ms 3060 KB Output is correct
63 Correct 23 ms 2656 KB Output is correct
64 Correct 33 ms 3056 KB Output is correct
65 Correct 24 ms 2616 KB Output is correct
66 Correct 24 ms 2756 KB Output is correct
67 Correct 86 ms 6492 KB Output is correct
68 Correct 86 ms 6492 KB Output is correct
69 Correct 85 ms 6188 KB Output is correct
70 Correct 85 ms 6116 KB Output is correct
71 Correct 70 ms 5444 KB Output is correct
72 Correct 70 ms 4604 KB Output is correct
73 Correct 87 ms 4648 KB Output is correct
74 Correct 79 ms 5316 KB Output is correct
75 Correct 73 ms 5428 KB Output is correct
76 Correct 73 ms 5632 KB Output is correct
77 Correct 72 ms 5536 KB Output is correct
78 Correct 86 ms 5424 KB Output is correct
79 Correct 88 ms 5576 KB Output is correct
80 Correct 1244 ms 44708 KB Output is correct
81 Correct 1238 ms 44648 KB Output is correct
82 Correct 1230 ms 44484 KB Output is correct
83 Correct 1275 ms 44580 KB Output is correct
84 Correct 1212 ms 44784 KB Output is correct
85 Correct 647 ms 32916 KB Output is correct
86 Correct 795 ms 36404 KB Output is correct
87 Correct 921 ms 40680 KB Output is correct
88 Correct 877 ms 30436 KB Output is correct
89 Correct 296 ms 20284 KB Output is correct
90 Correct 324 ms 20248 KB Output is correct
91 Correct 309 ms 20224 KB Output is correct
92 Correct 988 ms 44492 KB Output is correct
93 Correct 940 ms 40628 KB Output is correct
94 Correct 1060 ms 44468 KB Output is correct
95 Correct 1156 ms 44656 KB Output is correct
96 Correct 1190 ms 44712 KB Output is correct
97 Correct 500 ms 32580 KB Output is correct
98 Correct 665 ms 36868 KB Output is correct
99 Correct 492 ms 28420 KB Output is correct
100 Correct 312 ms 20508 KB Output is correct
101 Correct 319 ms 20476 KB Output is correct
102 Correct 1216 ms 55192 KB Output is correct
103 Correct 1276 ms 69452 KB Output is correct
104 Correct 1287 ms 65992 KB Output is correct
105 Correct 1309 ms 66016 KB Output is correct
106 Correct 1115 ms 53052 KB Output is correct
107 Correct 1129 ms 59708 KB Output is correct
108 Correct 1148 ms 54724 KB Output is correct
109 Correct 1109 ms 56244 KB Output is correct
110 Correct 1111 ms 59060 KB Output is correct
111 Correct 1088 ms 58796 KB Output is correct
112 Correct 1111 ms 58860 KB Output is correct
113 Correct 1256 ms 59008 KB Output is correct
114 Correct 1294 ms 58984 KB Output is correct