Submission #1095013

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095013		hqminhuwu	Training (IOI07_training)	C++14	30 / 100	10 ms	12380 KiB

training

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <int,pii> piii;

#define forr(_a,_b,_c) for(int _a = (_b); _a <= int (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> int (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < int (_c); ++_a)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

template<class X, class Y>
    bool minz(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        } return false;
    }
template<class X, class Y>
    bool maxz(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        } return false;
    }

const int N = 5e5 + 5;
const ll oo = (ll) 1e16;
const ll mod = 1e9 + 7; // 998244353;

ll dp[N], dep[N], n, u, v, w, deg[N], m;
vector <pll> a[N];

void dfs (int u, int p){
    dp[u] = dp[p];
    dep[u] = dep[p] + 1;

    for (pll e : a[u]){
        ll v = e.st, w = e.nd;
        
        if (dep[v] && (dep[u] - dep[v]) & 1 && w){
            continue;
        }
        
        if (w && dep[v]){
            maxz(dp[u], dp[v] + w);
        }
    }   

    for (pll e : a[u])
    if (e.st != p && !e.nd)
        dfs(e.st, u);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef hqm
        freopen(file".inp", "r", stdin); freopen(file".out", "w", stdout);
    #endif

    cin >> n >> m;;

    ll sum = 0;

    forr (i, 1, m){
        cin >> u >> v >> w;
        
        a[u].pb(mp(v, w));
        a[v].pb(mp(u, w));

        sum += w;
    
        if (w == 0)
            deg[u]++, deg[v]++;
    }

    forr (i, 1, n)
    if (deg[i] == 1){
        dfs(i, 0);
        forr (j, i + 1, n)
        if (deg[j] == 1)
            cout << sum - dp[j] << "\n";
        return 0;
    }

    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