結果
問題 | No.1190 Points |
ユーザー | Series_205 |
提出日時 | 2020-08-22 14:31:43 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 62 ms / 2,000 ms |
コード長 | 3,984 bytes |
コンパイル時間 | 2,162 ms |
コンパイル使用メモリ | 211,280 KB |
実行使用メモリ | 10,796 KB |
最終ジャッジ日時 | 2023-08-05 11:42:46 |
合計ジャッジ時間 | 4,966 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
7,476 KB |
testcase_01 | AC | 4 ms
7,356 KB |
testcase_02 | AC | 5 ms
7,344 KB |
testcase_03 | AC | 38 ms
9,724 KB |
testcase_04 | AC | 33 ms
9,468 KB |
testcase_05 | AC | 34 ms
9,208 KB |
testcase_06 | AC | 45 ms
10,248 KB |
testcase_07 | AC | 55 ms
10,540 KB |
testcase_08 | AC | 56 ms
10,796 KB |
testcase_09 | AC | 54 ms
10,480 KB |
testcase_10 | AC | 56 ms
10,796 KB |
testcase_11 | AC | 43 ms
9,528 KB |
testcase_12 | AC | 57 ms
10,628 KB |
testcase_13 | AC | 40 ms
9,124 KB |
testcase_14 | AC | 14 ms
8,388 KB |
testcase_15 | AC | 60 ms
10,380 KB |
testcase_16 | AC | 10 ms
7,832 KB |
testcase_17 | AC | 54 ms
10,372 KB |
testcase_18 | AC | 31 ms
8,880 KB |
testcase_19 | AC | 10 ms
8,176 KB |
testcase_20 | AC | 37 ms
9,152 KB |
testcase_21 | AC | 18 ms
8,752 KB |
testcase_22 | AC | 19 ms
9,132 KB |
testcase_23 | AC | 60 ms
10,624 KB |
testcase_24 | AC | 62 ms
10,504 KB |
testcase_25 | AC | 47 ms
10,340 KB |
testcase_26 | AC | 36 ms
10,120 KB |
testcase_27 | AC | 45 ms
10,332 KB |
ソースコード
#include <bits/stdc++.h> #define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++) #define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--) #define rep(i, n) FOR(i, 0, n) #define ALL(x) begin(x), end(x) using namespace std; using ll = long long; constexpr ll Mod = 998244353; constexpr ll mod = 1e9 + 7; constexpr ll inf = 1LL << 60; const double PI = acos(-1); template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } /*-------------------------------------------*/ template <int M> class ModInt { int x; public: constexpr ModInt() : x(0) {} constexpr ModInt(int64_t y) : x(y >= 0 ? y % M : (M - (-y) % M) % M) {} constexpr ModInt &operator+=(const ModInt p) { if((x += p.x) >= M) x -= M; return *this; } constexpr ModInt &operator-=(const ModInt p) { if((x += M - p.x) >= M) x -= M; return *this; } constexpr ModInt &operator*=(const ModInt p) { x = (int)(1LL * x * p.x % M); return *this; } constexpr ModInt &operator/=(const ModInt p) { *this *= p.inverse(); return *this; } constexpr ModInt operator-() const { return ModInt(-x); } constexpr ModInt operator+(const ModInt p) const { return ModInt(*this) += p; } constexpr ModInt operator-(const ModInt p) const { return ModInt(*this) -= p; } constexpr ModInt operator*(const ModInt p) const { return ModInt(*this) *= p; } constexpr ModInt operator/(const ModInt p) const { return ModInt(*this) /= p; } constexpr bool operator==(const ModInt p) const { return x == p.x; } constexpr bool operator!=(const ModInt p) const { return x != p.x; } constexpr ModInt inverse() const { int a = x, b = M, u = 1, v = 0, t = 0; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } constexpr ModInt pow(int64_t k) const { ModInt ret(1), mul(x); while(k > 0) { if(k & 1) ret *= mul; mul *= mul; k >>= 1; } return ret; } constexpr friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } constexpr friend istream &operator>>(istream &is, ModInt &a) { int64_t t = 0; is >> t; a = ModInt(t); return (is); } }; using mint = ModInt<Mod>; int n, m, k, s, g; int d[100009][2], d2[100009][2]; vector<int> G[100009]; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cin >> n >> m >> k; cin >> s >> g; s--; g--; rep(i, m) { int a, b; cin >> a >> b; a--; b--; G[a].push_back(b); G[b].push_back(a); } memset(d, 63, sizeof(d)); d[s][0] = 0; queue<pair<int, int>> que; que.emplace(s, 0); while(!que.empty()) { auto [v, t] = que.front(); que.pop(); for(int u : G[v]) if(d[u][!t] > 1e9) { d[u][!t] = d[v][t] + 1; que.emplace(u, !t); } } memset(d2, 63, sizeof(d2)); d2[g][0] = 0; que.emplace(g, 0); while(!que.empty()) { auto [v, t] = que.front(); que.pop(); for(int u : G[v]) if(d2[u][!t] > 1e9) { d2[u][!t] = d2[v][t] + 1; que.emplace(u, !t); } } vector<int> ans; rep(i, n) { bool flag = false; rep(x, 2) rep(y, 2) if(d[i][x] + d2[i][y] <= k && (x ^ y) == (k & 1)) flag = true; if(flag) ans.push_back(i); } if(ans.empty()) { cout << -1 << endl; return 0; } sort(ALL(ans)); cout << ans.size() << endl; rep(i, ans.size()) cout << ans[i] + 1 << "\n"; return 0; }