Submission #210444

#	Time	Username	Problem	Language	Result	Execution time	Memory
210444		dolphingarlic	Port Facility (JOI17_port_facility)	C++14	22 / 100	6076 ms	7928 KiB

port_facility

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

const ll MOD = 1e9 + 7;

pair<int, int> a[1000000];
int cmp[2000000], n;

int find(int A) {
    while (A != cmp[A]) cmp[A] = cmp[cmp[A]], A = cmp[A];
    return A;
}

void onion(int A, int B) { cmp[find(A)] = find(B); }

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    FOR(i, 0, n) cin >> a[i].first >> a[i].second;
    sort(a, a + n);

    iota(cmp, cmp + 2 * n, 0);

    set<pair<int, int>> s;
    FOR(i, 0, n) {
        while (s.size() && (*s.begin()).first < a[i].first) s.erase(s.begin());

        for (pair<int, int> j : s) {
            if (j.first > a[i].second) break;
            onion(i, j.second + n); onion(i + n, j.second);
        }
        s.insert({a[i].second, i});
    }

    FOR(i, 0, n) if (find(i) == find(i + n)) return cout << 0, 0;
    ll cnt = 0, ans = 1;
    FOR(i, 0, 2 * n) if (find(i) == i) cnt++;
    FOR(i, 0, cnt / 2) ans = (ans * 2) % MOD;
    cout << ans;
    return 0;
}

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