#1166871 (C++23) No.3561 Collect KCPC

• 問題: No.3561 Collect KCPC
• ユーザー: KumaTachiRen
• 提出日時: 2026-05-26 22:54:22
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 289 ms / 6,000 ms
• コード長: 7,438 bytes
• コンパイル時間: 3,563 ms
• コンパイル使用メモリ: 359,428 KB
• 実行使用メモリ: 21,148 KB
• 最終ジャッジ日時: 2026-05-29 18:45:54
• 合計ジャッジ時間: 10,505 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge1_1

サブタスク	配点	結果
部分点1	10 %	AC * 15
部分点2	20 %	AC * 15
部分点3	20 %	AC * 13
部分点4	50 %	AC * 51
合計	100 点

ソースコード

#line 2 "library/template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#line 2 "library/template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "library/template/template.hpp"

#line 2 "library/template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <class T, class S = T>
S SUM(const vector<T>& a) {
  return accumulate(ALL(a), S(0));
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <class T>
int popcnt(T x) {
  return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
  return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
  return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "library/template/template.hpp"

#line 2 "library/template/inout.hpp"
struct Fast {
  Fast() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} fast;

ostream& operator<<(ostream& os, __uint128_t x) {
  char buf[40];
  size_t k = 0;
  while (x > 0) buf[k++] = (char)(x % 10 + '0'), x /= 10;
  if (k == 0) buf[k++] = '0';
  while (k) os << buf[--k];
  return os;
}
ostream& operator<<(ostream& os, __int128_t x) {
  return x < 0 ? (os << '-' << (__uint128_t)(-x)) : (os << (__uint128_t)x);
}
template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
  for (auto& v : a) is >> v;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
  for (auto it = a.begin(); it != a.end();) {
    os << *it;
    if (++it != a.end()) os << " ";
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
  os << "{";
  for (auto it = st.begin(); it != st.end();) {
    os << *it;
    if (++it != st.end()) os << ",";
  }
  os << "}";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
  os << "{";
  for (auto it = mp.begin(); it != mp.end();) {
    os << it->first << ":" << it->second;
    if (++it != mp.end()) os << ",";
  }
  os << "}";
  return os;
}

void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

namespace IO {
namespace Graph {
vector<vector<int>> unweighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    u -= offset, v -= offset;
    g[u].push_back(v);
    if (!directed) g[v].push_back(u);
  }
  return g;
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, int m, bool directed = false, int offset = 1) {
  vector<vector<pair<int, T>>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    T w;
    cin >> u >> v >> w;
    u -= offset, v -= offset;
    g[u].push_back({v, w});
    if (!directed) g[v].push_back({u, w});
  }
  return g;
}
}  // namespace Graph
namespace Tree {
vector<vector<int>> unweighted(int n, bool directed = false, int offset = 1) {
  return Graph::unweighted(n, n - 1, directed, offset);
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, bool directed = false, int offset = 1) {
  return Graph::weighted<T>(n, n - 1, directed, offset);
}
vector<vector<int>> rooted(int n, bool to_root = true, bool to_leaf = true, int offset = 1) {
  vector<vector<int>> g(n);
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    p -= offset;
    if (to_root) g[i].push_back(p);
    if (to_leaf) g[p].push_back(i);
  }
  return g;
}
}  // namespace Tree
}  // namespace IO
#line 10 "library/template/template.hpp"

#line 2 "library/template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int i, T name) {
  cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
  for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
  cerr << ":" << b << " ";
  _show(i + 1, a, c...);
}
#line 2 "main.cpp"

void solve() {
  int n, m;
  in(n, m);
  vector g(n, vector<pair<int, ll>>());
  rep(i, 0, m) {
    int u, v, c;
    in(u, v, c);
    g[u - 1].push_back({v - 1, c});
  }
  string s;
  in(s);

  // 0 -> K -> x -> P -> y

  const ll INF = 1e18;
  vector<ll> d0(n, INF);  // 0 -> K -> x
  {
    auto calc_dist = [&](vector<ll>& d) {
      priority_queue<pair<ll, int>> pq;
      rep(i, 0, n) pq.push({-d[i], i});
      while (!pq.empty()) {
        auto [_xd, x] = pq.top();
        pq.pop();
        if (-_xd > d[x]) continue;
        for (auto [y, c] : g[x])
          if (chmin(d[y], d[x] + c)) pq.push({-d[y], y});
      }
    };

    d0[0] = 0;
    calc_dist(d0);
    rep(i, 0, n) if (s[i] != 'K') d0[i] = INF;
    calc_dist(d0);
    rep(i, 0, n) if (s[i] != 'C') d0[i] = INF;
  }

  // top-2
  using P = pair<ll, int>;
  vector<P> d1(n, {INF, -1}), d2(n, {INF, -1});
  {
    auto calc_dist = [&](vector<P>& d1, vector<P>& d2) {
      priority_queue<pair<ll, pair<int, int>>> pq;
      rep(i, 0, n) {
        pq.push({-d1[i].first, {d1[i].second, i}});
        pq.push({-d2[i].first, {d2[i].second, i}});
      }
      while (!pq.empty()) {
        auto [_xd, px] = pq.top();
        pq.pop();
        auto [p, x] = px;
        P _d{-_xd, p};
        if (_d != d1[x] && _d != d2[x]) continue;
        for (auto [y, c] : g[x]) {
          ll nd = -_xd + c;
          if (nd < d1[y].first) {
            if (d1[y].second != d2[y].second) d2[y] = d1[y];
            d1[y] = {nd, p};
            pq.push({-nd, {p, y}});
          } else if (nd < d2[y].first) {
            if (d1[y].second != p) {
              d2[y] = {nd, p};
              pq.push({-nd, {p, y}});
            }
          }
        }
      }
    };

    rep(i, 0, n) d1[i] = {d0[i], i};
    calc_dist(d1, d2);
    rep(i, 0, n) if (s[i] != 'P') d1[i] = d2[i] = {INF, -1};
    calc_dist(d1, d2);
    rep(i, 0, n) if (s[i] != 'C') d1[i] = d2[i] = {INF, -1};
  }

  ll ans = INF;
  rep(i, 0, n) {
    if (s[i] != 'C') continue;
    if (d1[i].second != i) chmin(ans, d1[i].first);
    if (d2[i].second != i) chmin(ans, d2[i].first);
  }
  if (ans >= INF) ans = -1;
  out(ans);
}

int main() {
  int t = 1;
  // in(t);
  while (t--) solve();
}