# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925470 | bachhoangxuan | 한자 끝말잇기 (JOI14_kanji) | C++17 | 109 ms | 17992 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 "Annalib.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 305;
const int maxm = maxn*maxn;
const ll inf = 4e18;
ll dist[maxn][maxn];
bool check[maxm];
void Anna(int N, int M, int A[], int B[], ll C[], int Q, int S[], int T[], int K, int U[]) {
for(int i=0;i<N;i++) for(int j=0;j<N;j++) dist[i][j]=inf;
for(int i=0;i<K;i++) check[U[i]]=true;
for(int i=0;i<M;i++){
if(!check[i]) dist[A[i]][B[i]]=C[i];
}
for(int i=0;i<N;i++) dist[i][i]=0;
for(int k=0;k<N;k++){
for(int i=0;i<N;i++) for(int j=0;j<N;j++) dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
}
vector<vector<int>> g(K+1);
for(int i=0;i<Q;i++) g[0].push_back(i);
auto f = [&](int s,int t,int id){
if(id==K) return dist[s][t];
else return min(inf,dist[s][A[U[id]]]+dist[B[U[id]]][t]);
};
vector<pair<int,int>> p;
for(int i=1;i<=K;i++){
ll c=(i==K?0:C[U[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |