#951376 (C++17) No.2630 Colorful Vertices and Cheapest Paths

• 問題: No.2630 Colorful Vertices and Cheapest Paths
• ユーザー: hotman78
• 提出日時: 2024-02-16 22:23:16
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 447 ms / 2,500 ms
• コード長: 10,720 bytes
• コンパイル時間: 3,550 ms
• コンパイル使用メモリ: 238,016 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-09-28 20:57:27
• 合計ジャッジ時間: 9,898 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	119 ms; 6,816 KB
testcase_01	AC	286 ms; 6,820 KB
testcase_02	AC	401 ms; 6,816 KB
testcase_03	AC	2 ms; 6,820 KB
testcase_04	AC	2 ms; 6,820 KB
testcase_05	AC	2 ms; 6,820 KB
testcase_06	AC	137 ms; 6,820 KB
testcase_07	AC	337 ms; 6,820 KB
testcase_08	AC	308 ms; 6,820 KB
testcase_09	AC	346 ms; 6,816 KB
testcase_10	AC	447 ms; 6,820 KB
testcase_11	AC	447 ms; 6,820 KB
testcase_12	AC	440 ms; 6,816 KB
testcase_13	AC	439 ms; 6,816 KB
testcase_14	AC	441 ms; 6,816 KB
testcase_15	AC	182 ms; 6,816 KB
testcase_16	AC	174 ms; 6,816 KB
testcase_17	AC	181 ms; 6,820 KB
testcase_18	AC	134 ms; 6,820 KB
testcase_19	AC	202 ms; 6,816 KB
testcase_20	AC	181 ms; 6,816 KB
testcase_21	AC	223 ms; 6,816 KB

ソースコード

// author: hotman78
// date: 2024/02/16-22:23:10

// --- begin raw code -----------------
// #include"cpplib/util/template.hpp"
// #include"cpplib/dsu/union_find.hpp"
// 
// void solve(){
//     lint n,m;
//     cin>>n>>m;
//     vector<vector<lint>>g(n);
//     rep(i,m){
//         lint s,t;
//         cin>>s>>t;
//         s--;t--;
//         g[s].emplace_back(t);
//         g[t].emplace_back(s);
//     }
//     vec c(n),w(10);
//     rep(i,n)cin>>c[i];
//     rep(i,n)c[i]--;
//     rep(i,10)cin>>w[i];
//     lint q;
//     cin>>q;
//     vector<pair<lint,lint>>query(q);
//     rep(i,q){
//         cin>>query[i].first>>query[i].second;
//         query[i].first--;
//         query[i].second--;
//     }
//     vec ans(q,INF);
//     rep(i,1<<10){
//         UF uf(n);
//         rep(j,n){
//             for(auto e:g[j]){
//                 if((i>>c[j]&1)&&(i>>c[e]&1)){
//                     uf.unite(j,e);
//                 }
//             }
//         }
//         lint res=0;
//         rep(j,10){
//             if(i>>j&1)res+=w[j];
//         }
//         rep(j,q){
//             auto [s,t]=query[j];
//             if((i>>c[s]&1)&&(i>>c[t]&1)&&uf.same(s,t)){
//                 chmin(ans[j],res);
//             }
//         }
//     }
//     rep(i,q){
//         if(ans[i]==INF)ans[i]=-1;
//         cout<<ans[i]<<endl;
//     }
// }
// 
// int main() {
//     solve();
// }

// --- end raw code -----------------

#line 2 "cpplib/util/template.hpp"
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#line 1 "cpplib/util/ioutil.hpp"
// template <class Head,class... Args>
// std::ostream& output(std::ostream& out,const Head& head,const Args&... args){
//     out>>head;
//     return output(head,args...);
// }
// template <class Head>
// std::ostream& output(std::ostream& out,const Head& head){
//     out>>head;
//     return out;
// }

