結果
問題 |
No.3222 Let the World Forget Me
|
ユーザー |
![]() |
提出日時 | 2025-08-02 18:17:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 136 ms / 2,000 ms |
コード長 | 1,590 bytes |
コンパイル時間 | 1,026 ms |
コンパイル使用メモリ | 75,008 KB |
実行使用メモリ | 18,944 KB |
最終ジャッジ日時 | 2025-08-02 18:17:05 |
合計ジャッジ時間 | 5,049 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 31 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:39:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 39 | scanf("%d%d", &n, &m); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:40:36: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 40 | for (int i = 0; i < n; i++) scanf("%d", ps + i); | ~~~~~^~~~~~~~~~~~~~ main.cpp:43:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 43 | scanf("%d%d", &u, &v); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:48:36: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 48 | for (int i = 0; i < m; i++) scanf("%d", cs + i), cs[i]--; | ~~~~~^~~~~~~~~~~~~~
ソースコード
/* -*- coding: utf-8 -*- * * 3222.cc: No.3222 Let the World Forget Me - yukicoder */ #include<cstdio> #include<vector> #include<set> #include<queue> #include<algorithm> #include<utility> using namespace std; /* constant */ const int MAX_N = 100000; /* typedef */ using ll = long long; using vi = vector<int>; using si = set<int>; using qi = queue<int>; using pii = pair<int,int>; /* global variables */ int ps[MAX_N], cs[MAX_N]; si nbrs[MAX_N]; int ds[MAX_N]; /* subroutines */ /* main */ int main() { int n, m; scanf("%d%d", &n, &m); for (int i = 0; i < n; i++) scanf("%d", ps + i); for (int i = 1; i < n; i++) { int u, v; scanf("%d%d", &u, &v); u--, v--; nbrs[u].insert(v); nbrs[v].insert(u); } for (int i = 0; i < m; i++) scanf("%d", cs + i), cs[i]--; fill(ds, ds + n, -1); qi q; for (int i = 0; i < m; i++) ds[cs[i]] = 0, q.push(cs[i]); while (! q.empty()) { int u = q.front(); q.pop(); for (auto v: nbrs[u]) if (ds[v] < 0) ds[v] = ds[u] + 1, q.push(v); } //for (int i = 0; i < n; i++) printf(" %d", ds[i]); putchar('\n'); priority_queue<pii> pq; for (int u = 0; u < n; u++) if (ds[u] > 0 && nbrs[u].size() == 1) pq.push({ps[u], u}); ll sum = 0; for (int d = 0; ! pq.empty(); d++) { while (! pq.empty() && ds[pq.top().second] <= d) pq.pop(); if (pq.empty()) break; auto [p, u] = pq.top(); pq.pop(); sum += p; int up = *(nbrs[u].begin()); nbrs[up].erase(u); if (ds[up] > d && nbrs[up].size() == 1) pq.push({ps[up], up}); } printf("%lld\n", sum); return 0; }