# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976269 | saayan007 | Factories (JOI14_factories) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "factories.h"
#include "bits/stdc++.h"
using namespace std;
#warning using32bitint
#define int long long
typedef long long ll;
typedef pair<int, int> pi;
#define rep(i, a, b) for(int (i) = (a); i <= (b); ++i)
#define repd(i, a, b) for(int (i) = (a); i >= (b); --i)
#define em emplace
#define eb emplace_back
#define fr first
#define sc second
#define mp make_pair
const char nl = '\n';
#warning checkconstanst as per subtask
const int mxN = 5e5L + 10;
vector<pair<int, ll>> adj[mxN];
bool spec[mxN];
ll dist[mxN];
queue<int> q;
int n;
void Init(int N, int A[], int B[], int D[]) {
n = N;
rep(i, 0, N - 2) {
adj[A[i]].eb(B[i], D[i]);
adj[B[i]].eb(A[i], D[i]);
}
rep(i, 0, N - 1) {
spec[i] = 0;
dist[i] = -1;
}
}
long long Query(int S, int X[], int T, int Y[]) {
rep(i, 0, S - 1) spec[X[i]] = 1;
/* for(int x : X) spec[x] = 1; */
/* for(int y : Y) { */
rep(i, 0, T - 1) {
dist[Y[i]] = 0;
q.push(Y[i]);
}
while(!q.empty()) {
int a = q.front();
q.pop();
for(auto tmp : adj[a]) {
int b = tmp.fr; ll w = tmp.sc;
if(dist[b] != -1) continue;
dist[b] = dist[a] + w;
q.push(b);
}
}
ll res = mxN;
rep(i, 0, S - 1) {
if(dist[X[i]] != -1 && dist[X[i]] < res) res = dist[X[i]];
}
rep(i, 0, n - 1) dist[i] = -1;
rep(i, 0, S - 1) spec[X[i]] = 0;
return res;
}