# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133508 | DanerZein | Shortcut (IOI16_shortcut) | C++14 | 4 ms | 632 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 "shortcut.h"
#include <bits/stdc++.h>
#define MAX 10000000000
using namespace std;
typedef pair<int,int> ii;
typedef vector<ii> vi;
vector<vi>G;
int ml;
vector<int>dist(2000);
void bfs(int u){
// cout<<"bfs (u) "<<u<<endl;
dist[u]=0;
vector<int>vis(ml,0);
queue<int>q;
q.push(u);
vis[u]=1;
while(!q.empty()){
int v=q.front();
q.pop();
vis[v]=0;
for(int i=0;i<G[v].size();i++){
long long x=G[v][i].first;
long long w=G[v][i].second;
//cout<<v<<" "<<w<<endl;
if(dist[v]+w<dist[x]){
dist[x]=dist[v]+w;
if(vis[x]==0){
q.push(x);
vis[x]=1;
}
}
}
}
}
long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c){
ml=n;
G.resize(2*n+1);
for(long long i=0;i<l.size();i++){
G[i+1].push_back(ii(i,l[i]));
G[i].push_back(ii(i+1,l[i]));
}
for(long long i=0;i<d.size();i++){
if(d[i]!=0){
G[i+n].push_back(ii(i,d[i]));
G[i].push_back(ii(i+n,d[i]));
}
}
long long mi=MAX;
for(long long i=0;i<n;i++){
for(long long j=i+1;j<n;j++){
G[i].push_back(ii(j,c));
G[j].push_back(ii(i,c));
long long ma=-1;
for(long long k=0;k<G.size();k++){
if(!G[k].empty()){
fill(dist.begin(),dist.end(),MAX);
bfs(k);
long long no;
for(long long l=0;l<G.size();l++){
if(dist[l]>ma and !G[l].empty()){
no=k;
ma=dist[l];
}
}
}
}
G[i].pop_back();
G[j].pop_back();
mi=min(mi,ma);
}
}
return mi;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |