oj.uz

Submission #473017

# Submission time Handle Problem Language Result Execution time Memory
473017 2021-09-14T18:15:11 Z ljuba Factories (JOI14_factories) C++17
15 / 100
 4795 ms 524292 KB 
#include "factories.h"
#include <bits/stdc++.h>

using namespace std;

const int mxN = 5e5 + 12;

typedef long long ll;

vector<pair<int, ll>> adj[mxN];
bool vis[mxN];
int sub[mxN];

//plasim se da ce biti sporo :/

int dfsSize(int s, int p = -1) {
    sub[s] = 1;
    for(auto b : adj[s]) {
        int e = b.first;
        if(e == p || vis[e])
            continue;
        dfsSize(e, s);
        sub[s] += sub[e];
    }
    return sub[s];
}

int centroid(int s, int p, int n) {
    for(auto b : adj[s]) {
        int e = b.first;
        if(e == p || vis[e])
            continue;

        if(2*sub[e] > n)
            return centroid(e, s, n);
    }

    return s;
}

unordered_map<int, ll> dist[mxN];

void dfs(int s, int p, int c) {
    ll vrednost = -1;
    for(auto b : adj[s]) {
        int e = b.first;
        if(e == p) {
            vrednost = b.second;
            break;
        }
    }
    if(vrednost == -1) {
        dist[c][s] = 0;
    } else {
        dist[c][s] = dist[c][p] + vrednost;
    }
    for(auto b : adj[s]) {
        int e = b.first;
        if(e == p || vis[e])
            continue;
        dfs(e, s, c);
    }
}

int iznad[mxN];

void build(int s, int p = -1) {
    int n = dfsSize(s);
    int c = centroid(s, -1, n);

    int vel = 31 - __builtin_clz(n);
    dist[c].reserve(1<<vel);
    dist[c].max_load_factor(0.6);

    dfs(c, -1, c);
    iznad[c] = p;
    vis[c] = true;

    for(auto b : adj[c]) {
        int e = b.first;
        if(vis[e])
            continue;
        build(e, c);
    }
}

ll mini[mxN];

void Init(int N, int A[], int B[], int D[]) {
    for(int i = 0; i < N-1; ++i) {
        int u = A[i], v = B[i];
        ll w = D[i];
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }

    build(0);

    //for(int i = 0; i < N; ++i) {
        //vector<pair<int, ll>> temp;
        //for(auto z : dist[i]) {
            //temp.push_back(z);
        //}
        //cout << i << ":";
        //for(auto z : temp)
            //cout << " {" << z.first << ", " << z.second << "}";
        //cout << endl;
    //}

    for(int i = 0; i < N; ++i)
        mini[i] = LLONG_MAX;
}

long long Query(int S, int X[], int T, int Y[]) {
    //drzi za prve, za druge samo proveri
    ll ans = LLONG_MAX;
    for(int i = 0; i < S; ++i) {
        int trenutni = X[i];
        int iteriraj = trenutni;
        while(iteriraj != -1) {
            mini[iteriraj] = min(mini[iteriraj], dist[iteriraj][trenutni]);
            iteriraj = iznad[iteriraj];
        }
    }

    for(int i = 0; i < T; ++i) {
        int trenutni = Y[i];
        int iteriraj = trenutni;
        while(iteriraj != -1) {
            if(mini[iteriraj] != LLONG_MAX) {
                ans = min(ans, mini[iteriraj] + dist[iteriraj][trenutni]);
            }
            iteriraj = iznad[iteriraj];
        }
    }

    for(int i = 0; i < S; ++i) {
        int iteriraj = X[i];
        while(iteriraj != -1) {
            mini[iteriraj] = LLONG_MAX;
            iteriraj = iznad[iteriraj];
        }
    }

    return ans;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 39960 KB Output is correct
2 Correct 756 ms 50148 KB Output is correct
3 Correct 880 ms 50728 KB Output is correct
4 Correct 768 ms 50580 KB Output is correct
5 Correct 1061 ms 51272 KB Output is correct
6 Correct 331 ms 49004 KB Output is correct
7 Correct 849 ms 50536 KB Output is correct
8 Correct 870 ms 50692 KB Output is correct
9 Correct 1058 ms 51380 KB Output is correct
10 Correct 329 ms 48972 KB Output is correct
11 Correct 850 ms 50884 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 39748 KB Output is correct
2 Correct 4795 ms 405800 KB Output is correct
3 Runtime error 3687 ms 524292 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 39960 KB Output is correct
2 Correct 756 ms 50148 KB Output is correct
3 Correct 880 ms 50728 KB Output is correct
4 Correct 768 ms 50580 KB Output is correct
5 Correct 1061 ms 51272 KB Output is correct
6 Correct 331 ms 49004 KB Output is correct
7 Correct 849 ms 50536 KB Output is correct
8 Correct 870 ms 50692 KB Output is correct
9 Correct 1058 ms 51380 KB Output is correct
10 Correct 329 ms 48972 KB Output is correct
11 Correct 850 ms 50884 KB Output is correct
12 Correct 26 ms 39748 KB Output is correct
13 Correct 4795 ms 405800 KB Output is correct
14 Runtime error 3687 ms 524292 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -