oj.uz

Submission #249814

# Submission time Handle Problem Language Result Execution time Memory
249814 2020-07-15T20:35:56 Z Blagojce Port Facility (JOI17_port_facility) C++11
22 / 100
 6000 ms 898848 KB 
#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,ll> pii;

const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 4e6;
 
const ll A = 911382323;
const ll B = 972663749;
 
ll modpow(ll x, ll n){
	if(n == 0) return 1%mod;
	ll u = modpow(x, n/2);
	u = (u * u) % mod;
	if(n % 2) u = (u * x) % mod;
	return u;
}
ll inverse(ll x){
	return modpow(x, mod-2);
}
ll add(ll ans, ll val){
	ans = (ans + val) % mod;
	return ans;
}
ll mul(ll ans, ll val){
	ans = (ans * val) % mod;
	return ans;
}
ll sub(ll ans, ll val){
	ans = (ans - val) % mod;
	if(ans < 0) ans += mod;
	return ans;
}
ll _div(ll ans, ll val){
	ans = (ans * inverse(val)) % mod;
	return ans;
}
ll fakt[mxn];
ll bc(ll n, ll k){
	return (fakt[n]*inverse((fakt[k]*fakt[n-k])%mod))%mod;
}
ll sq(ll x){
	return x*x;
}
ll rsum(ll a, ll b){
	return (b-a+1)*(a+b)/2;
}
void prec(){
	fakt[0] = 1;
	fr(i, 1, mxn){
		fakt[i] = mul(fakt[i-1], i);
	}
}
int a[mxn], b[mxn];
vector<int> g[mxn];
int col[mxn];
void dfs(int u){
	for(auto e : g[u]){
		if(col[e] == -1){
			col[e] = col[u]^1;
			dfs(e);
		}
		else if(col[u] == col[e]){
			cout<<0<<endl;
			exit(0);
		}
	}
}


void solve(){
	int n;
	cin >> n;
	
	int val[2*n+1];
	memset(val, 0, sizeof(val));
	int id[2*n+1];
	fr(i, 0, n){
		cin >> a[i] >> b[i];
		val[a[i]] = +1;
		val[b[i]] = -1;
		id[a[i]] = id[b[i]] = i;
	}
	
	set<int> S;
	
	fr(i, 1, 2*n+1){
		if(val[i] == 0) continue;
		
		if(val[i] > 0){
			S.insert(-i);
		}
		else{
			int c = id[i];
			int l = a[c];
			S.erase(-l);
			for(auto u : S){
				if(-u > l){
					g[c].pb(id[-u]);
					g[id[-u]].pb(c);
				}
				else break;
			}
		}
	}	
	ll ans = 1;
	memset(col, -1, sizeof(col));
	fr(i, 0, n){
		if(col[i] != -1) continue;
		col[i] = 0;
		dfs(i);
		ans = mul(ans, 2);
	}
	
	cout<<ans<<endl;
}




