結果

問題 No.1190 Points
ユーザー hamrayhamray
提出日時 2020-11-21 06:24:09
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 214 ms / 2,000 ms
コード長 5,901 bytes
コンパイル時間 1,634 ms
コンパイル使用メモリ 179,352 KB
実行使用メモリ 20,104 KB
最終ジャッジ日時 2024-07-23 15:24:26
合計ジャッジ時間 6,056 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 107 ms
15,360 KB
testcase_04 AC 69 ms
13,952 KB
testcase_05 AC 112 ms
12,928 KB
testcase_06 AC 92 ms
18,560 KB
testcase_07 AC 167 ms
19,712 KB
testcase_08 AC 214 ms
20,104 KB
testcase_09 AC 197 ms
18,304 KB
testcase_10 AC 199 ms
19,948 KB
testcase_11 AC 126 ms
14,080 KB
testcase_12 AC 188 ms
19,584 KB
testcase_13 AC 111 ms
12,032 KB
testcase_14 AC 22 ms
13,312 KB
testcase_15 AC 190 ms
19,456 KB
testcase_16 AC 11 ms
6,940 KB
testcase_17 AC 177 ms
18,744 KB
testcase_18 AC 63 ms
7,680 KB
testcase_19 AC 25 ms
16,512 KB
testcase_20 AC 90 ms
9,984 KB
testcase_21 AC 25 ms
10,752 KB
testcase_22 AC 34 ms
17,152 KB
testcase_23 AC 201 ms
19,968 KB
testcase_24 AC 198 ms
19,916 KB
testcase_25 AC 81 ms
19,524 KB
testcase_26 AC 60 ms
19,200 KB
testcase_27 AC 73 ms
19,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).endf()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).endf())
#define SORT(c) sort((c).begin(), (c).endf())

//repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const double EPS = 1e-4, PI = acos(-1);
//ここから編集    
typedef string::const_iterator State;
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< 998244353 >;
template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(int k) const { return _fact[k]; }

  inline T rfact(int k) const { return _rfact[k]; }

  inline T inv(int k) const { return _inv[k]; }

  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }

  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);

    int N, M, P; cin >> N >> M >> P;
    int s, t; cin >> s >> t;
    s--; t--;
    vector<vector<int>> g(N);
    REP(i,M){
      int v, u; cin >> v >> u;
      v--; u--;
      g[v].push_back(u);
      g[u].push_back(v);
    }
    vector<vector<ll>> dist(N, vector<ll>(2, INT_MAX));
    vector<vector<ll>> dist2(N, vector<ll>(2, INT_MAX));
    
    {
      queue<pair<int, int>> q;
      q.push({s, 0});
      dist[s][0] = 0;
      while(q.size()){
        auto p = q.front();
        q.pop();
        int v;
        int parity;
        tie(v, parity) = p;
        for(auto u: g[v]){
          int nxt = (parity + 1)%2;
          if(dist[u][nxt] == INT_MAX){
            dist[u][nxt] = dist[v][parity] + 1;
            q.push(make_pair(u, nxt));
          }
        }
      }
    }
    {
      queue<pair<int, int>> q;
      q.push({t, 0});
      dist2[t][0] = 0;
      while(q.size()){
        auto p = q.front();
        q.pop();
        int v;
        int parity;
        tie(v, parity) = p;
        for(auto u: g[v]){
          int nxt = (parity + 1)%2;
          if(dist2[u][nxt] == INT_MAX){
            dist2[u][nxt] = dist2[v][parity] + 1;
            q.push(make_pair(u, nxt));
          }
        }
      }
    }
    if(dist[t][P%2] > P){
      cout << -1 << endl;
      return 0;
    }

    vector<int> ans;
    REP(i,N){
      if(P%2 == 0){
       
        if(dist[i][0] + dist2[i][0] <= P || dist[i][1] + dist2[i][1] <= P) ans.push_back(i+1);
      }else{ 
        if(dist[i][1] + dist2[i][0] <= P || dist[i][0] + dist2[i][1] <= P) ans.push_back(i+1);
      }
    }
    sort(all(ans));
    cout << ans.size() << endl;
    REP(i,ans.size()) cout << ans[i] << endl;
    return 0;
}
0