# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703965 | willychan | Autobus (COCI22_autobus) | C++14 | 106 ms | 6940 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;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
vector<vector<ll> > dis;
int n,m;
vector<vector<ll> > ans;
void pow(int p) {
ans.resize(n);
for(int i=0; i<n; i++) ans[i].resize(n,1e17);
for(int i=0;i<n;i++) ans[i][i]=0;
vector<vector<ll> > og;
while(p) {
if(p&1) {
og = ans;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
for(int k=0; k<n; k++) {
og[i][j] = min(og[i][j],ans[i][k]+dis[k][j]);
}
}
}
ans = og;
}
og = dis;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
for(int k=0; k<n; k++) {
# | 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... |