제출 #565461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
565461		zaneyu	Port Facility (JOI17_port_facility)	C++14	100 / 100	1704 ms	84012 KiB

port_facility

/*input
4
1 3
2 5
4 8
6 7
*/
#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 tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
pii arr[maxn];
int par[2*maxn];
int dp[maxn];
int find(int u){
    if(par[u]==u) return u;
    return par[u]=find(par[u]);
}
void merge(int a,int b){
    a=find(a),b=find(b);
    if(a==b) return;
    par[a]=b;
}
int main(){
    int n;
    cin>>n;
    map<int,int> mp;
    REP(i,n) cin>>arr[i].f>>arr[i].s;
    REP(i,2*n) par[i]=i;
    sort(arr,arr+n);
    REP(i,n){
        auto it=mp.upper_bound(arr[i].f),it2=mp.lower_bound(arr[i].s);
        if(it2!=mp.begin()){
        for(auto a=it;a!=it2;a++){
            merge(i,(*a).s+n);
            merge(i+n,(*a).s);
            if(find((*a).s)==find((*prev(it2)).s)) break;
        }
        }
        mp[arr[i].s]=i;
    }
    REP(i,n) if(find(i)==find(i+n)){
        cout<<0;
        return 0;
    }
    int ans=1;
    REP(i,n) if(find(i)==i) ans=ans*2%MOD;
    cout<<ans;
} 

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