結果

問題 No.274 The Wall
ユーザー tokusakurai
提出日時 2020-08-29 23:37:40
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 468 ms / 2,000 ms
コード長 3,053 bytes
コンパイル時間 2,705 ms
コンパイル使用メモリ 205,960 KB
最終ジャッジ日時 2025-01-13 20:36:28
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct Graph{
    vector<vector<int>> es;
    const int n;
    Graph(int n) : n(n){
        es.resize(n);
    }
    void add_edge(int from, int to, bool directed = false){
        es[from].pb(to);
        if(!directed) es[to].pb(from);
    }
};
struct Strongly_Connected_Components{
    vector<vector<int>> es, rs;
    vector<int> vs, comp;
    vector<bool> used;
    const int n;
    Strongly_Connected_Components(int n) : n(n){
        es.resize(n), rs.resize(n);
        vs.resize(n), comp.resize(n), used.resize(n);
    }
    void add_edge(int from, int to, bool directed = false){
        es[from].pb(to), rs[to].pb(from);
        if(!directed) es[to].pb(from), rs[from].pb(to);
    }
    void dfs(int now){
        used[now] = true;
        for(auto &e: es[now]) if(!used[e]) dfs(e);
        vs.pb(now);
    }
    void rdfs(int now, int cnt){
        used[now] = true, comp[now] = cnt;
        for(auto &e: rs[now]) if(!used[e]) rdfs(e, cnt);
    }
    Graph decompose(){
        fill(all(used), false);
        rep(i, n) if(!used[i]) dfs(i);
        fill(all(used), false), reverse(all(vs));
        int cnt = 0;
        for(auto &e: vs) if(!used[e]) rdfs(e, cnt++);
        Graph G(cnt);
        rep(i, n){
            for(auto &e: es[i]){
                int u = comp[i], v = comp[e];
                if(u != v) G.add_edge(u, v, true);
            }
        }
        return G;
    }
    int operator [] (int k) const{
        return comp[k];
    }
};
bool intersect(int l1, int r1, int l2, int r2){
    return l2 < r1 && l1 < r2;
}
int main(){
    int H, W;
    cin >> H >> W;
    int L[H], R[H];
    rep(i, H){
        cin >> L[i] >> R[i]; R[i]++;
    }
    Strongly_Connected_Components G(2*H);
    rep(i, H){
        rep(j, H){
            if(j == i) continue;
            if(intersect(L[i], R[i], L[j], R[j])){
                G.add_edge(i, H+j, true), G.add_edge(H+i, j, true);
            }
            if(intersect(L[i], R[i], W-R[j], W-L[j])){
                G.add_edge(i, j, true), G.add_edge(H+i, H+j, true);
            }
        }
    }
    G.decompose();
    bool ans = true;
    rep(i, H){
        if(G[i] == G[H+i]) ans = false;
    }
    cout << (ans? "YES" : "NO") << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0