| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1294498 | nathlol2 | Election Campaign (JOI15_election_campaign) | C++20 | 32 ms | 2740 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++){
for(auto [v, w] : g[i]){
dp[i] = max(dp[i], dp[v - 1] + w);
}
}
cout << *max_element(dp, dp + N);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
