제출 #1294499

#제출 시각아이디문제언어결과실행 시간메모리
1294499nathlol2Election Campaign (JOI15_election_campaign)C++20
10 / 100
49 ms3100 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int n, m, dp[N]; vector<pair<int, int>> g[N]; signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for(int i = 0;i<n - 1;i++){ int _, __; cin >> _ >> __; } cin >> m; for(int i = 0;i<m;i++){ int l, r, w; cin >> l >> r >> w; g[max(l, r)].push_back({min(l, r), w}); } for(int i = 1;i<=n;i++){ dp[i] = dp[i - 1]; for(auto [v, w] : g[i]){ dp[i] = max(dp[i], dp[v - 1] + w); } } cout << *max_element(dp, dp + N); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...