oj.uz

답안 #905857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
905857 2024-01-13T05:17:46 Z vjudge1 Transport (COCI19_transport) C++17
0 / 130
 212 ms 15788 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define pb push_back

#define TASKNAME "NAME"

void init()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///freopen(TASKNAME".INP","r",stdin); freopen(TASKNAME".OUT","w",stdout);
}

const int SZ = 1e5+5;
const ll INF = INT_MAX / 2, MOD = 1e9+7, INFLL = 2e18;
const double epsilon = 1e-3;

struct Edge
{
    int v;
    ll w;
    Edge(int _v = 0, ll _w = 0) : v(_v), w(_w) {}
};

int n, s[SZ];
bool deleted[SZ];
ll a[SZ], res = 0;
vector<Edge> adj[SZ];

void dfsSize(int u, int p)
{
    s[u] = 1;
    for(Edge e : adj[u])
    {
        int v = e.v;
        if(v == p || deleted[v]) continue;
        dfsSize(v, u);
        s[u] += s[v];
    }
}

int centroid(int u, int p, int treeSize)
{
    for(Edge e : adj[u])
    {
        int v = e.v;
        if(deleted[v] || v == p) continue;
        if(s[v] > treeSize / 2) return centroid(v, u, treeSize);
    }
    return u;
}

vector<ll> v1, v2, v3, v4;

void dfs(int u, int p, ll x, ll y, ll mn)
{
    v1.pb(max(0LL,-x));
    if(x >= 0) res++;
    if(mn >= 0)
    {
        v2.pb(y);
        //cout << u << " - " << y << '\n';
        res++;
    }
    for(Edge e : adj[u])
    {
        int v = e.v;
        ll w = e.w;
        if(deleted[v] || v == p) continue;
        dfs(v, u, x + a[u] - w, y + a[v] - w, min(a[v] - w, mn + a[v] - w));
    }
}

void updateRes(int root)
{
    v3.clear();
    v4.clear();
    for(Edge e : adj[root])
    {
        int v = e.v;
        ll w = e.w;
        if(deleted[v]) continue;
        dfs(v, root, a[root] - w, a[v] - w, min(0LL, a[v] - w));
        sort(all(v1));
        sort(all(v2));
        for(ll x : v2)
        {
            int pos = upper_bound(all(v1), x) - v1.begin() - 1;
            res -= (pos + 1);
        }
        while(!v1.empty())
        {
            v3.pb(v1.back());
            v1.pop_back();
        }
        while(!v2.empty())
        {
            v4.pb(v2.back());
            v2.pop_back();
        }
    }
    sort(all(v3));
    sort(all(v4));
//    if(root == 5)
//    {
//        for(ll x : v4)
//        {
//            cout << x << " ";
//        }
//        cout << '\n';
//        for(ll x : v3)
//        {
//            cout << x << " ";
//        }
//        cout << '\n';
//    }
    for(ll x : v4)
    {
        int pos = upper_bound(all(v3), x) - v3.begin() - 1;
        res += (pos + 1);
    }
}

void solve(int u)
{
    dfsSize(u, 0);
    int root = centroid(u, 0, s[u]);
    deleted[root] = true;
    ll preres = res;
    updateRes(root);
    //cout << root << " " << res-preres << '\n';
    for(Edge e : adj[root])
    {
        int v = e.v;
        if(deleted[v]) continue;
        solve(v);
    }
}

int main()
{
    init();
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for(int i = 1; i < n; i++)
    {
        int u,v;
        ll w;
        cin >> u >> v >> w;
        adj[u].pb({v,w});
        adj[v].pb({u,w});
    }
    solve(1);
    cout << res;
}

Compilation message

transport.cpp: In function 'void solve(int)':
transport.cpp:137:8: warning: unused variable 'preres' [-Wunused-variable]
  137 |     ll preres = res;
      |        ^~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 3232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 59 ms 9672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 69 ms 11880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 114 ms 15788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 5080 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 6716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 94 ms 7748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 133 ms 9672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 212 ms 11476 KB Output isn't correct
2 Halted 0 ms 0 KB -