#194666 (C++11) No.408 五輪ピック

提出ソース

結果

問題	No.408 五輪ピック
ユーザー	はむこ
提出日時	2017-08-09 02:58:35
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	218 ms / 5,000 ms
コード長	6,678 bytes
コンパイル時間	1,832 ms
コンパイル使用メモリ	184,940 KB
実行使用メモリ	17,976 KB
最終ジャッジ日時	2024-10-12 00:28:56
合計ジャッジ時間	4,321 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	1 ms 6,816 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	2 ms 6,820 KB
testcase_05	AC	94 ms 11,948 KB
testcase_06	AC	25 ms 8,632 KB
testcase_07	AC	37 ms 10,144 KB
testcase_08	AC	36 ms 8,776 KB
testcase_09	AC	30 ms 8,988 KB
testcase_10	AC	24 ms 8,196 KB
testcase_11	AC	23 ms 8,124 KB
testcase_12	AC	45 ms 10,820 KB
testcase_13	AC	75 ms 11,604 KB
testcase_14	AC	9 ms 6,816 KB
testcase_15	AC	159 ms 13,700 KB
testcase_16	AC	70 ms 11,732 KB
testcase_17	AC	60 ms 11,828 KB
testcase_18	AC	53 ms 12,080 KB
testcase_19	AC	51 ms 12,468 KB
testcase_20	AC	14 ms 6,816 KB
testcase_21	AC	7 ms 6,816 KB
testcase_22	AC	20 ms 7,900 KB
testcase_23	AC	78 ms 17,976 KB
testcase_24	AC	47 ms 13,516 KB
testcase_25	AC	181 ms 14,376 KB
testcase_26	AC	60 ms 13,152 KB
testcase_27	AC	218 ms 14,252 KB
testcase_28	AC	30 ms 9,784 KB
testcase_29	AC	31 ms 9,788 KB
testcase_30	AC	2 ms 6,816 KB
testcase_31	AC	1 ms 6,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;

#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
#define ZERO(a) memset(a,0,sizeof(a))
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
#define exists find_if
#define forall all_of

using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double;  using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using Pos = complex<double>;

template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U, typename V>  ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
string bits_to_string(ll input, ll n=64) { string s; rep(i, n) s += '0' + !!(input & (1ll << i)); reverse(all(s)); return s; }

template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
struct ci : public iterator<forward_iterator_tag, ll> { ll n; ci(const ll n) : n(n) { } bool operator==(const ci& x) { return n == x.n; } bool operator!=(const ci& x) { return !(*this == x); } ci &operator++() { n++; return *this; } ll operator*() const { return n; } };

size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
namespace myhash{ const int Bsizes[]={3,9,13,17,21,25,29,33,37,41,45,49,53,57,61,65,69,73,77,81}; const int xor_nums[]={0x100007d1,0x5ff049c9,0x14560859,0x07087fef,0x3e277d49,0x4dba1f17,0x709c5988,0x05904258,0x1aa71872,0x238819b3,0x7b002bb7,0x1cf91302,0x0012290a,0x1083576b,0x76473e49,0x3d86295b,0x20536814,0x08634f4d,0x115405e8,0x0e6359f2}; const int hash_key=xor_nums[rand()%20]; const int mod_key=xor_nums[rand()%20]; template <typename T> struct myhash{ std::size_t operator()(const T& val) const { return (hash<T>{}(val)%mod_key)^hash_key; } }; };
template <typename T> class uset:public std::unordered_set<T,myhash::myhash<T>> { using SET=std::unordered_set<T,myhash::myhash<T>>; public: uset():SET(){SET::rehash(myhash::Bsizes[rand()%20]);} };
template <typename T,typename U> class umap:public std::unordered_map<T,U,myhash::myhash<T>> { public: using MAP=std::unordered_map<T,U,myhash::myhash<T>>; umap():MAP(){MAP::rehash(myhash::Bsizes[rand()%20]);} };    

struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ gettimeofday(&start, NULL); ios::sync_with_stdio(false); cin.tie(0); srand((unsigned int)time(NULL)); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;

static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;
#define ldout fixed << setprecision(40) 

int main(void) {
    ll n, m; cin >> n >> m;
    vll a(m), b(m);
    vvll g(n);
    unordered_set<P> edges;
    rep(i, m) {
        cin >> a[i] >> b[i]; a[i]--, b[i]--;
        g[a[i]].pb(b[i]);
        g[b[i]].pb(a[i]);
        edges.insert(P(a[i], b[i]));
        edges.insert(P(b[i], a[i]));
    }
    vector<P> list;
    for (auto u : g[0]) for (auto v : g[u]) if (v && u && u != v) list.pb(P(u, v));

    vector<unordered_set<ll>> memo(n);
    for (auto x : list) {
        memo[x.se].insert(x.fi);
    }

    rep(i, m) {
        if (edges.count(P(a[i], b[i])) == 0) continue;
        bool erased_a = 0, erased_b = 0;
        if (memo[a[i]].count(b[i])) {
            memo[a[i]].erase(b[i]);
            erased_a = 1;
        }
        if (memo[b[i]].count(a[i])) {
            memo[b[i]].erase(a[i]);
            erased_b = 1;
        }
        bool f = 0;
        ll as = memo[a[i]].size(), bs = memo[b[i]].size();
        f |= (as != 0 && bs != 0 && (as > 1 || bs > 1));
        f |= (as == 1 && bs == 1 && *memo[a[i]].begin() != *memo[b[i]].begin());
        if (erased_a) 
            memo[a[i]].insert(b[i]);
        if (erased_b) 
            memo[b[i]].insert(a[i]);

        if (f) {
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;

    return 0;
}

yukicoder

結果

テストケース

ソースコード