제출 #395101

#제출 시각아이디문제언어결과실행 시간메모리
395101osaaateiasavtnlFireworks (APIO16_fireworks)C++14
100 / 100
232 ms41448 KiB
#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <ctime> #include <cassert> #include <complex> #include <string> #include <cstring> #include <chrono> #include <random> #include <bitset> #include <fstream> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #define debug(x) std::cerr << #x << ": " << x << '\n'; #define FOR(i, n) for (int i = 0; i < n; ++i) #define FORN(i, n) for (int i = 1; i <= n; ++i) #define pb push_back #define trav(a, x) for (auto& a : x) using vi = vector<int>; template <typename T> std::istream& operator >>(std::istream& input, std::vector<T>& data) { for (T& x : data) input >> x; return input; } template <typename T> std::ostream& operator <<(std::ostream& output, const pair <T, T> & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template <typename T> std::ostream& operator <<(std::ostream& output, const std::vector<T>& data) { for (const T& x : data) output << x << " "; return output; } ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down ll math_mod(ll a, ll b) { return a - b * div_down(a, b); } #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT> void re(V<T>& x) { trav(a, x) cin >> a; } tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ll gcd(ll a, ll b) { while (b) { tie(a, b) = mp(b, a % b); } return a; } const int N = 3e5+7; int n, m; int par[N], cost[N]; priority_queue <int> dp[N]; int children[N]; signed main() { #ifdef LOCAL #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif cin >> n >> m; int ans = 0; for (int i = 2; i <= n + m; ++i) { cin >> par[i] >> cost[i]; children[par[i]]++; ans += cost[i]; } for (int u = n + m; u >= 2; --u) { if (children[u]) { FOR (i, children[u] - 1) { dp[u].pop(); } int r = dp[u].top(); dp[u].pop(); int l = dp[u].top(); dp[u].pop(); dp[u].push(l + cost[u]); dp[u].push(r + cost[u]); } else { dp[u].push(cost[u]); dp[u].push(cost[u]); } if (dp[u].size() > dp[par[u]].size()) { swap(dp[u], dp[par[u]]); } while (dp[u].size()) { dp[par[u]].push(dp[u].top()); dp[u].pop(); } } FOR (i, children[1]) { dp[1].pop(); } int l = dp[1].top(); while (dp[1].size()) { ans -= dp[1].top(); dp[1].pop(); } cout << ans << endl; }

컴파일 시 표준 에러 (stderr) 메시지

fireworks.cpp: In function 'int main()':
fireworks.cpp:123:9: warning: unused variable 'l' [-Wunused-variable]
  123 |     int l = dp[1].top();
      |         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...