제출 #994575

#제출 시각아이디문제언어결과실행 시간메모리
994575hmm789Jobs (BOI24_jobs)C++14
0 / 100
608 ms1048576 KiB
#include <bits/stdc++.h> using namespace std; #define int long long vector<int> adj[300001]; int a[300001]; deque<int> v[300001]; int mn[300001], sm[300001]; void dfs(int x, int p) { v[x].push_back(a[x]); sm[x] = mn[x] = a[x]; vector<tuple<int, int, deque<int>>> vec; for(int i : adj[x]) if(i != p) { dfs(i, x); vec.push_back({-mn[i], sm[i], v[i]}); } sort(vec.begin(), vec.end()); for(auto [m, s, v2] : vec) { m = -m; if(v[x].size() < v2.size()) { swap(v[x], v2); while(v2.size()) { v[x].push_front(v2.back()); v2.pop_back(); } } else { while(v2.size()) { v[x].push_back(v2.front()); v2.pop_front(); } } mn[x] = min(mn[x], sm[x]+m); sm[x] += s; } if(sm[x] < 0) { v[x].clear(); sm[x] = mn[x] = 0; } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, s, x, ans = 0, cur = 0; cin >> n >> s; a[0] = s; for(int i = 1; i <= n; i++) { cin >> a[i] >> x; adj[x].push_back(i); } dfs(0, -1); for(int i : v[0]) { cur += i; if(cur < 0) break; ans = max(ans, cur); } cout << ans-s; }

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

Main.cpp: In function 'void dfs(long long int, long long int)':
Main.cpp:20:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   20 |  for(auto [m, s, v2] : vec) {
      |           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...