結果

問題 No.408 五輪ピック
ユーザー fumiphysfumiphys
提出日時 2019-08-01 23:41:55
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 22 ms / 5,000 ms
コード長 3,951 bytes
コンパイル時間 1,581 ms
コンパイル使用メモリ 169,764 KB
実行使用メモリ 5,856 KB
最終ジャッジ日時 2023-09-18 18:07:08
合計ジャッジ時間 2,978 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,436 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,392 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 11 ms
4,900 KB
testcase_06 AC 9 ms
4,996 KB
testcase_07 AC 12 ms
5,252 KB
testcase_08 AC 9 ms
4,968 KB
testcase_09 AC 10 ms
5,108 KB
testcase_10 AC 9 ms
4,864 KB
testcase_11 AC 8 ms
5,004 KB
testcase_12 AC 14 ms
5,108 KB
testcase_13 AC 11 ms
5,092 KB
testcase_14 AC 5 ms
4,588 KB
testcase_15 AC 11 ms
5,112 KB
testcase_16 AC 12 ms
4,916 KB
testcase_17 AC 12 ms
5,160 KB
testcase_18 AC 14 ms
5,104 KB
testcase_19 AC 15 ms
5,200 KB
testcase_20 AC 5 ms
4,828 KB
testcase_21 AC 4 ms
4,580 KB
testcase_22 AC 8 ms
5,048 KB
testcase_23 AC 19 ms
5,856 KB
testcase_24 AC 13 ms
5,616 KB
testcase_25 AC 12 ms
5,424 KB
testcase_26 AC 17 ms
5,492 KB
testcase_27 AC 16 ms
5,468 KB
testcase_28 AC 13 ms
4,840 KB
testcase_29 AC 22 ms
4,892 KB
testcase_30 AC 2 ms
4,384 KB
testcase_31 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#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 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
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// 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};

// solve
vector<int> edge[20010];
vector<int> te[20010];
bool con[20010];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); INT(m);
  vector<P> e(m);
  rep(i, m){
    INT(a); INT(b); a--; b--;
    e[i] = mk(a, b);
    edge[a].pb(b);
    edge[b].pb(a);
  }
  rep(i, sz(edge[0])){
    con[edge[0][i]] = true;
  }
  rep(i, n){
    rep(j, sz(edge[i])){
      if(con[edge[i][j]]){
        te[i].pb(edge[i][j]);
      }
    }
  }
  rep(i, m){
    if(e[i].FI == 0 || e[i].SE == 0)continue;
    rep(j, sz(te[e[i].FI])){
      rep(k, sz(te[e[i].SE])){
        int u = te[e[i].FI][j];
        int v = te[e[i].SE][k];
        if(u == v || e[i].FI == v || e[i].SE == u)continue;
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
0