template <typename T, typename E>
std::ostream &operator<<(std::ostream &out, std::pair<T, E> v) {
    out << "(" << v.first << "," << v.second << ")";
    return out;
}

// template <class... Args>
// ostream& operator<<(ostream& out,std::tuple<Args...>v){
//     std::apply(output,v);
//     return out;
// }
#line 11 "cpplib/util/template.hpp"
struct __INIT__ {
    __INIT__() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __INIT__;
typedef long long lint;
constexpr long long INF = 1LL << 60;
constexpr int IINF = 1 << 30;
constexpr double EPS = 1e-10;
#ifndef REACTIVE
#define endl '\n';
#endif
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
#define output(t)                                                              \
    {                                                                          \
        bool f = 0;                                                            \
        for (auto val : (t)) {                                                 \
            cout << (f ? " " : "") << val;                                     \
            f = 1;                                                             \
        }                                                                      \
        cout << endl;                                                          \
    }
#define output2(t)                                                             \
    {                                                                          \
        for (auto i : t)                                                       \
            output(i);                                                         \
    }
#define debug(t)                                                               \
    {                                                                          \
        bool f = 0;                                                            \
        for (auto i : t) {                                                     \
            cerr << (f ? " " : "") << i;                                       \
            f = 1;                                                             \
        }                                                                      \
        cerr << endl;                                                          \
    }
#define debug2(t)                                                              \
    {                                                                          \
        for (auto i : t)                                                       \
            debug(i);                                                          \
    }
#define loop(n) for (long long _ = 0; _ < (long long)(n); ++_)
#define _overload4(_1, _2, _3, _4, name, ...) name
#define __rep(i, a) repi(i, 0, a, 1)
#define _rep(i, a, b) repi(i, a, b, 1)
#define repi(i, a, b, c)                                                       \
    for (long long i = (long long)(a); i < (long long)(b); i += c)
#define rep(...) _overload4(__VA_ARGS__, repi, _rep, __rep)(__VA_ARGS__)
#define _overload3_rev(_1, _2, _3, name, ...) name
#define _rep_rev(i, a) repi_rev(i, 0, a)
#define repi_rev(i, a, b)                                                      \
    for (long long i = (long long)(b)-1; i >= (long long)(a); --i)
#define rrep(...) _overload3_rev(__VA_ARGS__, repi_rev, _rep_rev)(__VA_ARGS__)

#define all(n) begin(n), end(n)
template <typename T, typename E> bool chmin(T &s, const E &t) {
    bool res = s > t;
    s = min<T>(s, t);
    return res;
}
template <typename T, typename E> bool chmax(T &s, const E &t) {
    bool res = s < t;
    s = max<T>(s, t);
    return res;
}
const vector<lint> dx = {1, 0, -1, 0, 1, 1, -1, -1};
const vector<lint> dy = {0, 1, 0, -1, 1, -1, 1, -1};
#define SUM(v) accumulate(all(v), 0LL)
#if __cplusplus >= 201703L
template <typename T, typename... Args>
auto make_vector(T x, int arg, Args... args) {
    if constexpr (sizeof...(args) == 0)
        return vector<T>(arg, x);
    else
        return vector(arg, make_vector<T>(x, args...));
}
#endif
#define bit(n, a) ((n >> a) & 1)
#define extrep(v, ...) for (auto v : make_mat_impl({__VA_ARGS__}))
vector<vector<long long>> make_mat_impl(vector<long long> v) {
    if (v.empty())
        return vector<vector<long long>>(1, vector<long long>());
    long long n = v.back();
    v.pop_back();
    vector<vector<long long>> ret;
    vector<vector<long long>> tmp = make_mat_impl(v);
    for (auto e : tmp)
        for (long long i = 0; i < n; ++i) {
            ret.push_back(e);
            ret.back().push_back(i);
        }
    return ret;
}
using graph = vector<vector<int>>;
template <typename T> using graph_w = vector<vector<pair<int, T>>>;

#if __cplusplus >= 201703L
constexpr inline long long powll(long long a, long long b) {
    long long res = 1;
    while (b--)
        res *= a;
    return res;
}
#endif

template <typename T, typename E>
pair<T, E> &operator+=(pair<T, E> &s, const pair<T, E> &t) {
    s.first += t.first;
    s.second += t.second;
    return s;
}
template <typename T, typename E>
pair<T, E> &operator-=(pair<T, E> &s, const pair<T, E> &t) {
    s.first -= t.first;
    s.second -= t.second;
    return s;
}
template <typename T, typename E>
pair<T, E> operator+(const pair<T, E> &s, const pair<T, E> &t) {
    auto res = s;
    return res += t;
}
template <typename T, typename E>
pair<T, E> operator-(const pair<T, E> &s, const pair<T, E> &t) {
    auto res = s;
    return res -= t;
}
#define BEGIN_STACK_EXTEND(size)                                               \
    void *stack_extend_memory_ = malloc(size);                                 \
    void *stack_extend_origin_memory_;                                         \
    char *stack_extend_dummy_memory_ = (char *)alloca(                         \
        (1 + (int)(((long long)stack_extend_memory_) & 127)) * 16);            \
    *stack_extend_dummy_memory_ = 0;                                           \
    asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp"                          \
                 : "=b"(stack_extend_origin_memory_)                           \
                 : "a"((char *)stack_extend_memory_ + (size)-1024));
#define END_STACK_EXTEND                                                       \
    asm volatile("mov %%rax, %%rsp" ::"a"(stack_extend_origin_memory_));       \
    free(stack_extend_memory_);
int floor_pow(int n) { return n ? 31 - __builtin_clz(n) : 0; }
#line 1 "cpplib/dsu/union_find.hpp"
/**
 * @brief Union Find
 * @see
 * https://ja.wikipedia.org/wiki/%E7%B4%A0%E9%9B%86%E5%90%88%E3%83%87%E3%83%BC%E3%82%BF%E6%A7%8B%E9%80%A0
 */

class UF {
  public:
    vector<int> data;
    int sz;

