Submission #232500

#	Time	Username	Problem	Language	Result	Execution time	Memory
232500		kartel	Transport (COCI19_transport)	C++14	13 / 130	1089 ms	6132 KiB

Main

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +50050
//#define N1 +1001000
#define M ll(998244353)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int cnt[N], i, n, a, ans, u, v, cost;
vector <pair <int, int> > g[N];

void dfs(int v, int cn, int pr)
{
    if (cn < 0) return;

    if (pr != -1) ans++;
    cn += cnt[v];

    for (auto u : g[v])
    {
        if (u.F == pr) continue;
        dfs(u.F, cn - u.S, v);
    }
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> cnt[i];
    for (i = 1; i < n; i++)
    {
        cin >> u >> v >> cost;
        g[u].pb({v, cost});
        g[v].pb({u, cost});
    }


    for (a = 1; a <= n; a++)
        dfs(a, 0, -1);

    cout << ans;
}


//3 - 4
//4 - 5
//y < z + x < y + 2 * x

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