oj.uz

답안 #232501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232501 2020-05-17T08:21:16 Z kartel Transport (COCI19_transport) C++14
26 / 130
 1000 ms 9072 KB 
#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;

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

void dfs(ll v, ll cn, ll 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.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1664 KB Output is correct
2 Correct 14 ms 1792 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 1920 KB Output is correct
2 Correct 8 ms 1792 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1092 ms 5496 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 7668 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 21 ms 9072 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1093 ms 3320 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 4344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 7796 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 3776 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -