結果

問題 No.2674 k-Walk on Bipartite
ユーザー XelmephXelmeph
提出日時 2024-03-09 10:46:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 69 ms / 2,000 ms
コード長 5,372 bytes
コンパイル時間 1,739 ms
コンパイル使用メモリ 146,368 KB
実行使用メモリ 13,688 KB
最終ジャッジ日時 2024-09-29 23:00:51
合計ジャッジ時間 3,796 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 40 ms
11,864 KB
testcase_08 AC 49 ms
10,108 KB
testcase_09 AC 36 ms
11,904 KB
testcase_10 AC 64 ms
11,520 KB
testcase_11 AC 41 ms
9,984 KB
testcase_12 AC 64 ms
10,240 KB
testcase_13 AC 36 ms
10,752 KB
testcase_14 AC 10 ms
8,192 KB
testcase_15 AC 68 ms
12,288 KB
testcase_16 AC 46 ms
12,416 KB
testcase_17 AC 47 ms
9,728 KB
testcase_18 AC 20 ms
8,544 KB
testcase_19 AC 40 ms
11,392 KB
testcase_20 AC 35 ms
11,648 KB
testcase_21 AC 52 ms
10,624 KB
testcase_22 AC 69 ms
13,688 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 2 ms
5,248 KB
testcase_26 AC 2 ms
5,248 KB
testcase_27 AC 1 ms
5,248 KB
testcase_28 AC 2 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
testcase_30 AC 2 ms
5,248 KB
testcase_31 AC 2 ms
5,248 KB
testcase_32 AC 2 ms
5,248 KB
testcase_33 AC 2 ms
5,248 KB
testcase_34 AC 1 ms
5,248 KB
testcase_35 AC 1 ms
5,248 KB
testcase_36 AC 1 ms
5,248 KB
testcase_37 AC 2 ms
5,248 KB
testcase_38 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;

namespace utils{
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
    ///----- aliases
    using ll = long long int;
    using ull = unsigned long long;

    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> inline bool CHMIN(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> inline bool CHMAX(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }

    ///----- vector I/O
    template<class T>
    vector<T> VEC(size_t n, T t){
        return vector<T>(n, t);
    }

    template<class ...Ts>
    auto VEC(size_t n, Ts ... ts){
        return vector<decltype(VEC(ts...))>(n, VEC(ts...));
    }


    template<class T>
    istream& operator>>(istream& is, vector<T>& v){
        for (auto &&x : v) { is >> x; } return is;
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<T>& v){
        auto p = v.begin();
        assert(p != v.end());
        os << *p++;
        while(p != v.end()){
            os << ' ' << *p++;
        }
        return os ;
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<vector<T>>& v){
        auto p = v.begin();
        assert(p != v.end());
        os << *p++;
        while(p != v.end()){
            os << '\n' << *p++;
        }
        return os;
    }

    ///----- tuple I/O
    template <class S, class T>
    istream& operator>>(istream& is, tuple<S, T>& t){
        return is >> get<0>(t) >> get<1>(t);
    }

    template <class S, class T>
    istream& operator>>(istream& is, pair<S, T>& t){
        return is >> get<0>(t) >> get<1>(t);
    }

    template <class S, class T, class U>
    istream& operator>>(istream& is, tuple<S, T, U>& t){
        return is >> get<0>(t) >> get<1>(t) >> get<2>(t);
    }

    template <class S, class T>
    ostream& operator<<(ostream& os, const tuple<S, T>& t){
        return os << get<0>(t) << ' ' <<  get<1>(t);
    }

    template <class S, class T>
    ostream& operator<<(ostream& os, const pair<S, T>& t){
        return os << get<0>(t) << ' ' <<  get<1>(t);
    }

    template <class S, class T, class U>
    ostream& operator<<(ostream& os, const tuple<S, T, U>& t){
        return os << get<0>(t) << ' ' <<  get<1>(t) << ' ' <<  get<2>(t);
    }

    ///----- constants
    constexpr ll INFLL   = 1'000'000'000'000'000'020ll;
    constexpr ll INF     = 1'000'000'009;
    constexpr double PI      = 3.14'159'265'358'979'323'846;
    constexpr double EPS     = 1e-12;
}
using namespace utils;


class solver{
    istream& is;
    ostream& os;

public:
    solver(istream& I, ostream& O) :is(I), os(O) {}
    int N, M;
    int s, t, k;
    vector<vector<int>> F;

    bool input() {
        N = M = 0;
        is >> N >> M;
        is >> s >> t >> k;
        s--; t--;
        F.resize(N);
        for (int i = 0; i < M; ++i) {
            int a, b;
            is >> a >> b;
            a--; b--;
            F[a].push_back(b);
            F[b].push_back(a);
        } // end i

        return !!is;
    }


    void run();
};

void solver::run(){
    if(!input()) return;
    if(k < 1){
        assert(1);
    }
    if(N==1){
        os << "No\n";
        return;
    }
    if(s == t){
        if(k%2 == 1){
            os << "No\n";
        }
        else if(F[s].empty()){
            os << "Unknown\n";
        }
        else os << "Yes\n";
        return;
    }

    vector<int> d(N, -1);

    queue<int> qv;
    qv.push(s);
    d[s] = 0;

    while(!qv.empty()){
        int vi = qv.front();
        qv.pop();
        for (auto &&u: F[vi]) {
            if(d[u] == -1 or (s == u and d[u] == 0)){
                qv.push(u);
                d[u] = d[vi] + 1;
            }
        } // end u
    }

    // not connected
    if(d[t] == -1){
        if(N==2){
            // s != t
            if(k % 2 != 1){
                os << "No\n";
                return;
            }
        }
        os << "Unknown\n";

        return;
    }

    if((k % 2) != (d[t] % 2)){
        os << "No\n";
        return;
    }

    else if(d[t] <= k){
        os << "Yes\n";
        return;
    }

    os << "Unknown\n";
}

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef XELMH
    string test_cases = "test_c.txt";
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int loop = 0;
    while(fs) {
        loop++;
        cout << '#' << loop << "#------\n";
        solver(fs, cout).run();
    }
    if(loop <= 1) {
        cout << "===" << endl;
        while(cin) solver(cin, cout).run();
    }
#else
    solver(cin, cout).run();
#endif
    return 0;
}
0