結果
| 問題 | No.274 The Wall |
| ユーザー |
 Cinnamoroll
|
| 提出日時 | 2020-09-17 03:53:23 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 580 ms / 2,000 ms |
| コード長 | 10,292 bytes |
| コンパイル時間 | 1,974 ms |
| コンパイル使用メモリ | 183,948 KB |
| 実行使用メモリ | 379,304 KB |
| 最終ジャッジ日時 | 2024-06-22 03:57:39 |
| 合計ジャッジ時間 | 4,286 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 22 |
ソースコード
// warm heart, wagging tail,and a smile just for you!// ███████████// ███╬╬╬╬╬╬╬╬╬╬███// ███╬╬╬╬╬████╬╬╬╬╬╬███// ███████████ ██╬╬╬╬╬████╬╬████╬╬╬╬╬██// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██// ██████████████ ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████// ███████ █████ ███████████████████//#include "bits/stdc++.h"using namespace std;#define INF (1<<30)#define LINF (1LL<<60)#define fs first#define sc second#define int long long#define FOR(i,a,b) for(int i=(a);i<(b);++i)#define FOR2(i,a,b) for(int i=(a);i<=(b);++i)#define RFOR(i,a,b) for(int i = (b-1);i>=(a);--i)#define RFOR2(i,a,b) for(int i = (b);i>=(a);--i)#define REP(i,n) FOR(i,0,(n))#define REP2(i,n) FOR2(i,0,(n))#define RREP(i,n) RFOR(i,0,(n))#define RREP2(i,n) RFOR2(i,0,(n))#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ++itr)#define RITR(itr,mp) for(auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)#define range(i,a,b) ((a)<=(i) && (i)<(b))#define range2(i,a,b) ((a)<=(i) && (i)<=(b))#define debug(x) cout << #x << " = " << (x) << endl#define SP << " " <<template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b) {a=b; return true;} else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b) {a=b; return true;} else return false;}#define MSB(x) (63-__builtin_clzll(x))#define pcnt(x) (__builtin_popcountll(x))#define parity(i,j) (i&(1LL<<j))typedef pair<int,int> P;typedef tuple<int,int,int> T;typedef vector<int> vec;typedef vector<vector<int>> mat;struct two_sat {template <class E> struct csr {std::vector<int> start;std::vector<E> elist;csr(int n, const std::vector<std::pair<int, E>>& edges): start(n + 1), elist(edges.size()) {for (auto e : edges) {start[e.first + 1]++;}for (int i = 1; i <= n; i++) {start[i] += start[i - 1];}auto counter = start;for (auto e : edges) {elist[counter[e.first]++] = e.second;}}};// Reference:// R. Tarjan,// Depth-First Search and Linear Graph Algorithmsstruct scc_graph {public:scc_graph(int n) : _n(n) {}int num_vertices() { return _n; }void add_edge(int from, int to) { edges.push_back({from, {to}}); }// @return pair of (# of scc, scc id)std::pair<int, std::vector<int>> scc_ids() {auto g = csr<edge>(_n, edges);int now_ord = 0, group_num = 0;std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);visited.reserve(_n);auto dfs = [&](auto self, int v) -> void {low[v] = ord[v] = now_ord++;visited.push_back(v);for (int i = g.start[v]; i < g.start[v + 1]; i++) {auto to = g.elist[i].to;if (ord[to] == -1) {self(self, to);low[v] = std::min(low[v], low[to]);} else {low[v] = std::min(low[v], ord[to]);}}if (low[v] == ord[v]) {while (true) {int u = visited.back();visited.pop_back();ord[u] = _n;ids[u] = group_num;if (u == v) break;}group_num++;}};for (int i = 0; i < _n; i++) {if (ord[i] == -1) dfs(dfs, i);}for (auto& x : ids) {x = group_num - 1 - x;}return {group_num, ids};}std::vector<std::vector<int>> scc() {auto ids = scc_ids();int group_num = ids.first;std::vector<int> counts(group_num);for (auto x : ids.second) counts[x]++;std::vector<std::vector<int>> groups(ids.first);for (int i = 0; i < group_num; i++) {groups[i].reserve(counts[i]);}for (int i = 0; i < _n; i++) {groups[ids.second[i]].push_back(i);}return groups;}private:int _n;struct edge {int to;};std::vector<std::pair<int, edge>> edges;};public:two_sat() : _n(0), scc(0) {}two_sat(int n) : _n(n), _answer(n), scc(2 * n) {}void add_clause(int i, bool f, int j, bool g) {assert(0 <= i && i < _n);assert(0 <= j && j < _n);scc.add_edge(2 * i + (f ? 0 : 1), 2 * j + (g ? 1 : 0));scc.add_edge(2 * j + (g ? 0 : 1), 2 * i + (f ? 1 : 0));}bool satisfiable() {auto id = scc.scc_ids().second;for (int i = 0; i < _n; i++) {if (id[2 * i] == id[2 * i + 1]) return false;_answer[i] = id[2 * i] < id[2 * i + 1];}return true;}std::vector<bool> answer() { return _answer; }private:int _n;std::vector<bool> _answer;scc_graph scc;};bool f(int a, int b, int c, int d){if(a > c) swap(a,c), swap(b,d);return c <= b;}void solve(){int N,M;cin >> N >> M;vector<int> L(N),R(N);REP(i,N) cin >> L[i] >> R[i];two_sat ts(N);REP(i,N) FOR(j,i+1,N){if(f(L[i],R[i],L[j],R[j])) ts.add_clause(i,false,j,false);if(f(L[i],R[i],M-R[j]-1,M-L[j]-1)) ts.add_clause(i,false,j,true);if(f(M-R[i]-1,M-L[i]-1,L[j],R[j])) ts.add_clause(i,true,j,false);if(f(M-R[i]-1,M-L[i]-1,M-R[j]-1,M-L[j]-1)) ts.add_clause(i,true,j,true);}if(ts.satisfiable()) cout << "YES" << endl;else cout << "NO" << endl;}signed main(){ios::sync_with_stdio(false);cin.tie(0);int T = 1;// cin >> T;while(T--) solve();return 0;}