oj.uz

Submission #472526

# Submission time Handle Problem Language Result Execution time Memory
472526 2021-09-13T17:03:58 Z ZaZo_ Toll (BOI17_toll) C++14
17 / 100
 71 ms 7228 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 dist[50001],vis[50001]={0};
void prepare()
{
  for(int i = 0 ; i < n+1 ; i ++) dist[i]=INT_MAX;
}
void djk(int s , int e)
{
  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;
    vis[u]=1;
    pq.pop();
    for(int i = 0 ; i < edges[u].size() ; i++)
    {
      if(!vis[edges[u][i].first]&&dist[edges[u][i].first] > dist[u] + edges[u][i].second)
      {
        dist[edges[u][i].first] = dist[u] + edges[u][i].second;
        pq.push({-dist[edges[u][i].first],edges[u][i].first});
      }
    }
  }
}
int32_t main() {
  ZAZO
  cin >> k >> n >> m >> o ;
  int pref[50011];
  for(int i = 0 ; i <= 50001 ; i ++) pref[i]=-1e9;
  for(int i = 0 ; i < m ; i ++)
  {
    int a , b , t;
    cin >> a >> b >> t;
    edges[a].push_back({b,t});
    pref[b]=t;
  }
  if(k==1){
  for(int i = 1  ; i <= 50001 ; i++)
  {
    pref[i]+=pref[i-1];
  }
  for(int i = 0 ; i < o ; i ++)
  {
    int a , b;
    cin>>a>>b;
    if(pref[b]-pref[a]<=0) cout<<"-1"<<endl;
    else cout<<pref[b]-pref[a]<<endl;
  }
  }
  else{
    vector<pair<int,pair<int,int>>>v;
   for(int i = 0 ; i < o ; i ++)
   {
     int a , b;
     cin >> a >> b;
     v.push_back({i,{a,b}});
   }
   sort(v.begin(),v.end());
   int ans[o];
   for(int i = 0 ; i < o ; i ++) ans[i]=-1;
   for(int i = 0 ; i < v.size() ; i++)
   {
     if(i && v[i].second.first == v[i-1].second.first)
     {
       if(dist[v[i].second.second] != INT_MAX) ans[v[i].first]=dist[v[i].second.second];
     }
     else
     {
       prepare();
       djk(v[i].second.first , v[i].second.second);
       if(dist[v[i].second.second]!=INT_MAX)
         ans[v[i].first] = dist[v[i].second.second];
     }
   }
   for(int i = 0 ; i < o ; i++)
   cout<<ans[i]<<'\n';
  }
}

Compilation message

toll.cpp: In function 'void djk(long long int, long long int)':
toll.cpp:22: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]
   22 |     for(int i = 0 ; i < edges[u].size() ; i++)
      |                     ~~^~~~~~~~~~~~~~~~~
toll.cpp:19:9: warning: unused variable 'c' [-Wunused-variable]
   19 |     int c = -pq.top().first , u = pq.top().second;
      |         ^
toll.cpp: In function 'int32_t main()':
toll.cpp:68:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |    for(int i = 0 ; i < v.size() ; i++)
      |                    ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3396 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 4 ms 1868 KB Output is correct
6 Correct 3 ms 1868 KB Output is correct
7 Correct 4 ms 1868 KB Output is correct
8 Correct 40 ms 3364 KB Output is correct
9 Correct 39 ms 3376 KB Output is correct
10 Correct 20 ms 1868 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 5464 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Correct 19 ms 1868 KB Output is correct
8 Correct 5 ms 2448 KB Output is correct
9 Correct 39 ms 3376 KB Output is correct
10 Correct 71 ms 7096 KB Output is correct
11 Correct 53 ms 5676 KB Output is correct
12 Correct 34 ms 4676 KB Output is correct
13 Correct 70 ms 7228 KB Output is correct
14 Correct 46 ms 5152 KB Output is correct
15 Correct 35 ms 4524 KB Output is correct
16 Correct 38 ms 4468 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Incorrect 1 ms 1868 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 1868 KB Output is correct
2 Incorrect 1 ms 1868 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3396 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 1 ms 1868 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 4 ms 1868 KB Output is correct
6 Correct 3 ms 1868 KB Output is correct
7 Correct 4 ms 1868 KB Output is correct
8 Correct 40 ms 3364 KB Output is correct
9 Correct 39 ms 3376 KB Output is correct
10 Correct 20 ms 1868 KB Output is correct
11 Correct 47 ms 5464 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 1 ms 1868 KB Output is correct
14 Correct 1 ms 1868 KB Output is correct
15 Correct 1 ms 1868 KB Output is correct
16 Correct 1 ms 1868 KB Output is correct
17 Correct 19 ms 1868 KB Output is correct
18 Correct 5 ms 2448 KB Output is correct
19 Correct 39 ms 3376 KB Output is correct
20 Correct 71 ms 7096 KB Output is correct
21 Correct 53 ms 5676 KB Output is correct
22 Correct 34 ms 4676 KB Output is correct
23 Correct 70 ms 7228 KB Output is correct
24 Correct 46 ms 5152 KB Output is correct
25 Correct 35 ms 4524 KB Output is correct
26 Correct 38 ms 4468 KB Output is correct
27 Correct 1 ms 1868 KB Output is correct
28 Incorrect 1 ms 1868 KB Output isn't correct
29 Halted 0 ms 0 KB -