結果

問題 No.274 The Wall
ユーザー snbn
提出日時 2020-07-27 21:46:26
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 3,611 bytes
コンパイル時間 1,035 ms
コンパイル使用メモリ 107,952 KB
実行使用メモリ 67,840 KB
最終ジャッジ日時 2024-06-22 02:38:47
合計ジャッジ時間 2,366 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (int64_t)(n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
#define chmax(a, b) (a) = max(a, b)
#define chmin(a, b) (a) = min(a, b)
vector<vector<int>> inversed_edge(const vector<vector<int>> &edge) {
  vector<vector<int>> result(edge.size());
  for (int i = 0; i < edge.size(); i++) {
    for (int from : edge[i]) {
      result[from].push_back(i);
    }
  }
  return result;
}
class TopologicalSort {
  const vector<vector<int>> &mOutEdge;
  vector<int> mIsVisited;
 public:
  TopologicalSort(const TopologicalSort &) = delete;
  TopologicalSort &operator=(const TopologicalSort &) = delete;
  TopologicalSort(TopologicalSort &&) = delete;
  TopologicalSort &operator=(TopologicalSort &&) = delete;
  explicit TopologicalSort(const vector<vector<int>> &outEdge)
      : mOutEdge(outEdge), mIsVisited(outEdge.size()) {}
  vector<int> build() {
    const int N = mIsVisited.size();
    fill(mIsVisited.begin(), mIsVisited.end(), false);
    vector<int> sorted;
    for (int i = 0; i < N; i++) {
      if (!mIsVisited[i]) {
        dfs(i, sorted);
      }
    }
    return sorted;
  }
 private:
  void dfs(int node, vector<int> &sorted) {
    mIsVisited[node] = true;
    for (int c : mOutEdge[node]) {
      if (!mIsVisited[c]) {
        dfs(c, sorted);
      }
    }
    sorted.push_back(node);
  }
};
class StrictlyConnectedComponent {
  const vector<vector<int>> &mInEdge;
  const vector<int> mSorted;
  vector<int> mIsVisited;
 public:
  StrictlyConnectedComponent(const StrictlyConnectedComponent &) = delete;
  StrictlyConnectedComponent &operator=(const StrictlyConnectedComponent &) =
      delete;
  StrictlyConnectedComponent(StrictlyConnectedComponent &&) = delete;
  StrictlyConnectedComponent &operator=(StrictlyConnectedComponent &&) = delete;
  explicit StrictlyConnectedComponent(const vector<vector<int>> &inEdge,
                                      const vector<int> &sorted)
      : mInEdge(inEdge), mSorted(sorted), mIsVisited(inEdge.size()) {}
  vector<int> build() {
    const int N = mIsVisited.size();
    vector<int> group(N);
    fill(mIsVisited.begin(), mIsVisited.end(), false);
    for (int i = N - 1; i >= 0; i--) {
      if (!mIsVisited[mSorted[i]]) {
        dfs(mSorted[i], i, group);
      }
    }
    return group;
  }
 private:
  void dfs(int node, int curr, vector<int> &group) {
    mIsVisited[node] = true;
    group[node] = curr;
    for (int c : mInEdge[node]) {
      if (!mIsVisited[c]) {
        dfs(c, curr, group);
      }
    }
  }
};
int main() {
  int N, M;
  cin >> N >> M;
  vector<int> l(N), r(N);
  rep(i, N) { cin >> l[i] >> r[i]; }
  vector<vector<int>> edge(2 * N);
  rep(i, N) rep(j, N) {
    if (i != j) {
      if (!(r[i] < l[j] || r[j] < l[i])) {
        edge[i].push_back(j + N);
        edge[i + N].push_back(j);
      }
      if (!(r[i] < M - r[j] - 1 || M - l[j] - 1 < l[i])) {
        edge[i].push_back(j);
        edge[i + N].push_back(j + N);
      }
    }
  }
  auto sorted = TopologicalSort(edge).build();
  auto group = StrictlyConnectedComponent(edge, sorted).build();
  bool result = true;
  rep(i, N) { result = result && (group[i] != group[i + N]); }
  cout << (result ? "YES" : "NO") << endl;
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0