| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 415846 | koioi.org-koosaga | Escape Route (JOI21_escape_route) | 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 "escape_route.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
struct edg{
int pos;
lint L, C;
};
lint daybreak[96][96];
lint dayfinish[96][96];
lint adj[96][96], dp[96][96];
vector<edg> gph[96];
vector<pi> prec[96][96];
lint S;
void Do(int n){
for(int u = 0; u < n; u++){
for(auto &e : gph[u]){
int v = e.pos;
vector<lint> dist1(n, -3e18), dist2(n, 3e18);
// backward shortest path
{
dist1[u] = e.C - e.L;
vector<int> vis(n);
for(int it = 0; it < n; it++){
pi ret(-5e18, 5e18);
for(int i = 0; i < n; i++){
if(!vis[i]) ret = max(ret, pi(dist1[i], i));
}
if(ret.first < 0) break;
int x = ret.second;
vis[x] = 1;
for(auto &e : gph[x]){
if(dist1[e.pos] < dist1[x] - e.L && dist1[x] < e.C){
dist1[e.pos] = dist1[x] - e.L;
}
}
}
}
// forward shortest path
{
dist2[v] = e.C;
vector<int> vis(n);
for(int it = 0; it < n; it++){
pi ret(5e18, 5e18);
for(int i = 0; i < n; i++){
if(!vis[i]) ret = min(ret, pi(dist2[i], i));
}
if(ret.first > S) break;
int x = ret.second;
vis[x] = 1;
for(auto &e : gph[x]){
if(dist2[e.pos] > dist2[x] + e.L && dist2[x] + e.L <= e.C){
dist2[e.pos] = dist2[x] + e.L;
}
}
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(dist2[j] <= S && dist1[i] >= 0){
prec[i][j].emplace_back(dist1[i], dist2[j] - dist1[i]);
}
}
}
}
}
}
// wtf just use namespace std and pairs
std::vector<long long> calculate_necessary_time(
int N, int M, long long Sfuck, int Q, std::vector<int> A, std::vector<int> B,
std::vector<long long> L, std::vector<long long> C, std::vector<int> U,
std::vector<int> V, std::vector<long long> T) {
S = Sfuck;
for(int i = 0; i < M; i++){
gph[A[i]].push_back({B[i], L[i], C[i]});
gph[B[i]].push_back({A[i], L[i], C[i]});
}
{
priority_queue<node> pq;
memset(daybreak, 0x3f, sizeof(daybreak));
auto enq = [&](int s, int e, lint x){
if(daybreak[s][e] > x){
daybreak[s][e] = x;
pq.push({s, e, -x});
}
};
for(int i = 0; i < N; i++){
enq(i, i, 0);
}
while(sz(pq)){
auto x = pq.top(); pq.pop();
x.max_time = -x.max_time;
if(daybreak[x.i][x.j] != x.max_time) continue;
for(auto &e : gph[x.j]){
if(x.max_time + e.L <= e.C){
enq(x.i, e.pos, x.max_time + e.L);
}
}
}
}
{
priority_queue<node> pq;
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
dayfinish[i][j] = -1e18;
}
}
auto enq = [&](int s, int e, lint x){
if(dayfinish[s][e] < x){
dayfinish[s][e] = x;
pq.push({s, e, x});
}
};
for(int i = 0; i < N; i++){
enq(i, i, S);
}
while(sz(pq)){
auto x = pq.top(); pq.pop();
if(dayfinish[x.i][x.j] != x.max_time) continue;
for(auto &e : gph[x.i]){
lint val = min(x.max_time, e.C) - e.L;
if(val >= 0) enq(e.pos, x.j, val);
}
}
}
{
memset(adj, 0x3f, sizeof(adj));
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(dayfinish[i][j] >= 0) adj[i][j] = 1;
if(i == j) adj[i][j] = 0;
}
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
for(int k = 0; k < N; k++){
adj[j][k] = min(adj[j][k], adj[j][i] + adj[i][k]);
}
}
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
assert(adj[i][j] <= N);
dp[i][j] = 1e18;
for(int k = 0; k < N; k++){
dp[i][j] = min(adj[i][k] * S + daybreak[k][j], dp[i][j]);
}
}
}
}
Do(N);
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
auto aux = prec[i][j];
sort(all(aux), [&](const pi &a, const pi &b){
return pi(a.first, -a.second) < pi(b.first, -b.second);
});
reverse(all(aux));
prec[i][j].clear();
for(auto &x : aux){
if(sz(prec[i][j]) && prec[i][j].back().second <= x.second) continue;
prec[i][j].push_back(x);
}
reverse(all(prec[i][j]));
}
}
vector<lint> ans(Q);
for(int i = 0; i < Q; i++){
if(dayfinish[U[i]][V[i]] >= T[i]){
auto it = upper_bound(all(prec[U[i]][V[i]]), pi(T[i], -1));
ans[i] = it->second;
continue;
}
lint ret = 1e18;
for(int j = 0; j < N; j++){
if(dayfinish[U[i]][j] >= T[i]){
ret = min(ret, S - T[i] + dp[j][V[i]]);
}
}
ans[i] = ret;
}
return ans;
}