結果
問題 | No.1190 Points |
ユーザー | haruki_K |
提出日時 | 2020-08-22 14:57:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 6,805 bytes |
コンパイル時間 | 2,295 ms |
コンパイル使用メモリ | 217,168 KB |
実行使用メモリ | 19,940 KB |
最終ジャッジ日時 | 2024-10-15 09:15:49 |
合計ジャッジ時間 | 5,622 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 63 ms
15,104 KB |
testcase_04 | AC | 59 ms
14,080 KB |
testcase_05 | AC | 48 ms
12,696 KB |
testcase_06 | AC | 85 ms
18,696 KB |
testcase_07 | AC | 107 ms
19,592 KB |
testcase_08 | AC | 90 ms
18,808 KB |
testcase_09 | AC | 96 ms
18,144 KB |
testcase_10 | AC | 94 ms
18,800 KB |
testcase_11 | AC | 63 ms
14,464 KB |
testcase_12 | AC | 90 ms
18,688 KB |
testcase_13 | AC | 60 ms
12,896 KB |
testcase_14 | AC | 18 ms
9,472 KB |
testcase_15 | AC | 115 ms
19,420 KB |
testcase_16 | AC | 10 ms
6,820 KB |
testcase_17 | AC | 93 ms
18,300 KB |
testcase_18 | AC | 47 ms
9,728 KB |
testcase_19 | AC | 13 ms
10,196 KB |
testcase_20 | AC | 58 ms
11,648 KB |
testcase_21 | AC | 21 ms
8,704 KB |
testcase_22 | AC | 29 ms
12,356 KB |
testcase_23 | AC | 113 ms
19,940 KB |
testcase_24 | AC | 115 ms
19,852 KB |
testcase_25 | AC | 70 ms
15,844 KB |
testcase_26 | AC | 64 ms
15,860 KB |
testcase_27 | AC | 60 ms
15,796 KB |
ソースコード
// >>> TEMPLATES #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1; auto constexpr INF32 = inf<int32_t>; auto constexpr INF64 = inf<int64_t>; auto constexpr INF = inf<int>; #ifdef LOCAL #include "debug.hpp" #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template <class T> using pque_max = priority_queue<T>; template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >; template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; } template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; } template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template <class F> struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward<F>(f)) {} template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); } }; struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template <class T, size_t d> struct vec_impl { using type = vector<typename vec_impl<T,d-1>::type>; template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); } }; template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } }; template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type; template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); } template <class T> void quit(T const& x) { cout << x << endl; exit(0); } template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); } template <class T> int sz(T const& x) { return x.size(); } template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(v.begin(), v.end(), x)-v.begin(); } template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(v.begin(), v.end(), x)-v.begin(); } const int dx[] = { 1,0,-1,0 }; const int dy[] = { 0,1,0,-1 }; constexpr int popcnt(ll x) { return __builtin_popcountll(x); } template <class Int> struct Random { mt19937_64 mt{random_device{}()}; //mt19937_64 mt{(unsigned)time(0)}; Int a,b; // [a,b] Random(Int a, Int b) : a(a), b(b) {} Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); } }; template <class Int> Int rand(Int a, Int b) { // [a,b] static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); } // <<< // >>> union find struct UnionFind { int n, sz; // id : 0...n-1 vector<int> par; UnionFind(int n = 0) : n(n), sz(n), par(n,-1) { } int root(int x) { assert(0 <= x); assert(x < n); return par[x] < 0 ? x : par[x] = root(par[x]); } bool unite(int x, int y) { x = root(x), y = root(y); if (x == y) return false; sz--; if (par[x] < par[y]) swap(x,y); par[y] += par[x]; par[x] = y; return true; } bool same(int x, int y) { return root(x) == root(y); } int size(int x) { return -par[root(x)]; } int size() const { return sz; } struct groups_t { vector<vector<int> > grp; vector<pair<int,int> > id; }; groups_t groups() { vector<vector<int> > g(n); rep (i,n) if (par[i] < 0) g[i].reserve(-par[i]); rep (i,n) g[root(i)].push_back(i); vector<vector<int> > grp; grp.reserve(size()); rep (i,n) if (g[i].size()) grp.emplace_back(move(g[i])); vector<pair<int,int> > id(n); rep (i,grp.size()) rep (j,grp[i].size()) { id[grp[i][j]] = make_pair(i,j); } return { grp, id }; } }; // <<< // >>> bfs constexpr int dst(int v) { return v; } template <class E, class = decltype(E().to)> constexpr int dst(E const& e) { return e.to; } template <class E> vector<int> bfs(vector<vector<E>> const& g, int s, int inf) { vector<int> d(g.size(),inf); queue<int> q; d[s] = 0; q.push(s); while (q.size()) { int x = q.front(); q.pop(); for (auto const& e : g[x]) { const int y = dst(e); if (chmin(d[y], d[x]+1)) q.push(y); } } return d; } // <<< int32_t main() { int n,m,p; cin >> n >> m >> p; int s,t; cin >> s >> t; --s,--t; vector<vector<int>> g(2*n); auto id = [&](int pa, int x) { return x*2+pa; }; UnionFind uf(n); rep (i,m) { int x,y; cin >> x >> y; --x,--y; rep (pa,2) { g[id(pa,x)].eb(id(pa^1,y)); g[id(pa,y)].eb(id(pa^1,x)); } uf.unite(x,y); } if (not uf.same(s,t)) quit(-1); auto ds = bfs(g,id(0,s),INF); auto dt = bfs(g,id(0,t),INF); if (ds[id(p&1,t)] > p) quit(-1); vector<int> ok(n); rep (x,n) { rep (i,2) rep (j,2) if ((i^j) == (p&1)) { if (ds[id(i,x)] + dt[id(j,x)] <= p) { ok[x] = 1; } } } int k = count(all(ok),1); cout << k << endl; rep (x,n) if (ok[x]) cout << x+1 << "\n"; }