  public:
    UF(int sz) : sz(sz) { data.resize(sz, -1); }
    bool unite(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y)
            return 0;
        if (data[x] > data[y])
            swap(x, y);
        data[x] += data[y];
        data[y] = x;
        sz--;
        return 1;
    }
    inline int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    inline bool same(int x, int y) { return root(x) == root(y); }
    inline int size() { return sz; }
    inline int size(int x) { return -data[root(x)]; }
};
#line 3 "main.cpp"

void solve() {
    lint n, m;
    cin >> n >> m;
    vector<vector<lint>> g(n);
    rep(i, m) {
        lint s, t;
        cin >> s >> t;
        s--;
        t--;
        g[s].emplace_back(t);
        g[t].emplace_back(s);
    }
    vec c(n), w(10);
    rep(i, n) cin >> c[i];
    rep(i, n) c[i]--;
    rep(i, 10) cin >> w[i];
    lint q;
    cin >> q;
    vector<pair<lint, lint>> query(q);
    rep(i, q) {
        cin >> query[i].first >> query[i].second;
        query[i].first--;
        query[i].second--;
    }
    vec ans(q, INF);
    rep(i, 1 << 10) {
        UF uf(n);
        rep(j, n) {
            for (auto e : g[j]) {
                if ((i >> c[j] & 1) && (i >> c[e] & 1)) {
                    uf.unite(j, e);
                }
            }
        }
        lint res = 0;
        rep(j, 10) {
            if (i >> j & 1)
                res += w[j];
        }
        rep(j, q) {
            auto [s, t] = query[j];
            if ((i >> c[s] & 1) && (i >> c[t] & 1) && uf.same(s, t)) {
                chmin(ans[j], res);
            }
        }
    }
    rep(i, q) {
        if (ans[i] == INF)
            ans[i] = -1;
        cout << ans[i] << endl;
    }
}

int main() { solve(); }