제출 #1086731

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1086731		steveonalex	Port Facility (JOI17_port_facility)	C++17	10 / 100	9 ms	632 KiB

port_facility

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        for(int i = 1; i<=n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }

    int get_size(int u){return sz[find_set(u)];}
};
 
int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();
 
    int n; cin >> n;
    vector<pair<int,int>> a(n);
    for(int i= 0; i<n; ++i) cin >> a[i].first >> a[i].second;

    vector<int> from_left(n*2+1, -1), from_right(n*2+1, -1);
    for(int i= 0; i<n; ++i) {
        from_left[a[i].first] = from_right[a[i].second] = i;
    }

    vector<pair<int, int>> range(n, {-1, n * 2 + 1});

    set<int> S;
    for(int i = 1; i<=n*2; ++i){
        int j = from_left[i];
        if (j == -1) continue;
        auto it = S.upper_bound(a[j].second);
        if (it != S.begin()){
            it--;
            if (*it >= a[j].first) range[j].first = *it;
        }
        S.insert(a[j].second);
    }
    S.clear();
    for(int i = n*2; i>=1; --i){
        int j = from_right[i];
        if (j == -1) continue;
        auto it = S.upper_bound(a[j].first);
        if (it != S.end()){
            if (*it <= a[j].second) range[j].second = *it;
        }
        S.insert(a[j].first);
    }

    for(int i = 0; i<n; ++i) if (range[i].first > range[i].second) {
        cout << 0 << "\n";
        exit(0);
    }

    S.clear();
    DSU mst(n);
    int cc = n;

    for(int i = 1; i<=n*2; ++i){
        int j = from_left[i];
        if (j == -1) continue;
        auto it = S.upper_bound(a[j].first);
        while(it != S.end() && (*it) < a[j].second){
            int k = from_right[*it];
            cc -= mst.join_set(j, k);

            it++;
        }
        S.insert(a[j].second);
    }

    const int MOD = 1e9 + 7;
    int ans = 1;
    while(cc--){
        ans *= 2;
        if (ans >= MOD) ans -= MOD;
    }
    cout << ans << "\n";

 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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