Submission #1298043

#	Time	Username	Problem	Language	Result	Execution time	Memory
1298043		ender_shayan	Port Facility (JOI17_port_facility)	C++20	22 / 100	6089 ms	18044 KiB

port_facility

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;

ll inf=1e18;
const int N=1e6+100,L=21,bs=701,NN=1e6;
int B[N],C[N],D[N],E[N],n,m,k,q,dp[N],pre[N],dist[N],vis[N],c[N];
vector<int>g[N];

pii A[N];
ll ans;
void dfs(int v){
    vis[v]=1;
    for(int u:g[v]){
        if(vis[u])
            ans=ans*(c[u]!=c[v]);
        else{
            c[u]=c[v]^1;
            dfs(u);
        }
    }
}
int main(){
    fast_io
    cin>>n;
    for1(n)cin>>A[i].F>>A[i].S;
    for1(n)for(int j=1;j<=n;j++){
        if((A[i].F<A[j].F && A[j].F<A[i].S && A[i].S<A[j].S)){
            g[i].pb(j);
            g[j].pb(i);
        }
    }
    ans=1;
    for1(n)if(vis[i]==0){
        dfs(i);
        ans=ans*2%mod;
    }
    cout<<ans<<endl;


}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 0 / 56
• Subtask 4: 0 / 22