oj.uz

Submission #892626

# Submission time Handle Problem Language Result Execution time Memory
892626 2023-12-25T15:35:29 Z ReLice Port Facility (JOI17_port_facility) C++14
10 / 100
 147 ms 290980 KB 
#include <bits/stdc++.h>
#define ll int
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define bc back()
//#define ar array
#define vll vector<ll> 
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;*/
template <class _T>
bool chmin(_T &x, const _T &y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag=false;
    if (x<y){
        x=y;flag|=true;
    }
    return flag;
}
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
//const ll inf=2e18+7;
const ll mod=1e9+7;
const ll N=2e6+7;
const ld eps=1e-9;
vector<vector<pair<ll,ll>>> t(N*4),ar(N);
vector<vll> g(N);
ll comp[N];
ll val[N];
void build(ll v,ll tl,ll tr){
	if(tl==tr){
		for(auto i : ar[tl])t[v].pb(i);
		return;
	}
	ll tm=(tl+tr)/2;
	build(v*2,tl,tm);
	build(v*2+1,tm+1,tr);
	for(auto i : t[v*2])t[v].pb(i);
	for(auto i : t[v*2+1])t[v].pb(i);
}
vector<pair<ll,ll> > get(ll v,ll tl,ll tr,ll l,ll r){
	if(tl>r || tr<l)return {};
	if(l<=tl && tr<=r)return t[v];
	ll tm=(tl+tr)/2;
	vector<pair<ll,ll>> vv;
	for(auto i : get(v*2,tl,tm,l,r))vv.pb(i);
	for(auto i : get(v*2+1,tm+1,tr,l,r))vv.pb(i);
	return vv;
}
void dfs(ll v,ll c){
	comp[v]=c;
	for(auto i : g[v]){
		if(comp[i])continue;
		dfs(i,c);
	}
}
void solve(){
	ll i;
	ll n;
	ll a,b;
	cin>>n;
	vector<vector<pair<ll,ll>>> cur(n*2+5);
	for(i=1;i<=n;i++){
		cin>>a>>b;
		ar[b].pb({a,i});
		cur[a].pb({b,i});
	}
	build(1,1,n*2);
	for(i=1;i<=2*n;i++){
		for(auto j : cur[i]){
			vector<pair<ll,ll>> v=get(1,1,n*2,i,j.fr);
			sort(all(v));
			for(auto q : v){
				if(q.fr>=i)break;
				g[q.sc].pb(j.sc);
				g[j.sc].pb(q.sc);
				val[j.sc]=max(val[q.sc]+1,val[j.sc]);
			}
			if(val[j.sc]>1){
				cout<<0<<endl;
				return;
			}
		}
		for(auto j : ar[i]){
			for(auto to : g[j.sc]){
				val[to]--;
			}
		}
	}
	ll c=0;
	for(i=1;i<=n;i++){
		if(comp[i]==0)dfs(i,++c);
	}
	ll x=1;
	for(i=1;i<=c;i++){
		x*=2;
		x%=mod;
	}
	cout<<x<<endl;
}
signed main(){
	start();
    ll t=1;
	//cin>>t;
    while(t--) solve();
    return 0;
}
/*
1
6
5 4 3 2 1 0





*/

Compilation message

