# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701672 | delrey | Autobus (COCI22_autobus) | C++14 | 384 ms | 8116 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 <iostream>
using namespace std;
const int inf = 1000000000;
int n, m;
int adj[70][70];
int k, q;
int dp[70][70][70]; //[distance][town A][town B]
int main()
{
cin>>n>>m;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
{
adj[i][j] = inf;
for(int d = 0; d < n; d++)
dp[d][i][j] = inf;
}
for(int i = 0; i < n; i++)
{
adj[i][i] = 0;
dp[0][i][i] = 0;
}
for(int i = 0; i < m; i++)
{
int a, b, t;
cin>>a>>b>>t;
a--;
# | 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... |