結果

問題 No.2948 move move rotti
ユーザー dyktr_06dyktr_06
提出日時 2024-10-25 23:45:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 6,558 bytes
コンパイル時間 4,583 ms
コンパイル使用メモリ 266,116 KB
実行使用メモリ 26,244 KB
最終ジャッジ日時 2024-10-25 23:46:21
合計ジャッジ時間 25,493 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,656 KB
testcase_01 AC 4 ms
11,624 KB
testcase_02 AC 3 ms
9,832 KB
testcase_03 AC 919 ms
8,252 KB
testcase_04 RE -
testcase_05 RE -
testcase_06 AC 5 ms
17,916 KB
testcase_07 AC 1,043 ms
8,720 KB
testcase_08 AC 1,061 ms
10,260 KB
testcase_09 AC 946 ms
10,264 KB
testcase_10 AC 4 ms
13,804 KB
testcase_11 AC 4 ms
13,804 KB
testcase_12 WA -
testcase_13 AC 1,128 ms
10,904 KB
testcase_14 AC 1,049 ms
7,992 KB
testcase_15 AC 913 ms
10,132 KB
testcase_16 WA -
testcase_17 AC 929 ms
10,244 KB
testcase_18 AC 1,097 ms
10,808 KB
testcase_19 WA -
testcase_20 AC 1,225 ms
11,016 KB
testcase_21 AC 1,096 ms
10,104 KB
testcase_22 AC 1,115 ms
8,716 KB
testcase_23 AC 1,079 ms
8,184 KB
testcase_24 AC 1,270 ms
11,340 KB
testcase_25 AC 1,299 ms
7,076 KB
testcase_26 AC 8 ms
19,956 KB
testcase_27 RE -
testcase_28 AC 31 ms
24,064 KB
testcase_29 RE -
testcase_30 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template <typename T>
long long binary_search(long long ok, long long ng, T check){
    while(abs(ok - ng) > 1){
        long long mid = (ok + ng) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

template <typename T>
long double binary_search_real(long double ok, long double ng, T check, int iter = 100){
    for(int i = 0; i < iter; ++i){
        long double mid = (ok + ng) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

template <typename T>
long long trisum(T a, T b){
    long long res = ((b - a + 1) * (a + b)) / 2;
    return res;
}

template <typename T>
T intpow(T x, int n){
    T ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}

template <typename T>
T getReminder(T a, T b){
    if(b == 0) return -1;
    if(a >= 0 && b > 0){
        return a % b;
    } else if(a < 0 && b > 0){
        return ((a % b) + b) % b;
    } else if(a >= 0 && b < 0){
        return a % b;
    } else{
        return (abs(b) - abs(a % b)) % b;
    }
}

template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>> &G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll T;

void input(){
    in(T);
}

bool dp[15][1 << 15][15][15];

void solve(){
    ll n, m, K; in(n, m, K);
    vll x(K); in(x);
    ll xbit = 0;
    rep(i, K){
        x[i]--;
        xbit |= 1 << x[i];
    }
    vector<vll> G(n);
    rep(i, n){
        ll a, b; in(a, b);
        a--, b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    rep(i, n){
        dp[i][1 << i][i][0] = 1;
        rep(k, n - 1){
            rep(bit, 1 << n){
                rep(j, n){
                    if(!(bit & (1 << j))) continue;
                    for(auto nx : G[j]){
                        if(bit & (1 << nx)) continue;
                        chmax(dp[i][bit | (1 << nx)][nx][k + 1], dp[i][bit][j][k]);
                    }
                }
            }
        }
    }
    string ans = "No";
    rep(i, n){
        rep(k, n){
            ll is_ok = 1;
            rep(j, n){
                if(!(xbit & (1 << j))) continue;
                ll res = 0;
                rep(bit, 1 << n){
                    chmax(res, (ll) dp[j][bit][i][k]);
                }
                chmin(is_ok, res);
            }
            if(is_ok){
                ans = "Yes";
                break;
            }
        }
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    T = 1;
    // input();
    while(T--) solve();
}
0