oj.uz

Submission #136928

# Submission time Handle Problem Language Result Execution time Memory
136928 2019-07-26T14:48:37 Z DanerZein Shortcut (IOI16_shortcut) C++14
0 / 100
 2000 ms 380 KB 
    #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(200);
     
    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;
           for(int k=0;k<G.size();k++){
    	 if(G[k].empty()){
    	   continue;
    	 }
    	 fill(dist.begin(),dist.end(),MAX);
    	 //cout<<"0:"<<endl;
    	 bfs(k);
    	 for(int l=0;l<G.size();l++){
    	   if(!G[l].empty()){
    	     ma=max(ma,dist[l]);
    	   }
    	 }
           }
           /*
           vector<long long> no;
          for(int k=0;k<G.size();k++){
    	  if(ma<=dist[k] and !G[k].empty()){
    	  ma=dist[k];
    	  no.push_back(k);
    	}
          }
         for(int k=0;k<no.size();k++){
    	fill(dist.begin(),dist.end(),MAX);
    	bfs(no[k]);
    	for(int l=0;l<G.size();l++){
    	  if(!G[l].empty()){
    	    long long w=dist[l];
    	    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:22: 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:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(long long i=0;i<l.size();i++){
                         ~^~~~~~~~~
shortcut.cpp:43:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(long long i=0;i<d.size();i++){
                         ~^~~~~~~~~
shortcut.cpp:55:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
            for(int k=0;k<G.size();k++){
                        ~^~~~~~~~~
shortcut.cpp:62:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int l=0;l<G.size();l++){
                   ~^~~~~~~~~

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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 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 376 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 380 KB n = 2, 62 is a correct answer
6 Correct 2 ms 376 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 256 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 3 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 3 ms 376 KB n = 10, 7000000000 is a correct answer
20 Correct 2 ms 256 KB n = 5, 12 is a correct answer
21 Correct 2 ms 376 KB n = 5, 25 is a correct answer
22 Correct 0 ms 376 KB n = 2, 122 is a correct answer
23 Correct 2 ms 256 KB n = 10, 117 is a correct answer
24 Correct 3 ms 376 KB n = 10, 336 is a correct answer
25 Correct 3 ms 376 KB n = 10, 438 is a correct answer
26 Correct 2 ms 256 KB n = 10, 206 is a correct answer
27 Correct 3 ms 376 KB n = 10, 636 is a correct answer
28 Correct 2 ms 376 KB n = 4, 2399 is a correct answer
29 Correct 2 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 2 ms 256 KB n = 10, 3112 is a correct answer
31 Execution timed out 2055 ms 376 KB Time limit exceeded
32 Halted 0 ms 0 KB -