#486140 (C++17) No.274 The Wall

• 問題: No.274 The Wall
• ユーザー: yuto1115
• 提出日時: 2020-05-23 10:08:28
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 554 ms / 2,000 ms
• コード長: 2,938 bytes
• コンパイル時間: 2,146 ms
• コンパイル使用メモリ: 209,196 KB
• 最終ジャッジ日時: 2025-01-10 15:16:53
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class T> istream& operator>>(istream& is,vector<T>& v) { for(T& t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { rep(i,v.size())os<<v[i]<<(i==v.size()-1?"\n":" "); return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
// Decomposition of Strongly Connected Components
class scc {
    int n;
    vvi G,rG;
    vi ord,bel;
    vb used;
    void init() {
        rG.resize(n);
        rep(i,n) for(int j : G[i]) rG[j].pb(i);
        bel.resize(n);
        used.resize(n);
    }
    void dfs(int v) {
        used[v] = true;
        for(int u : G[v]) if(!used[u]) dfs(u);
        ord.pb(v);
    }
    void rdfs(int v,int k) {
        used[v] = true;
        bel[v] = k;
        for(int u : rG[v]) if(!used[u]) rdfs(u,k);
    }
public:
    // number of components
    int num;
    scc(vvi G):G(G) {
        n = G.size();
        init();
        used.assign(n,false);
        rep(i,n) if(!used[i]) dfs(i);
        used.assign(n, false);
        int k = 0;
        rrep(i,n) if(!used[ord[i]]) rdfs(ord[i],k++);
        num = k;
    }
    // belonging components(topological order)
    int get(int i) { return bel[i]; }
};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int n,m;
    cin >> n >> m;
    vi l(n),r(n);
    rep(i,n) cin >> l[i] >> r[i];
    vvi G(2*n);
    rep(i,n) rep(j,i) {
        // i => !j , j => !i
        // !i => j , !j => i
        if(l[i] <= r[j] && l[j] <= r[i]) {
            G[i].pb(n+j);
            G[j].pb(n+i);
            G[n+i].pb(j);
            G[n+j].pb(i);
        }
        // !i => !j , j => i
        if(m-1-r[i] <= r[j] && l[j] <= m-1-l[i]) {
            G[n+i].pb(n+j);
            G[j].pb(i);
        }
        // i => j , !j => !i
        if(l[i] <= m-1-l[j] && m-1-r[j] <= r[i]) {
            G[i].pb(j);
            G[n+j].pb(n+i);
        }
    }
    scc sc(G);
    rep(i,n) if(sc.get(i) == sc.get(n+i)) {
        YES(0);
        return 0;
    }
    YES(1);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX