結果
| 問題 | No.483 マッチ並べ |
| ユーザー |
 __math
|
| 提出日時 | 2017-02-10 23:40:34 |
| 言語 | C++11 (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 5,358 bytes |
| コンパイル時間 | 1,922 ms |
| コンパイル使用メモリ | 176,880 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-12-29 11:21:11 |
| 合計ジャッジ時間 | 3,488 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 53 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define FOR(i,n) for(int i = 0; i < (n); i++)#define sz(c) ((int)c.size())#define ten(n) ((int)1e##n)using ll = long long;using Pii = pair<int, int>;using Pll = pair<ll, ll>;template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }#define mygc(c) (c)=getchar_unlocked()#define mypc(c) putchar_unlocked(c)void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for(;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for(;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }template<class T> void writerLn(T x) { writer(x, '\n'); }template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }ll mod_pow(ll a, ll n, ll mod) {ll ret = 1;ll p = a % mod;while (n) {if (n & 1) ret = ret * p % mod;p = p * p % mod;n >>= 1;}return ret;}template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b-= q * a, a); } return b; }template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }struct E {int to, rev, cap;E(int to, int rev, int cap) : to(to), rev(rev), cap(cap) {}};const int MAX_V = 1000;int level[MAX_V], iter[MAX_V];vector<E> e[MAX_V];void add_undirected_edge(int f, int t, int c) {e[f].push_back(E(t, sz(e[t]), c));e[t].push_back(E(f, sz(e[f]) - 1, c));}void add_directed_edge(int f, int t, int c) {e[f].push_back(E(t, sz(e[t]), c));e[t].push_back(E(f, sz(e[f]) - 1, 0));}void bfs(int s) {memset(level, -1, sizeof(level));queue<int> q;level[s] = 0;q.push(s);while (!q.empty()) {int v = q.front(); q.pop();for (auto t : e[v]) {if (t.cap > 0 && level[t.to] < 0) {level[t.to] = level[v] + 1;q.push(t.to);}}}}int dfs(int v, int t, int f) {if (v == t) return f;for (int &i = iter[v]; i < sz(e[v]); i++) {E& _e = e[v][i];if (_e.cap > 0 && level[v] < level[_e.to]) {int d = dfs(_e.to, t, min(f, _e.cap));if (d > 0) {_e.cap -= d;e[_e.to][_e.rev].cap += d;return d;}}}return 0;}int max_flow(int s, int t) {int flow = 0;while (true) {bfs(s);if (level[t] < 0) return flow;memset(iter, 0, sizeof(iter));int f;while ((f = dfs(s, t, ten(6))) > 0) {flow += f;}}}int main() {int n;reader(n);vector<Pii> vp;FOR(i, n) {int a, b, c, d; reader(a, b, c, d);vp.emplace_back(a * 200 + b, c * 200 + d);}set<int> sidx;for (auto kv : vp) {sidx.insert(kv.first);sidx.insert(kv.second);}vector<int> idx(sidx.begin(), sidx.end());const int s = sz(idx), t = sz(idx) + 1;FOR(i,n) {auto& kv = vp[i];kv.first = lower_bound(idx.begin(), idx.end(), kv.first) - idx.begin();kv.second = lower_bound(idx.begin(), idx.end(), kv.second) - idx.begin();const int md = t + i + 1;add_directed_edge(s, md, 1);add_directed_edge(md, kv.first, 1);add_directed_edge(md, kv.second, 1);}FOR(i, sz(idx)) add_directed_edge(i, t, 1);int f = max_flow(s, t);puts(f == n ? "YES" : "NO");return 0;}