port_facility.cpp: In function 'void fre(std::string)':
port_facility.cpp:42:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
port_facility.cpp:42:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 282196 KB Output is correct
2 Correct 63 ms 282196 KB Output is correct
3 Correct 62 ms 282192 KB Output is correct
4 Correct 63 ms 282196 KB Output is correct
5 Correct 64 ms 282448 KB Output is correct
6 Correct 62 ms 282048 KB Output is correct
7 Correct 62 ms 282264 KB Output is correct
8 Correct 61 ms 282224 KB Output is correct
9 Correct 62 ms 282192 KB Output is correct
10 Correct 63 ms 282196 KB Output is correct
11 Correct 61 ms 282192 KB Output is correct
12 Correct 62 ms 282256 KB Output is correct
13 Correct 62 ms 282196 KB Output is correct
14 Correct 62 ms 282196 KB Output is correct
15 Correct 63 ms 282192 KB Output is correct
16 Correct 62 ms 282256 KB Output is correct
17 Correct 63 ms 282268 KB Output is correct
18 Correct 64 ms 282084 KB Output is correct
19 Correct 62 ms 282044 KB Output is correct
20 Correct 64 ms 282192 KB Output is correct
21 Correct 65 ms 282452 KB Output is correct
22 Correct 62 ms 282192 KB Output is correct
23 Correct 62 ms 282192 KB Output is correct
24 Correct 66 ms 282196 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 282196 KB Output is correct
2 Correct 63 ms 282196 KB Output is correct
3 Correct 62 ms 282192 KB Output is correct
4 Correct 63 ms 282196 KB Output is correct
5 Correct 64 ms 282448 KB Output is correct
6 Correct 62 ms 282048 KB Output is correct
7 Correct 62 ms 282264 KB Output is correct
8 Correct 61 ms 282224 KB Output is correct
9 Correct 62 ms 282192 KB Output is correct
10 Correct 63 ms 282196 KB Output is correct
11 Correct 61 ms 282192 KB Output is correct
12 Correct 62 ms 282256 KB Output is correct
13 Correct 62 ms 282196 KB Output is correct
14 Correct 62 ms 282196 KB Output is correct
15 Correct 63 ms 282192 KB Output is correct
16 Correct 62 ms 282256 KB Output is correct
17 Correct 63 ms 282268 KB Output is correct
18 Correct 64 ms 282084 KB Output is correct
19 Correct 62 ms 282044 KB Output is correct
20 Correct 64 ms 282192 KB Output is correct
21 Correct 65 ms 282452 KB Output is correct
22 Correct 62 ms 282192 KB Output is correct
23 Correct 62 ms 282192 KB Output is correct
24 Correct 66 ms 282196 KB Output is correct
25 Correct 122 ms 283256 KB Output is correct
26 Correct 135 ms 283184 KB Output is correct
27 Correct 122 ms 283172 KB Output is correct
28 Correct 119 ms 283220 KB Output is correct
29 Correct 121 ms 283212 KB Output is correct
30 Correct 119 ms 283220 KB Output is correct
31 Correct 121 ms 283020 KB Output is correct
32 Correct 122 ms 282964 KB Output is correct
33 Correct 118 ms 282852 KB Output is correct
34 Correct 73 ms 282708 KB Output is correct
35 Correct 64 ms 282948 KB Output is correct
36 Correct 91 ms 282704 KB Output is correct
37 Correct 66 ms 282704 KB Output is correct
38 Correct 64 ms 282612 KB Output is correct
39 Correct 64 ms 282708 KB Output is correct
40 Correct 64 ms 282708 KB Output is correct
41 Correct 147 ms 290980 KB Output is correct
42 Correct 144 ms 290900 KB Output is correct
43 Incorrect 65 ms 282768 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 282196 KB Output is correct
2 Correct 63 ms 282196 KB Output is correct
3 Correct 62 ms 282192 KB Output is correct
4 Correct 63 ms 282196 KB Output is correct
5 Correct 64 ms 282448 KB Output is correct
6 Correct 62 ms 282048 KB Output is correct
7 Correct 62 ms 282264 KB Output is correct
8 Correct 61 ms 282224 KB Output is correct
9 Correct 62 ms 282192 KB Output is correct
10 Correct 63 ms 282196 KB Output is correct
11 Correct 61 ms 282192 KB Output is correct
12 Correct 62 ms 282256 KB Output is correct
13 Correct 62 ms 282196 KB Output is correct
14 Correct 62 ms 282196 KB Output is correct
15 Correct 63 ms 282192 KB Output is correct
16 Correct 62 ms 282256 KB Output is correct
17 Correct 63 ms 282268 KB Output is correct
18 Correct 64 ms 282084 KB Output is correct
19 Correct 62 ms 282044 KB Output is correct
20 Correct 64 ms 282192 KB Output is correct
21 Correct 65 ms 282452 KB Output is correct
22 Correct 62 ms 282192 KB Output is correct
23 Correct 62 ms 282192 KB Output is correct
24 Correct 66 ms 282196 KB Output is correct
25 Correct 122 ms 283256 KB Output is correct
26 Correct 135 ms 283184 KB Output is correct
27 Correct 122 ms 283172 KB Output is correct
28 Correct 119 ms 283220 KB Output is correct
29 Correct 121 ms 283212 KB Output is correct
30 Correct 119 ms 283220 KB Output is correct
31 Correct 121 ms 283020 KB Output is correct
32 Correct 122 ms 282964 KB Output is correct
33 Correct 118 ms 282852 KB Output is correct
34 Correct 73 ms 282708 KB Output is correct
35 Correct 64 ms 282948 KB Output is correct
36 Correct 91 ms 282704 KB Output is correct
37 Correct 66 ms 282704 KB Output is correct
38 Correct 64 ms 282612 KB Output is correct
39 Correct 64 ms 282708 KB Output is correct
40 Correct 64 ms 282708 KB Output is correct
41 Correct 147 ms 290980 KB Output is correct
42 Correct 144 ms 290900 KB Output is correct
43 Incorrect 65 ms 282768 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 282196 KB Output is correct
2 Correct 63 ms 282196 KB Output is correct
3 Correct 62 ms 282192 KB Output is correct
4 Correct 63 ms 282196 KB Output is correct
5 Correct 64 ms 282448 KB Output is correct
6 Correct 62 ms 282048 KB Output is correct
7 Correct 62 ms 282264 KB Output is correct
8 Correct 61 ms 282224 KB Output is correct
9 Correct 62 ms 282192 KB Output is correct
10 Correct 63 ms 282196 KB Output is correct
11 Correct 61 ms 282192 KB Output is correct
12 Correct 62 ms 282256 KB Output is correct
13 Correct 62 ms 282196 KB Output is correct
14 Correct 62 ms 282196 KB Output is correct
15 Correct 63 ms 282192 KB Output is correct
16 Correct 62 ms 282256 KB Output is correct
17 Correct 63 ms 282268 KB Output is correct
18 Correct 64 ms 282084 KB Output is correct
19 Correct 62 ms 282044 KB Output is correct
20 Correct 64 ms 282192 KB Output is correct
21 Correct 65 ms 282452 KB Output is correct
22 Correct 62 ms 282192 KB Output is correct
23 Correct 62 ms 282192 KB Output is correct
24 Correct 66 ms 282196 KB Output is correct
25 Correct 122 ms 283256 KB Output is correct
26 Correct 135 ms 283184 KB Output is correct
27 Correct 122 ms 283172 KB Output is correct
28 Correct 119 ms 283220 KB Output is correct
29 Correct 121 ms 283212 KB Output is correct
30 Correct 119 ms 283220 KB Output is correct
31 Correct 121 ms 283020 KB Output is correct
32 Correct 122 ms 282964 KB Output is correct
33 Correct 118 ms 282852 KB Output is correct
34 Correct 73 ms 282708 KB Output is correct
35 Correct 64 ms 282948 KB Output is correct
36 Correct 91 ms 282704 KB Output is correct
37 Correct 66 ms 282704 KB Output is correct
38 Correct 64 ms 282612 KB Output is correct
39 Correct 64 ms 282708 KB Output is correct
40 Correct 64 ms 282708 KB Output is correct
41 Correct 147 ms 290980 KB Output is correct
42 Correct 144 ms 290900 KB Output is correct
43 Incorrect 65 ms 282768 KB Output isn't correct
44 Halted 0 ms 0 KB -