Submission #1160016

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160016		mariaclara	Escape Route (JOI21_escape_route)	C++20	5 / 100	9014 ms	111940 KiB

escape_route

#include "escape_route.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef tuple<ll,int,int> trio;
typedef pair<ll,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

int n;
ll s, L[100][100], C[100][100], dist[100][100];
vector<ll> ans;
vector<trio> query[100];

void pre_calc(int raiz) {
    for(int i = 0; i < n; i++) dist[raiz][i] = -1;
    vector<bool> vis(n);
    dist[raiz][raiz] = 0;

    while(1) {
        ll D = -1;
        int x = -1;
        for(int i = 0; i < n; i++) {
            if(dist[raiz][i] != -1 and !vis[i] and (D == -1 or D > dist[raiz][i])) 
                D = dist[raiz][i], x = i;
        }

        if(x == -1) break;
        vis[x] = 1;

        for(int viz = 0; viz < n; viz++) {
            if(L[x][viz] == 0) continue;
            ll D_viz;
            if(D%s <= C[x][viz] - L[x][viz]) D_viz = D + L[x][viz];
            else D_viz = D + s - D%s + L[x][viz];
            if(dist[raiz][viz] == -1 or dist[raiz][viz] >= D_viz) 
                dist[raiz][viz] = D_viz;
        }
    }
} 

ll dijkstra(int raiz, int fim, ll t) {
    for(int i = 0; i < n; i++) dist[raiz][i] = -1;
    vector<bool> vis(n);
    dist[raiz][raiz] = t;

    while(1) {
        ll D = -1;
        int x = -1;
        for(int i = 0; i < n; i++) {
            if(dist[raiz][i] != -1 and !vis[i] and (D == -1 or D > dist[raiz][i])) 
                D = dist[raiz][i], x = i;
        }

        if(x == -1) break;
        vis[x] = 1;

        for(int viz = 0; viz < n; viz++) {
            if(L[x][viz] == 0) continue;
            ll D_viz;
            if(D%s <= C[x][viz] - L[x][viz]) D_viz = D + L[x][viz];
            else D_viz = D + s - D%s + L[x][viz];
            if(dist[raiz][viz] == -1 or dist[raiz][viz] >= D_viz) 
                dist[raiz][viz] = D_viz;
        }
    }

    return dist[raiz][fim];
}

vector<ll> calculate_necessary_time(int N, int M, ll S, int Q,
    vector<int> A, vector<int> B, vector<ll> l, vector<ll> c,
    vector<int> U, vector<int> V, vector<ll> T) {

    n = N;
    s = S;

    for(int i = 0; i < M; i++) {
        L[A[i]][B[i]] = L[B[i]][A[i]] = l[i];
        C[A[i]][B[i]] = C[B[i]][A[i]] = c[i];
    }

    for(int i = 0; i < Q; i++) {
        ans.pb(dijkstra(U[i], V[i], T[i]) - T[i]);
    }

    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 10
• Subtask 4: 0 / 35
• Subtask 5: 0 / 30