Submission #988425

#	Time	Username	Problem	Language	Result	Execution time	Memory
988425		huutuan	Training (IOI07_training)	C++14	30 / 100	2 ms	604 KiB

training

#include<bits/stdc++.h>

using namespace std;

const int N=1010, M=5010;

int n, m, cnt, deg[N], dep[N], f[N];
vector<int> g[N];
vector<pair<int, int>> vv[N];
pair<pair<int, int>, int> edge[M];

void dfs(int u, int p){
   dep[u]=dep[p]+1;
   for (int v:g[u]) if (v!=p) dfs(v, u);
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> m;
   int ans=0;
   for (int i=1; i<=m; ++i){
      int u, v, w; cin >> u >> v >> w;
      if (w) edge[++cnt]={{u, v}, w}, ans+=w;
      else g[u].push_back(v), g[v].push_back(u), ++deg[u], ++deg[v];
   }
   int u=find(deg+1, deg+n+1, 1)-deg;
   dfs(u, 0);
   for (int i=1; i<=cnt; ++i) if ((dep[edge[i].first.first]&1)==(dep[edge[i].first.second]&1)){
      int l=min(dep[edge[i].first.first], dep[edge[i].first.second]);
      int r=max(dep[edge[i].first.first], dep[edge[i].first.second])-1;
      vv[r].emplace_back(l, edge[i].second);
   }
   f[0]=0;
   for (int i=1; i<=n; ++i){
      f[i]=max(f[i], f[i-1]);
      for (auto &j:vv[i]){
         f[i]=max(f[i], f[j.first-1]+j.second);
      }
   }
   cout << ans-f[n] << '\n';
   return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 7
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9