結果
| 問題 | No.274 The Wall |
| ユーザー |
 hamray
|
| 提出日時 | 2021-03-13 02:19:33 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 681 ms / 2,000 ms |
| コード長 | 6,165 bytes |
| コンパイル時間 | 2,345 ms |
| コンパイル使用メモリ | 206,688 KB |
| 最終ジャッジ日時 | 2025-01-19 16:03:04 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 22 |
ソースコード
#include <bits/stdc++.h>//#include <atcoder/all>//using namespace atcoder;#pragma GCC target ("avx")#pragma GCC optimization ("O3")#pragma GCC optimization ("unroll-loops")using namespace std;typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<string> VS;typedef pair<int, int> PII;typedef pair<int, int> pii;typedef pair<long long, long long> PLL;typedef pair<int, PII> TIII;typedef long long ll;typedef long double ld;typedef unsigned long long ull;#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)#define REP(i, n) FOR(i, 0, n)#define rep(i, a, b) for (int i = a; i < (b); ++i)#define trav(a, x) for (auto &a : x)#define all(x) x.begin(), x.end()#define MOD 1000000007template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}const double EPS = 1e-6, PI = acos(-1);const double pi = 3.141592653589793238462643383279;//ここから編集typedef string::const_iterator State;ll GCD(ll a, ll b){return (b==0)?a:GCD(b, a%b);}ll LCM(ll a, ll b){return a/GCD(a, b) * b;}template< int mod >struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt< mod >(t);return (is);}static int get_mod() { return mod; }};using modint = ModInt< 1000000007 >;template< typename T >struct Combination {vector< T > _fact, _rfact, _inv;Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {_fact[0] = _rfact[sz] = _inv[0] = 1;for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;_rfact[sz] /= _fact[sz];for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];}inline T fact(int k) const { return _fact[k]; }inline T rfact(int k) const { return _rfact[k]; }inline T inv(int k) const { return _inv[k]; }T P(int n, int r) const {if(r < 0 || n < r) return 0;return fact(n) * rfact(n - r);}T C(int p, int q) const {if(q < 0 || p < q) return 0;return fact(p) * rfact(q) * rfact(p - q);}T H(int n, int r) const {if(n < 0 || r < 0) return (0);return r == 0 ? 1 : C(n + r - 1, r);}};int modpow(ll x, ll n, int mod) {ll res = 1;while(n) {if(n&1) res = res*x % mod;x = x*x%mod;n >>= 1;}return res;}template< typename G >struct StronglyConnectedComponents {const G &g;vector<vector<int>> gg, rg;vector< int > comp, order, used;StronglyConnectedComponents(G &g) : g(g), gg(g.size()), rg(g.size()), comp(g.size(), -1), used(g.size()) {for(int i = 0; i < g.size(); i++) {for(auto e : g[i]) {gg[i].emplace_back((int) e);rg[(int) e].emplace_back(i);}}}int operator[](int k) {return comp[k];}void dfs(int idx) {if(used[idx]) return;used[idx] = true;for(int to : gg[idx]) dfs(to);order.push_back(idx);}void rdfs(int idx, int cnt) {if(comp[idx] != -1) return;comp[idx] = cnt;for(int to : rg[idx]) rdfs(to, cnt);}void build(vector<int> &t) {for(int i = 0; i < gg.size(); i++) dfs(i);reverse(begin(order), end(order));int ptr = 0;for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;t.resize(comp.size());REP(i,comp.size()) t[i] = comp[i];}};bool intersect(int l1, int r1, int l2, int r2) {return (l1 <= l2 && l2 <= r1) || (l1 <= r2 && r2 <= r1) || (l2 <= l1 && l1 <= r2) || (l2 <= r1 && r1 <= r2);}int main() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(7);int N, M; cin >> N >> M;vector<int> L(N), R(N);REP(i,N) cin >> L[i] >> R[i];vector<vector<int>> g(2*N);REP(i,N) {for(int j=i+1; j<N; j++) {if(intersect(L[i], R[i], L[j], R[j])) {g[i+N].push_back(j);g[j+N].push_back(i);}if(intersect(min(M-R[i]-1,M-L[i]-1), max(M-R[i]-1,M-L[i]-1), L[j], R[j])) {g[i].push_back(j);g[j+N].push_back(i+N);}if(intersect(L[i], R[i], min(M-R[j]-1, M-L[j]-1), max(M-R[j]-1, M-L[j]-1))) {g[i+N].push_back(j+N);g[j].push_back(i);}if(intersect(min(M-R[i]-1,M-L[i]-1), max(M-R[i]-1,M-L[i]-1), min(M-R[j]-1, M-L[j]-1), max(M-R[j]-1, M-L[j]-1))) {g[i].push_back(j+N);g[j].push_back(i+N);}}}vector<int> cmp;StronglyConnectedComponents scc(g);scc.build(cmp);for(int i=0; i<N; i++) {if(cmp[i] == cmp[i+N]) {cout << "NO" << endl;return 0;}}cout << "YES" << endl;return 0;}