# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
888057 | 2023-12-15T21:05:08 Z | Macker | Training (IOI07_training) | C++17 | 3 ms | 604 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define all(v) v.begin(), v.end() int main() { int n, m; cin >> n >> m; vector<vector<pair<int, int>>> adj(n); vector<vector<pair<int, int>>> v(n); vector<int> idx(n, -1); int res = 0; for (int i = 0; i < m; i++) { int a, b, c; cin >> a >> b >> c; a--; b--; adj[a].push_back({c, b}); adj[b].push_back({c, a}); } int s; for (int i = 0; i < n; i++) { sort(all(adj[i])); if(adj[i].size() == 1 || adj[i][1].first != 0) s = i; } int par = s; for (int i = 0; i < n; i++) { idx[s] = i; for (auto &&j : adj[s]) { if(j.first != 0 && idx[j.second] != -1){ if((i - idx[j.second]) % 2 == 1) res += j.first; else v[i].push_back({j.first, idx[j.second]}); } } if(par != adj[s][0].second){ par = s; s = adj[s][0].second; } else{ par = s; s = adj[s][1].second; } } vector<int> dp(n); dp[0] = res; for (int i = 1; i < n; i++) { int sm = 0; for (int j = 0; j < v[i].size(); j++) { sm += v[i][j].first; } dp[i] = dp[i - 1] + sm; for (int j = 0; j < v[i].size(); j++) { int cur = sm - v[i][j].first + dp[v[i][j].second - 1]; for (int k = v[i][j].second + 1; k < i; k++) { for (auto &&l : v[k]) cur += l.first; } dp[i] = min(dp[i], cur); } } cout << dp[n - 1] << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 604 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |