# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696640 | Hiennoob123 | Autobus (COCI22_autobus) | C++14 | 324 ms | 17564 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>
#define ll long long
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
const ll maxn = 71*71+10;
const ll add = 1e5;
ll n, m;
vector<pair<ll,ll>> T[80];
ll dis[71][71][80];
bool chk[71][71][80];
vector<pair<pll,ll>> road;
void solve_this(ll v)
{
//cout << v << "\n";
for(int i = 1; i<= n; i++)
{
//if(v==70) cout << i << " ";
for(int j = 0; j<= 71; j++)
{
dis[v][i][j] = LLONG_MAX;
//if(v==70&&i==69) cout << dis[v][i][j] << "-\n";
chk[v][i][j] = 0;
}
}
dis[v][v][0] = 0;
chk[v][v][0] = 1;
# | 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... |