結果

問題 No.483 マッチ並べ
ユーザー fumiphys
提出日時 2019-07-17 12:57:11
言語 C++14
(gcc 8.2.0)
結果
WA   .
実行時間 -
コード長 4,802 Byte
コンパイル時間 1,517 ms
使用メモリ 1,832 KB
最終ジャッジ日時 2019-07-17 12:57:14

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
sample1.txt AC 4 ms
1,820 KB
sample2.txt AC 4 ms
1,820 KB
sample3.txt AC 5 ms
1,808 KB
test1.txt AC 3 ms
1,820 KB
test2.txt AC 4 ms
1,820 KB
test3.txt AC 3 ms
1,816 KB
test4.txt WA -
test5.txt AC 4 ms
1,816 KB
test6.txt AC 3 ms
1,820 KB
test7.txt AC 3 ms
1,820 KB
test8.txt AC 3 ms
1,816 KB
test9.txt WA -
test10.txt WA -
test11.txt AC 3 ms
1,820 KB
test12.txt AC 5 ms
1,820 KB
test13.txt AC 4 ms
1,820 KB
test14.txt WA -
test15.txt WA -
test16.txt AC 4 ms
1,808 KB
test17.txt AC 4 ms
1,820 KB
test18.txt AC 2 ms
1,820 KB
test19.txt AC 4 ms
1,824 KB
test20.txt AC 4 ms
1,824 KB
test21.txt AC 2 ms
1,824 KB
test22.txt AC 4 ms
1,820 KB
test23.txt AC 4 ms
1,824 KB
test24.txt AC 4 ms
1,824 KB
test25.txt AC 3 ms
1,828 KB
test26.txt AC 4 ms
1,832 KB
test27.txt AC 4 ms
1,828 KB
test28.txt AC 4 ms
1,824 KB
test29.txt AC 4 ms
1,824 KB
test30.txt AC 4 ms
1,828 KB
test31.txt WA -
test32.txt WA -
test33.txt AC 3 ms
1,820 KB
test34.txt AC 4 ms
1,820 KB
test35.txt AC 4 ms
1,820 KB
test36.txt AC 4 ms
1,828 KB
test37.txt AC 3 ms
1,828 KB
test38.txt AC 3 ms
1,820 KB
test39.txt AC 5 ms
1,828 KB
test40.txt AC 4 ms
1,828 KB
test41.txt AC 4 ms
1,828 KB
test42.txt AC 5 ms
1,824 KB
test43.txt AC 5 ms
1,824 KB
test44.txt AC 6 ms
1,820 KB
test45.txt AC 3 ms
1,820 KB
test46.txt AC 5 ms
1,832 KB
test47.txt AC 4 ms
1,820 KB
test48.txt AC 5 ms
1,828 KB
test49.txt AC 4 ms
1,820 KB
test50.txt AC 3 ms
1,832 KB
test51.txt AC 4 ms
1,808 KB
test52.txt WA -
test53.txt WA -
テストケース一括ダウンロード

ソースコード

diff #
// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

typedef struct UnionFind_ {
	vector<int> par;
	vector<int> rank_;
  UnionFind_(){}
	explicit UnionFind_(int n): rank_(n, 0) {
    par.resize(n);
    for(int i = 0; i < n; i++)par[i] = i;
	}
	int find(int x) {
    if(par[x] == x)return x;
    else return par[x] = find(par[x]);
	}
	bool same(int x, int y) {
    if(find(x) == find(y))return true;
    else return false;
	}
	bool unite(int x, int y){
    int xp = find(x);
    int yp = find(y);
    if(xp == yp)return false;
    if(rank_[xp] > rank_[yp])par[yp] = xp;
    else if(rank_[xp] < rank_[yp])par[xp] = yp;
    else {
      par[yp] = xp;
      rank_[xp]++;
    }
    return true;
	}
} UnionFind;

// solve
int n;
vector<int> c1, c2, r1, r2;

vector<int> v[112][112];
bool vis[112][112];


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  cin >> n; r1.resize(n); c1.resize(n); r2.resize(n); c2.resize(n);
  rep(i, n)cin >> r1[i] >> c1[i] >> r2[i] >> c2[i];
  rep(i, n){
    v[r1[i]][c1[i]].pb(i);
    v[r2[i]][c2[i]].pb(i);
  }
  UnionFind uf(n);
  rep(i, n){
    rep(j, n){
      rep(k, sz(v[i][j])){
        FOR(l, k + 1, sz(v[i][j])){
          uf.unite(v[i][j][k], v[i][j][l]);
        }
      }
    }
  }
  rep(i, n){
    int e = 0;
    set<P> st;
    rep(j, n){
      if(uf.find(j) == i){
        e++;
        st.insert(mk(r1[j], c1[j]));
        st.insert(mk(r2[j], c2[j]));
      }
    }
    if(e > st.size()){
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}
0