oj.uz

Submission #472466

# Submission time Handle Problem Language Result Execution time Memory
472466 2021-09-13T15:49:08 Z ZaZo_ Toll (BOI17_toll) C++14
0 / 100
 3000 ms 7908 KB 
#include <bits/stdc++.h>
#define ZAZO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
vector<pair<int,int>>edges[50001];
int k , n , m , o ;
int djk(int s , int e)
{
  int dist[n+1];
  for(int i = 0 ; i < n+1 ; i ++) dist[i]=1e15;
  priority_queue<pair<int,int>>pq;
  dist[s]=0;
  pq.push({0,s});
  while(!pq.empty())
  {
    int c = -pq.top().first , u = pq.top().second;
    pq.pop();
    for(int i = 0 ; i < edges[u].size() ; i++)
    {
      if(dist[edges[u][i].first] > edges[u][i].second + c)
      {
        dist[edges[u][i].first] = edges[u][i].second+c;
      //  cout<<dist[edges[u][i].first]<<endl;
        pq.push({-dist[edges[u][i].first],edges[u][i].first});
      }
    }
  }
  return dist[e];
}
int32_t main() {
  ZAZO
  cin >> k >> n >> m >> o ;
  for(int i = 0 ; i < m ; i ++)
  {
    int a , b , t;
    cin >> a >> b >> t;
    edges[a].push_back({b,t});
    edges[b].push_back({a,t});
  }
  while(o--)
  {
    int a , b;
    cin >> a >> b;
    int ans=djk(a,b);
    if(ans==1e15) cout<<"-1"<<endl;
    else
    cout<<ans<<endl;
  }
}

Compilation message

toll.cpp: In function 'long long int djk(long long int, long long int)':
toll.cpp:18:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i = 0 ; i < edges[u].size() ; i++)
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3072 ms 5444 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3068 ms 7908 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Incorrect 1 ms 1484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1484 KB Output is correct
2 Incorrect 1 ms 1484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3072 ms 5444 KB Time limit exceeded
2 Halted 0 ms 0 KB -