oj.uz

Submission #135946

# Submission time Handle Problem Language Result Execution time Memory
135946 2019-07-24T14:19:05 Z DanerZein Shortcut (IOI16_shortcut) C++14
0 / 100
 2 ms 376 KB 
#include "shortcut.h"
#include <bits/stdc++.h>
#define MAX 10000000
using namespace std;
typedef pair<int,int> ii;
typedef vector<ii> vi;
vector<vi>G;
int ml;
vector<long long>dist(2000);

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();
    //cout<<v<<endl;
    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);
       bfs(0);
      long long no;
      for(int k=0;k<G.size();k++){
	  if(ma<=dist[k] and !G[k].empty()){
	  ma=dist[k];
	  no=k;
	}
      }
      fill(dist.begin(),dist.end(),MAX);
      bfs(no);
      for(int k=0;k<G.size();k++){
	if(!G[k].empty()){
        long long w=dist[k];
	ma=max(ma,w);
	}
      }
      
      G[i].pop_back();
      G[j].pop_back();
      if(mi>ma){
      mi=min(mi,ma);
      }
    }
  }
  return mi;

}

Compilation message

shortcut.cpp: In function 'void bfs(int)':
shortcut.cpp:22:18: 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:39:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(long long i=0;i<l.size();i++){
                     ~^~~~~~~~~
shortcut.cpp:43:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(long long i=0;i<d.size();i++){
                     ~^~~~~~~~~
shortcut.cpp:58:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int k=0;k<G.size();k++){
                   ~^~~~~~~~~
shortcut.cpp:66:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int k=0;k<G.size();k++){
                   ~^~~~~~~~~
shortcut.cpp:65:10: warning: 'no' may be used uninitialized in this function [-Wmaybe-uninitialized]
       bfs(no);
       ~~~^~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 248 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 256 KB n = 2, 3 is a correct answer
7 Correct 2 ms 376 KB n = 3, 29 is a correct answer
8 Correct 2 ms 248 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Incorrect 2 ms 376 KB n = 2, incorrect answer: jury 2000000001 vs contestant 10000000
11 Halted 0 ms 0 KB -