結果

問題 No.1190 Points
ユーザー uchiiiiuchiiii
提出日時 2020-09-01 20:26:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 287 ms / 2,000 ms
コード長 4,898 bytes
コンパイル時間 3,627 ms
コンパイル使用メモリ 231,196 KB
実行使用メモリ 17,304 KB
最終ジャッジ日時 2024-11-20 15:56:20
合計ジャッジ時間 8,205 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
7,988 KB
testcase_01 AC 6 ms
8,152 KB
testcase_02 AC 7 ms
8,020 KB
testcase_03 AC 107 ms
14,672 KB
testcase_04 AC 92 ms
13,708 KB
testcase_05 AC 87 ms
13,432 KB
testcase_06 AC 143 ms
16,128 KB
testcase_07 AC 159 ms
17,024 KB
testcase_08 AC 151 ms
16,352 KB
testcase_09 AC 159 ms
16,560 KB
testcase_10 AC 159 ms
16,352 KB
testcase_11 AC 126 ms
14,352 KB
testcase_12 AC 157 ms
16,464 KB
testcase_13 AC 129 ms
14,056 KB
testcase_14 AC 28 ms
11,304 KB
testcase_15 AC 211 ms
17,132 KB
testcase_16 AC 21 ms
9,484 KB
testcase_17 AC 182 ms
16,304 KB
testcase_18 AC 111 ms
14,040 KB
testcase_19 AC 20 ms
10,972 KB
testcase_20 AC 124 ms
14,760 KB
testcase_21 AC 40 ms
11,480 KB
testcase_22 AC 47 ms
13,312 KB
testcase_23 AC 287 ms
17,192 KB
testcase_24 AC 219 ms
17,304 KB
testcase_25 AC 149 ms
17,000 KB
testcase_26 AC 93 ms
16,476 KB
testcase_27 AC 150 ms
17,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1};
constexpr int INF=1<<30;
constexpr ll LINF=1LL<<60; 
constexpr ll mod=1e9+7;
template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF)));
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << '\n'; for (auto v : vec) os << v << ' '; os << '\n'; return os;}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
struct MyIO {
    MyIO(){
        cin.tie(0); 
        ios::sync_with_stdio(false); 
        cout << fixed << setprecision(15);
    }
} IO_OI;
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
//-------------------
struct edge {
    int to;
    int cost;
    edge(int to, int c): to(to), cost(c) {}
};

constexpr int MX = 2e5+5;
vector<edge> G[MX];

vector<int> dijkstra(int s, int n) {
    vector<int> d(n, INF);
    priority_queue<PII, vector<PII>, greater<PII> > que;
    que.push({0, s});

    while (!que.empty()) {
        PII p = que.top();
        debug(p);
        que.pop();
        int v = p.second;
        if (d[v] <= p.first) continue;
        d[v] = p.first;
        for (auto e: G[v]) {
            if (d[e.to] > d[v] + e.cost) { // make code faster
                que.push({d[v] + e.cost, e.to});
            }
        }
    }
    return d;
}

int main() {
    int n,m,p; cin >> n >> m >> p;
    int s,g; cin >> s >> g;
    s--; g--;
    rep(i, m) {
        int u,v; cin >> u >> v; u--; v--;
        G[u].emplace_back(v+n, 1);
        G[v].emplace_back(u+n, 1);
        G[u+n].emplace_back(v, 1);
        G[v+n].emplace_back(u, 1);
    }

    auto d1 = dijkstra(s, 2*n);
    auto d2 = dijkstra(g, 2*n);
    debug(d1,d2);
    vector<int> ans;
    rep(i, n) {
        bool ok = false;
        if(p&1) {
            int sm = d1[i] + d2[i+n];
            if(d1[i]!=INF and d2[i+n]!=INF and sm <= p) ok = true;
            sm = d1[i+n] + d2[i];
            if(d1[i+n]!=INF and d2[i]!=INF and sm <= p) ok = true;
        } else {
            int sm = d1[i] + d2[i];
            if(d1[i]!=INF and d2[i]!=INF and sm <= p) ok = true;
            sm = d1[i+n] + d2[i+n];
            if(d1[i+n]!=INF and d2[i+n]!=INF and sm <= p) ok = true;
        }
        if(ok) ans.push_back(i);
    }

    if(ans.size()==0) {
        cout << -1 << endl;
    } else {
        cout << ans.size() << endl;
        for(auto x: ans) cout << x+1 << endl;
    }
    return 0;
}
0