Submission #136959

#	Time	Username	Problem	Language	Result	Execution time	Memory
136959		DanerZein	Shortcut (IOI16_shortcut)	C++14	0 / 100	2031 ms	420 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
#define MAX 100000000000
using namespace std;
typedef pair<int,int> ii;
typedef vector<ii> vi;
vector<vi>G;
int ml;
vector<long long> dist(100);
void bfs(int u){
  
  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;
    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=2*n;
   G.resize(2*n);
   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;
    /*  fill(dist.begin(),dist.end(),MAX);
    long long no;
    bfs(0);
    for(int k=0;k<2*n;k++){
      if(!G[k].empty()){
	cout<<dist[k]<<" ";
	if(ma<dist[k]){
	ma=max(ma,dist[k]);
	no=k;
	}
      }
    }
    cout<<endl;
    //cout<<ma<<endl;
    fill(dist.begin(),dist.end(),MAX);
    bfs(no);
    for(int k=0;k<2*n;k++){
      if(!G[k].empty()){
	if(ma<=dist[k]){
	ma=max(ma,dist[k]);
	no=k;
      
      }
		cout<<dist[k]<<" ";
      }
    }
    cout<<endl;
    //cout<<ma<<endl;
    fill(dist.begin(),dist.end(),MAX);
    bfs(no);
    for(int k=0;k<2*n;k++){
      if(!G[k].empty()){
	if(ma<=dist[k]){
	ma=max(ma,dist[k]);
	no=k;
	}
		cout<<dist[k]<<" ";
      }
    }
    cout<<endl<<endl;*/
    for(int l=0;l<G.size();l++){
      if(G[l].empty()){
	continue;
      }
      fill(dist.begin(),dist.end(),MAX);
      bfs(l);
      for(int k=0;k<G.size();k++){
	if(!G[k].empty()){
	  if(dist[k]==12 and i==0 and j==4){
	    //  cout<<l<<" "<<k<<endl;
	  }
	  ma=max(ma,dist[k]);
	}
      }
    }
    // cout<<ma<<endl<<endl;
    G[i].pop_back();
    G[j].pop_back();
     mi=min(mi,ma);
   }
  }
  return mi;         
}

Compilation message (stderr)

shortcut.cpp: In function 'void bfs(int)':
shortcut.cpp:21:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i=0;i<G[v].size();i++){
                ~^~~~~~~~~~~~
shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:37:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(long long i=0;i<l.size();i++){
                      ~^~~~~~~~~
shortcut.cpp:41:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(long long i=0;i<d.size();i++){
                      ~^~~~~~~~~
shortcut.cpp:93:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int l=0;l<G.size();l++){
                 ~^~~~~~~~~
shortcut.cpp:99:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int k=0;k<G.size();k++){
                   ~^~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3