# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976297 | saayan007 | Factories (JOI14_factories) | C++17 | 2510 ms | 37460 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;
const char nl = '\n';
using ll = long long;
#warning checkconstanst as per subtask
const int mxN = 5e3L + 10;
vector<pair<int, ll>> adj[mxN];
int n;
/* void Init(int N, int A[], int B[], int D[]) { */
void Init(signed N, signed A[], signed B[], signed D[]) {
n = N;
for(int i = 0; i < N - 1; ++i) {
adj[A[i]].emplace_back(B[i], ll(D[i]));
adj[B[i]].emplace_back(A[i], ll(D[i]));
}
}
long long Query(signed S, signed X[], signed T, signed Y[]) {
ll dist[n];
for(int i = 0; i < n; ++i) dist[i] = -1;
priority_queue<pair<ll, int>> pq;
for(int i = 0; i < S; ++i) {
dist[X[i]] = 0;
pq.emplace(0, X[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |