# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867736 | epicci23 | Autobus (COCI22_autobus) | C++17 | 145 ms | 10168 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;
#define pb push_back
#define endl "\n"
#define int long long
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
void solve(){
int n,m;
cin >> n >> m;
int dp[n+5][n+5][n+5];
int matr[n+5][n+5];
memset(dp,-1,sizeof(dp));
memset(matr,-1,sizeof(matr));
for(int i=1;i<=m;i++){
int a,b,c;
cin >> a >> b >> c;
if(matr[a][b]==-1) matr[a][b]=c;
else matr[a][b]=min(matr[a][b],c);
}
for(int i=1;i<=n;i++) matr[i][i]=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
dp[i][j][1]=matr[i][j];
# | 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... |