int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	solve();
	return 0;
	
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 109952 KB Output is correct
2 Correct 59 ms 109944 KB Output is correct
3 Correct 61 ms 109944 KB Output is correct
4 Correct 60 ms 109944 KB Output is correct
5 Correct 59 ms 109944 KB Output is correct
6 Correct 59 ms 109944 KB Output is correct
7 Correct 67 ms 109944 KB Output is correct
8 Correct 58 ms 109944 KB Output is correct
9 Correct 58 ms 109944 KB Output is correct
10 Correct 59 ms 109944 KB Output is correct
11 Correct 73 ms 109944 KB Output is correct
12 Correct 59 ms 109948 KB Output is correct
13 Correct 59 ms 109944 KB Output is correct
14 Correct 60 ms 109944 KB Output is correct
15 Correct 61 ms 109944 KB Output is correct
16 Correct 59 ms 109944 KB Output is correct
17 Correct 58 ms 109948 KB Output is correct
18 Correct 59 ms 109944 KB Output is correct
19 Correct 59 ms 109944 KB Output is correct
20 Correct 59 ms 109944 KB Output is correct
21 Correct 59 ms 109944 KB Output is correct
22 Correct 59 ms 109944 KB Output is correct
23 Correct 60 ms 109944 KB Output is correct
24 Correct 63 ms 110072 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 109952 KB Output is correct
2 Correct 59 ms 109944 KB Output is correct
3 Correct 61 ms 109944 KB Output is correct
4 Correct 60 ms 109944 KB Output is correct
5 Correct 59 ms 109944 KB Output is correct
6 Correct 59 ms 109944 KB Output is correct
7 Correct 67 ms 109944 KB Output is correct
8 Correct 58 ms 109944 KB Output is correct
9 Correct 58 ms 109944 KB Output is correct
10 Correct 59 ms 109944 KB Output is correct
11 Correct 73 ms 109944 KB Output is correct
12 Correct 59 ms 109948 KB Output is correct
13 Correct 59 ms 109944 KB Output is correct
14 Correct 60 ms 109944 KB Output is correct
15 Correct 61 ms 109944 KB Output is correct
16 Correct 59 ms 109944 KB Output is correct
17 Correct 58 ms 109948 KB Output is correct
18 Correct 59 ms 109944 KB Output is correct
19 Correct 59 ms 109944 KB Output is correct
20 Correct 59 ms 109944 KB Output is correct
21 Correct 59 ms 109944 KB Output is correct
22 Correct 59 ms 109944 KB Output is correct
23 Correct 60 ms 109944 KB Output is correct
24 Correct 63 ms 110072 KB Output is correct
25 Correct 60 ms 110328 KB Output is correct
26 Correct 60 ms 110460 KB Output is correct
27 Correct 60 ms 110328 KB Output is correct
28 Correct 61 ms 110584 KB Output is correct
29 Correct 61 ms 110404 KB Output is correct
30 Correct 61 ms 110456 KB Output is correct
31 Correct 69 ms 110328 KB Output is correct
32 Correct 60 ms 110328 KB Output is correct
33 Correct 61 ms 110200 KB Output is correct
34 Correct 60 ms 110200 KB Output is correct
35 Correct 60 ms 109944 KB Output is correct
36 Correct 60 ms 110072 KB Output is correct
37 Correct 109 ms 126328 KB Output is correct
38 Correct 85 ms 118136 KB Output is correct
39 Correct 60 ms 110072 KB Output is correct
40 Correct 59 ms 109944 KB Output is correct
41 Correct 91 ms 118264 KB Output is correct
42 Correct 87 ms 118264 KB Output is correct
43 Correct 60 ms 110072 KB Output is correct
44 Correct 60 ms 110072 KB Output is correct

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 109952 KB Output is correct
2 Correct 59 ms 109944 KB Output is correct
3 Correct 61 ms 109944 KB Output is correct
4 Correct 60 ms 109944 KB Output is correct
5 Correct 59 ms 109944 KB Output is correct
6 Correct 59 ms 109944 KB Output is correct
7 Correct 67 ms 109944 KB Output is correct
8 Correct 58 ms 109944 KB Output is correct
9 Correct 58 ms 109944 KB Output is correct
10 Correct 59 ms 109944 KB Output is correct
11 Correct 73 ms 109944 KB Output is correct
12 Correct 59 ms 109948 KB Output is correct
13 Correct 59 ms 109944 KB Output is correct
14 Correct 60 ms 109944 KB Output is correct
15 Correct 61 ms 109944 KB Output is correct
16 Correct 59 ms 109944 KB Output is correct
17 Correct 58 ms 109948 KB Output is correct
18 Correct 59 ms 109944 KB Output is correct
19 Correct 59 ms 109944 KB Output is correct
20 Correct 59 ms 109944 KB Output is correct
21 Correct 59 ms 109944 KB Output is correct
22 Correct 59 ms 109944 KB Output is correct
23 Correct 60 ms 109944 KB Output is correct
24 Correct 63 ms 110072 KB Output is correct
25 Correct 60 ms 110328 KB Output is correct
26 Correct 60 ms 110460 KB Output is correct
27 Correct 60 ms 110328 KB Output is correct
28 Correct 61 ms 110584 KB Output is correct
29 Correct 61 ms 110404 KB Output is correct
30 Correct 61 ms 110456 KB Output is correct
31 Correct 69 ms 110328 KB Output is correct
32 Correct 60 ms 110328 KB Output is correct
33 Correct 61 ms 110200 KB Output is correct
34 Correct 60 ms 110200 KB Output is correct
35 Correct 60 ms 109944 KB Output is correct
36 Correct 60 ms 110072 KB Output is correct
37 Correct 109 ms 126328 KB Output is correct
38 Correct 85 ms 118136 KB Output is correct
39 Correct 60 ms 110072 KB Output is correct
40 Correct 59 ms 109944 KB Output is correct
41 Correct 91 ms 118264 KB Output is correct
42 Correct 87 ms 118264 KB Output is correct
43 Correct 60 ms 110072 KB Output is correct
44 Correct 60 ms 110072 KB Output is correct
45 Correct 249 ms 141304 KB Output is correct
46 Correct 401 ms 183160 KB Output is correct
47 Correct 185 ms 127992 KB Output is correct
48 Correct 399 ms 181128 KB Output is correct
49 Correct 219 ms 134904 KB Output is correct
50 Correct 373 ms 179964 KB Output is correct
51 Correct 240 ms 144888 KB Output is correct
52 Correct 98 ms 113656 KB Output is correct
53 Correct 115 ms 118264 KB Output is correct
54 Execution timed out 6123 ms 898848 KB Time limit exceeded
55 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 109952 KB Output is correct
2 Correct 59 ms 109944 KB Output is correct
3 Correct 61 ms 109944 KB Output is correct
4 Correct 60 ms 109944 KB Output is correct
5 Correct 59 ms 109944 KB Output is correct
6 Correct 59 ms 109944 KB Output is correct
7 Correct 67 ms 109944 KB Output is correct
8 Correct 58 ms 109944 KB Output is correct
9 Correct 58 ms 109944 KB Output is correct
10 Correct 59 ms 109944 KB Output is correct
11 Correct 73 ms 109944 KB Output is correct
12 Correct 59 ms 109948 KB Output is correct
13 Correct 59 ms 109944 KB Output is correct
14 Correct 60 ms 109944 KB Output is correct
15 Correct 61 ms 109944 KB Output is correct
16 Correct 59 ms 109944 KB Output is correct
17 Correct 58 ms 109948 KB Output is correct
18 Correct 59 ms 109944 KB Output is correct
19 Correct 59 ms 109944 KB Output is correct
20 Correct 59 ms 109944 KB Output is correct
21 Correct 59 ms 109944 KB Output is correct
22 Correct 59 ms 109944 KB Output is correct
23 Correct 60 ms 109944 KB Output is correct
24 Correct 63 ms 110072 KB Output is correct
25 Correct 60 ms 110328 KB Output is correct
26 Correct 60 ms 110460 KB Output is correct
27 Correct 60 ms 110328 KB Output is correct
28 Correct 61 ms 110584 KB Output is correct
29 Correct 61 ms 110404 KB Output is correct
30 Correct 61 ms 110456 KB Output is correct
31 Correct 69 ms 110328 KB Output is correct
32 Correct 60 ms 110328 KB Output is correct
33 Correct 61 ms 110200 KB Output is correct
34 Correct 60 ms 110200 KB Output is correct
35 Correct 60 ms 109944 KB Output is correct
36 Correct 60 ms 110072 KB Output is correct
37 Correct 109 ms 126328 KB Output is correct
38 Correct 85 ms 118136 KB Output is correct
39 Correct 60 ms 110072 KB Output is correct
40 Correct 59 ms 109944 KB Output is correct
41 Correct 91 ms 118264 KB Output is correct
42 Correct 87 ms 118264 KB Output is correct
43 Correct 60 ms 110072 KB Output is correct
44 Correct 60 ms 110072 KB Output is correct
45 Correct 249 ms 141304 KB Output is correct
46 Correct 401 ms 183160 KB Output is correct
47 Correct 185 ms 127992 KB Output is correct
48 Correct 399 ms 181128 KB Output is correct
49 Correct 219 ms 134904 KB Output is correct
50 Correct 373 ms 179964 KB Output is correct
51 Correct 240 ms 144888 KB Output is correct
52 Correct 98 ms 113656 KB Output is correct
53 Correct 115 ms 118264 KB Output is correct
54 Execution timed out 6123 ms 898848 KB Time limit exceeded
55 Halted 0 ms 0 KB -