結果

問題 No.1190 Points
コンテスト
ユーザー soraie_
提出日時 2020-08-22 14:21:15
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,262 bytes
コンパイル時間 1,839 ms
コンパイル使用メモリ 185,452 KB
実行使用メモリ 34,812 KB
最終ジャッジ日時 2024-10-15 08:35:16
合計ジャッジ時間 4,298 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 13 WA * 12
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/*----------------------------------ここからマクロ----------------------------------*/
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(int i=0;i<n;++i)
#define rep2(i,n) for(int i=0;i<n;++i)
#define rep3(i,a,b) for(int i=a;i<b;++i)
#define rep4(i,a,b,c) for(int i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n) for(int i=n-1;i>=0;i--)
#define rrep3(i,a,b) for(int i=a;i>=b;i--)
#define rrep4(i,a,b,c) for(int i=a;i>=b;i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << "\n"
#define myset ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define doset(x) cout << fixed << setprecision(x)
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const dou pi = 3.14159265358;
//const ll mod = 1000000007LL;
const ll mod = 998244353LL;
typedef pair<ll,ll> P;
ostream &operator<<(ostream &os, const P q){os << q.first << "," << q.second;return os;}
template<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool change(T& a,U& b){if(a > b){swap(a,b);return 1;}return 0;}

//nのm乗をMODで割ったあまりO(logm)
ll modpow(ll n,ll m,ll MOD){
    if(m == 0)return 1;
    if(m < 0)return -1;
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n) % MOD;
        m >>= 1;
        n *= n;
        n %= MOD;
    }
    return res;
}

ll mypow(ll n,ll m){
    if(m == 0)return 1;
    if(m < 0)return -1;
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n);
        m >>= 1;
        n *= n;
    }
    return res;
}

//0の場合のアレンジに注意
template<class T>
T gcd(T a,T b){
    a = abs(a);b = abs(b);
    if(a == 0)return b;
    else if(b == 0)return a;
    if(a < b)swap(a,b);
    if(a % b == 0)return b;
    else return gcd(b,a%b);
}
template<class T>
T lcm(T a,T b){
    return a / gcd(a,b) * b;
}

//素数判定O(sqrt(N))
template<class T>
inline bool isp(T n){
    bool res = true;
    if(n == 1)return false;
    else{
        for(ll i = 2;i * i <= n;i++){
            if(n % i == 0){
                res = false;
                break;
            }
        }
        return res;
    }
}

const ll cmax = 1000000;
vector<ll> fac(cmax),finv(cmax),inv(cmax);

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < cmax; i++){
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod%i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

// 二項係数計算
ll nCk(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

template<class T = ll>
T in(){T x;cin >> x;return x;}

void Yes(bool b){cout << (b ? "Yes\n":"No\n");}
void YES(bool b){cout << (b ? "YES\n":"NO\n");}

/*----------------------------------マクロここまで----------------------------------*/


ll safe[1005];
bool query(ll n){
    if(safe[n] != -1)return safe[n];
    string s;
    cout << "? " << n << endl;
    cin >> s;
    return safe[n] = (s == "safe" ? 1:0);
}

int main(){
    myset;
    ll N,M,K,S,G;
    cin >> N >> M >> K >> S >> G;
    S--;G--;
    vector<vector<ll>> es(N);
    vector<ll> dist_start(N,INF),dist_goal(N,INF);
    ll a,b;
    rep(i,M){
        cin >> a >> b;
        a--;b--;
        es[a].push_back(b);
        es[b].push_back(a);
    }
    //BFS
    queue<ll> que;
    que.push(S);
    dist_start[S] = 0;
    while(!que.empty()){
        ll n = que.front();
        que.pop();
        for(auto x : es[n]){
            if(dist_start[x] == INF){
                que.push(x);
                dist_start[x] = dist_start[n] + 1;
            }
        }
    }
    que.push(G);
    dist_goal[G] = 0;
    while(!que.empty()){
        ll n = que.front();
        que.pop();
        for(auto x : es[n]){
            if(dist_goal[x] == INF){
                que.push(x);
                dist_goal[x] = dist_goal[n] + 1;
            }
        }
    }/*
    rep(i,N){
        cout << dist_start[i] << " ";
    }
    cout << "\n";
    rep(i,N){
        cout << dist_goal[i] << " ";
    }
    cout << "\n";*/
    if(dist_start[G] > K || (K - dist_start[G])&1){
        cout << "-1\n";
        return 0;
    }
    ll ans = 0;
    vector<ll> edge;
    rep(i,N){
        if(dist_start[i] + dist_goal[i] <= K && (K - dist_start[i] - dist_goal[i]) % 2 == 0){
            ans++;
            edge.push_back(i + 1);
        }
    }
    sort(all(edge));
    cout << ans << "\n";
    rep(i,ans){
        cout << edge[i] << "\n";
    }
}
0