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

• 問題: No.274 The Wall
• ユーザー: 👑 emthrm
• 提出日時: 2019-09-06 04:11:11
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,014 ms / 2,000 ms
• コード長: 3,176 bytes
• コンパイル時間: 3,389 ms
• コンパイル使用メモリ: 91,016 KB
• 最終ジャッジ日時: 2025-01-07 16:34:29
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
/*-------------------------------------------------*/
struct Edge {
  int src, dst;
  Edge(int src, int dst) : src(src), dst(dst) {}
};
struct SCC {
  vector<int> id;
  // vector<vector<int> > vertices;
  // vector<vector<Edge> > comp;
  SCC(const vector<vector<Edge> > &graph_) : graph(graph_) {
    n = graph.size();
    rev_graph.resize(n);
    REP(i, n) for (Edge &e : graph[i]) {
      rev_graph[e.dst].emplace_back(e.dst, e.src);
    }
    used.resize(n);
    id.resize(n);
  }
  int build() {
    fill(ALL(used), false);
    order.clear();
    fill(ALL(id), -1);
    // vertices.clear();
    // comp.clear();
    REP(i, n) {
      if (!used[i]) dfs(i);
    }
    int now = 0;
    for (int i = n - 1; i >= 0; --i) {
      if (id[order[i]] == -1) {
        // vertices.emplace_back();
        rev_dfs(order[i], now++);
      }
    }
    // comp.resize(now);
    // REP(i, n) for (Edge &e : graph[i]) {
    //   if (id[i] != id[e.dst]) comp[id[i]].emplace_back(id[i], id[e.dst], e.cost);
    // }
    // REP(i, now) sort(ALL(vertices[i]));
    return now;
  }
private:
  int n;
  vector<vector<Edge> > graph, rev_graph;
  vector<bool> used;
  vector<int> order;
  void dfs(int ver) {
    used[ver] = true;
    for (Edge &e : graph[ver]) {
      if (!used[e.dst]) dfs(e.dst);
    }
    order.emplace_back(ver);
  }
  void rev_dfs(int ver, int now) {
    id[ver] = now;
    // vertices[now].emplace_back(ver);
    for (Edge &e : rev_graph[ver]) {
      if (id[e.dst] == -1) rev_dfs(e.dst, now);
    }
  }
};
struct TwoSat {
  TwoSat(int n) : n(n) { graph.resize(n * 2); }
  int negate(int x) { return (n + x) % (n * 2); }
  void add_if(int x, int y) { graph[x].emplace_back(x, y); }
  void add_or(int x, int y) {
    add_if(negate(x), y);
    add_if(negate(y), x);
  }
  void add_nand(int x, int y) { add_or(negate(x), negate(y)); }
  void set_true(int x) { add_if(negate(x), x); }
  void set_false(int x) { set_true(negate(x)); }
  vector<bool> build() {
    SCC scc(graph);
    scc.build();
    vector<bool> res(n);
    REP(i, n) {
      if (scc.id[i] == scc.id[negate(i)]) return {};
      res[i] = scc.id[negate(i)] < scc.id[i];
    }
    return res;
  }
private:
  int n;
  vector<vector<Edge> > graph;
};
int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);
  int n, m; cin >> n >> m;
  vector<int> l(n), r(n); REP(i, n) cin >> l[i] >> r[i];
  TwoSat ts(n);
  REP(i, n) REP(j, i) {
    if (l[i] <= r[j] && l[j] <= r[i]) ts.add_nand(i, j);
    if (l[i] <= m - l[j] - 1 && m - r[j] - 1 <= r[i]) ts.add_nand(i, ts.negate(j));
    if (m - r[i] - 1 <= r[j] && l[j] <= m - l[i] - 1) ts.add_nand(ts.negate(i), j);
    if (m - r[i] - 1 <= m - l[j] - 1 && m - r[j] - 1 <= m - l[i] - 1) ts.add_nand(ts.negate(i), ts.negate(j));
  }
  cout << (ts.build().empty() ? "NO\n" : "YES\n");
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX