oj.uz

Submission #735594

# Submission time Handle Problem Language Result Execution time Memory
735594 2023-05-04T11:33:33 Z Jeff12345121 Factories (JOI14_factories) C++14
0 / 100
 8000 ms 47012 KB 
#include <bits/stdc++.h>
#include "factories.h"
using namespace std;

typedef long long ll;
vector<vector<pair<int,int>>> g;
int n;

void Init(int N, int A[], int B[], int D[]) {
    n = N;
    g.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        g[A[i - 1]].push_back({B[i - 1] , D[i - 1]});
        g[B[i - 1]].push_back({A[i - 1], D[i - 1]});
    }
}

const ll inf = (1LL << 60);
ll get_dis(int u, int v) {
    vector<ll> dis(n + 1,-1);
    function<void(int)> dfs = [&](int node) {
        for (auto k : g[node]) {
            if (dis[k.first] == -1) {
                dis[k.first] = dis[node] + k.second;
                dfs(k.first);
            }
        }  
    };

    dis[u] = 0;
    dfs(u);
    return dis[v];
}
long long Query(int S, int X[], int T, int Y[]) {
    ll sol = inf;
    for (int i = 1; i <= S; i++) {
        for (int j = 1; j <= T; j++) {
            sol = min(sol , get_dis(X[i - 1] , Y[j - 1]));
        }
    }
    return sol;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6627 ms 924 KB Output is correct
2 Execution timed out 8096 ms 18076 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 340 KB Output is correct
2 Execution timed out 8082 ms 47012 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 6627 ms 924 KB Output is correct
2 Execution timed out 8096 ms 18076 KB Time limit exceeded
3 Halted 0 ms 0 KB -