結果

問題 No.2630 Colorful Vertices and Cheapest Paths
ユーザー miscalcmiscalc
提出日時 2024-02-16 22:16:41
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,179 ms / 2,500 ms
コード長 3,518 bytes
コンパイル時間 4,147 ms
コンパイル使用メモリ 271,580 KB
実行使用メモリ 84,532 KB
最終ジャッジ日時 2024-09-28 20:53:00
合計ジャッジ時間 20,470 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
template <class T, internal::is_static_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_static_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
//*/
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

int main()
{
  ll N, M;
  cin >> N >> M;
  vector<pll> AB(M);
  for (ll i = 0; i < M; i++)
  {
    ll a, b;
    cin >> a >> b;
    a--, b--;
    AB.at(i) = {a, b};
  }
  vector<ll> C(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> C.at(i);
    C.at(i)--;
  }
  vector<ll> W(10);
  for (ll i = 0; i < 10; i++)
  {
    cin >> W.at(i);
  }

  vector<vector<ll>> gids(1 << 10, vector<ll>(N));
  vector<ll> cost(1 << 10, 0);
  for (ll b = 0; b < (1 << 10); b++)
  {
    for (ll i = 0; i < 10; i++)
    {
      if (b & (1 << i))
        cost.at(b) += W.at(i);
    }

    dsu ds(N);
    for (auto [u, v] : AB)
    {
      if ((b & (1 << C.at(u))) && (b & (1 << C.at(v))))
        ds.merge(u, v);
    }
    auto gs = ds.groups();
    for (ll k = 0; k < (ll)gs.size(); k++)
    {
      for (auto v : gs.at(k))
      {
        gids.at(b).at(v) = k;
      }
    }
  }

  ll Q;
  cin >> Q;
  while (Q--)
  {
    ll u, v;
    cin >> u >> v;
    u--, v--;
    ll ans = INF;
    for (ll b = 0; b < (1 << 10); b++)
    {
      if (gids.at(b).at(u) == gids.at(b).at(v))
        chmin(ans, cost.at(b));
    }
    cout << (ans == INF ? -1 : ans) << "\n";
  }
}
0