oj.uz

Submission #287362

# Submission time Handle Problem Language Result Execution time Memory
287362 2020-08-31T16:28:34 Z limabeans Factories (JOI14_factories) C++17
0 / 100
 8000 ms 95812 KB 
#include "factories.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl




using ll = long long;
const ll inf = 1e18;

const ll mod = 1e9+7;
const int maxn = 1e6 + 10;

vector<pair<ll,int>> g[maxn];
const int LOG = 14;
int par[LOG+1][maxn];
ll wei[LOG+1][maxn];
int dep[maxn];
int n;

void dfs(int at, int p) {
    if (~p) {
	for (int j=1; j<LOG; j++) {
	    par[j][at] = par[j-1][par[j-1][at]];
	    wei[j][at] = wei[j-1][at] + wei[j-1][par[j-1][at]];
	}
    }
    for (auto ed: g[at]) {
	int to = ed.second;
	if (to == p) continue;
	par[0][to] = at;
	wei[0][to] = ed.first;
	dep[to] = 1+dep[at];
	dfs(to, at);
    }
}

int lca(int u, int v) {
    if (dep[u]<dep[v]) swap(u, v);
    int dx = dep[u]-dep[v];

    for (int j=0; j<LOG; j++) {
	if (dx>>j&1) {
	    u=par[j][u];
	}
    }
    
    if (u==v) return v;

    for (int j=LOG-1; j>=0; j--) {
	if (par[j][u] != par[j][v]) {
	    u=par[j][u];
	    v=par[j][v];
	}
    }
    return par[0][v];
}


ll walk(ll at, ll to) {
    if (dep[at] < dep[to]) {
	swap(at, to);
    }
    ll res = 0;
    for (int j=LOG-1; j>=0 && at!=to; j--) {
	int up = par[j][at];
	if (dep[up]>=dep[to]) {
	    res += wei[j][at];
	    at=up;
	}
    }
    return res;    
}

ll dist(int u, int v) {
    if (u==v) return 0;
    int mid = lca(u,v);
    return walk(u,mid)+walk(v,mid);
}


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

    //dfs(0, -1);
}


ll dp[maxn];

long long Query(int S, int X[], int T, int Y[]) {
    
    for (int i=0; i<n; i++) {
	dp[i] = inf;
    }
    for (int i=0; i<S; i++) {
	dp[X[i]] = 0;
    }
    set<pair<ll,int>> st;
    for (int i=0; i<n; i++) {
	st.insert({dp[i], i});
    }

    set<int> dest;
    for (int i=0; i<T; i++) {
	dest.insert(Y[i]);
    }

    while (st.size()) {
	auto cur = *st.begin();
	st.erase(st.begin());
	int at = cur.second;
	if (dest.count(at)) {
	    return cur.first;
	}
	for (auto ed: g[at]) {
	    int to = ed.second;
	    ll dis = cur.first + ed.first;
	    if (dp[to] > dis) {
		st.erase({dp[to], to});
		dp[to] = dis;
		st.insert({dp[to], to});
	    }
	}
    }

    ll res = inf;
    for (int i=0; i<T; i++) {
	res = min(res, dp[Y[i]]);
    }

    
    return res;
}

int q;
int a[maxn], b[maxn], d[maxn];
int x[maxn], y[maxn];

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 24192 KB Output is correct
2 Correct 7716 ms 32888 KB Output is correct
3 Correct 4336 ms 42280 KB Output is correct
4 Correct 4489 ms 42244 KB Output is correct
5 Correct 6315 ms 42364 KB Output is correct
6 Execution timed out 8007 ms 42188 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 24056 KB Output is correct
2 Execution timed out 8034 ms 95812 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 24192 KB Output is correct
2 Correct 7716 ms 32888 KB Output is correct
3 Correct 4336 ms 42280 KB Output is correct
4 Correct 4489 ms 42244 KB Output is correct
5 Correct 6315 ms 42364 KB Output is correct
6 Execution timed out 8007 ms 42188 KB Time limit exceeded
7 Halted 0 ms 0 KB -