# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924475 | UmairAhmadMirza | Toll (BOI17_toll) | C++17 | 130 ms | 30056 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 <bits/stdc++.h>
using namespace std;
int const N=1e5;
int const inf=1e9+5;
int wei[N][20][6];
int main(){
int k,n,m,o;
cin>>k>>n>>m>>o;
for(int i=0;i<n;i++)
for(int j=0;j<=16;j++)
for(int kk=0;kk<=5;kk++)
wei[i][j][kk]=inf;
for(int i=0;i<m;i++){
int a,b,w;
cin>>a>>b>>w;
// swap(a,b);//switch directions;
wei[a][0][b%k]=w;
}
//compute
int midnode=0;
for(int par=1;par<=15;par++){
for(int node=0;node<n;node++){
midnode=(((1<<(par-1))+(node/k))*k);
for(int md=0;md<k;md++){
for(int d=0;d<k;d++){
wei[node][par][md]=min(wei[node][par][md],(wei[node][par-1][d]+wei[midnode+d][par-1][md]));
}
}
}
}
# | 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... |