제출 #97543

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97543		silxikys	Port Facility (JOI17_port_facility)	C++14	22 / 100	6032 ms	39928 KiB

port_facility

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 1e6+6;
int N;
pair<int,int> a[maxn];
int color[maxn]; //0 = uncolored, 1, 2
vector<int> adj[maxn];

bool intersect(pair<int,int> a, pair<int,int> b) {
    if (a.first > b.first) swap(a,b);
    return b.second < a.second || a.second < b.first;
}

bool fail = false;
void dfs(int i, int c) {
    color[i] = c;
    for (int j: adj[i]) {
        if (color[j] == c) {
            fail = true;
            return;
        }
        if (color[j] == 0) {
            dfs(j,c==1?2:1);
        }
    }
}


int main()
{
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> a[i].first >> a[i].second;
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (i == j) continue;
            if (!intersect(a[i],a[j])) {
                adj[i].push_back(j);    
            }
        }
    }
    int comp = 0;
    for (int i = 0; i < N; i++) {
        if (color[i] == 0) {
            dfs(i,1);
            ++comp;
        }
    }
    if (fail) {
        cout << 0 << '\n';
    }
    else {
        int res = 1;
        for (int i = 0; i < comp; i++) {
            res = (res * 2) % 1000000007;
        }
        cout << res << '\n';
    }
}

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