oj.uz

답안 #246887

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246887 2020-07-10T13:31:21 Z eriksuenderhauf Toll (BOI17_toll) C++11
100 / 100
 1198 ms 100260 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define sqrtn 230
#define maxn 50050
#define mxdist 500000000
vector<int> jump = {0,228,112,74,45,44};
int dist[maxn][231];
int k,no_of_vertex,no_of_edge,no_of_query;
vector<int> top;
vector<int> visited(maxn,0);
vector<vector<pair<int,int> > > adj(maxn);
vector<int> ipos(maxn,0);
void topsort(int node){
    visited[node] = 1;
    for(auto k:adj[node]){
        if(visited[k.f]==1){
            continue;
        }
        topsort(k.f);
    }
    top.push_back(node);
}
void find(int node){
  vector<pair<int,int> > curr;
  vector<int> distt(231,INT_MAX);
  for(int i=node;i<min(no_of_vertex,node+231);i++){
    curr.push_back({ipos[i],i});
  }
  distt[0] = 0;
  sort(curr.begin(),curr.end());
  for(int i=0;i<curr.size();i++){
    for(auto kk:adj[curr[i].s]){
      if(kk.f>node+230){
        continue;
      }
      distt[kk.f-node] = min(distt[kk.f-node],distt[curr[i].s-node]+kk.s);
    }
  }
  for(int i=0;i<231;i++){
    dist[node][i] = INT_MAX;
  }
  for(int i=0;i<curr.size();i++){
    dist[node][i] = distt[i];
  }
  return;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);
  cin >> k >> no_of_vertex >> no_of_edge >> no_of_query;
  int input1,input2,input3;
  for(int i=0;i<no_of_edge;i++){
    cin >> input1 >> input2 >> input3;
    adj[input1].push_back({input2,input3});
  }
  // for (int i = 0; i < no_of_vertex; i++)
  //   sort(adj[i].begin(), adj[i].end());
  for(int i=0;i<no_of_vertex;i++){
    if(visited[i]==0){
      topsort(i);
    }
  }
  reverse(top.begin(),top.end());
  for(int i=0;i<top.size();i++){
    ipos[top[i]] = i;
  }
  for(int i=0;i<no_of_vertex;i++){
    find(i);
  }

  for(int i=0;i<no_of_query;i++){
    cin >> input1 >> input2;
    vector<int> currdist(k,INT_MAX);
    if(input1+230>=input2){
      if(dist[input1][input2-input1]>=INT_MAX){
        cout << -1 << "\n";
      }
      else{
        cout << dist[input1][input2-input1] << "\n";
      }
      continue;
    }
    int q = input1/k;
    q++;
    for(int j=0;j<k;j++){
      currdist[j] = dist[input1][q*k+j-input1];
    }
    while(1){
      if(q*k+230>=input2){
        int mini = INT_MAX;
        for(int j=0;j<k;j++){
          mini = min(mini,dist[q*k+j][input2-q*k-j]+currdist[j]);
        }
        if(mini==INT_MAX){
          cout << -1 << "\n";
        }
        else{
          cout << mini << "\n";
        }
        break;
      }
      vector<int> next(k,INT_MAX);
      for(int j=0;j<k;j++){
        for(int a=0;a<k;a++){
          next[a] = min(next[a],dist[q*k+j][k*jump[k]+a-j]+currdist[j]);
        }
      }
      swap(currdist, next);
      q += jump[k];
    }
  }
 
}

Compilation message

toll.cpp: In function 'void find(long long int)':
toll.cpp:34:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<curr.size();i++){
               ~^~~~~~~~~~~~
toll.cpp:45:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<curr.size();i++){
               ~^~~~~~~~~~~~
toll.cpp: In function 'int32_t main()':
toll.cpp:67:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<top.size();i++){
               ~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 635 ms 98200 KB Output is correct
2 Correct 7 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 6 ms 2304 KB Output is correct
5 Correct 20 ms 4224 KB Output is correct
6 Correct 21 ms 4224 KB Output is correct
7 Correct 19 ms 4224 KB Output is correct
8 Correct 703 ms 95880 KB Output is correct
9 Correct 769 ms 95688 KB Output is correct
10 Correct 483 ms 93372 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 760 ms 96424 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 6 ms 2304 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 6 ms 2304 KB Output is correct
7 Correct 22 ms 4224 KB Output is correct
8 Correct 22 ms 4352 KB Output is correct
9 Correct 613 ms 95912 KB Output is correct
10 Correct 826 ms 99528 KB Output is correct
11 Correct 710 ms 98676 KB Output is correct
12 Correct 1014 ms 96752 KB Output is correct
13 Correct 572 ms 63464 KB Output is correct
14 Correct 477 ms 61548 KB Output is correct
15 Correct 558 ms 60392 KB Output is correct
16 Correct 568 ms 60484 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 6 ms 2304 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 17 ms 4224 KB Output is correct
7 Correct 19 ms 4224 KB Output is correct
8 Correct 21 ms 4304 KB Output is correct
9 Correct 23 ms 4344 KB Output is correct
10 Correct 560 ms 95860 KB Output is correct
11 Correct 703 ms 98540 KB Output is correct
12 Correct 768 ms 99684 KB Output is correct
13 Correct 768 ms 100208 KB Output is correct
14 Correct 805 ms 99188 KB Output is correct
15 Correct 531 ms 60536 KB Output is correct
16 Correct 529 ms 60336 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 6 ms 2304 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 17 ms 4224 KB Output is correct
7 Correct 19 ms 4224 KB Output is correct
8 Correct 21 ms 4304 KB Output is correct
9 Correct 23 ms 4344 KB Output is correct
10 Correct 560 ms 95860 KB Output is correct
11 Correct 703 ms 98540 KB Output is correct
12 Correct 768 ms 99684 KB Output is correct
13 Correct 768 ms 100208 KB Output is correct
14 Correct 805 ms 99188 KB Output is correct
15 Correct 531 ms 60536 KB Output is correct
16 Correct 529 ms 60336 KB Output is correct
17 Correct 705 ms 98676 KB Output is correct
18 Correct 7 ms 2304 KB Output is correct
19 Correct 6 ms 2304 KB Output is correct
20 Correct 6 ms 2304 KB Output is correct
21 Correct 6 ms 2304 KB Output is correct
22 Correct 5 ms 2304 KB Output is correct
23 Correct 18 ms 4224 KB Output is correct
24 Correct 19 ms 4352 KB Output is correct
25 Correct 22 ms 4352 KB Output is correct
26 Correct 21 ms 4352 KB Output is correct
27 Correct 590 ms 95760 KB Output is correct
28 Correct 952 ms 99952 KB Output is correct
29 Correct 938 ms 100260 KB Output is correct
30 Correct 840 ms 98808 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 635 ms 98200 KB Output is correct
2 Correct 7 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 6 ms 2304 KB Output is correct
5 Correct 20 ms 4224 KB Output is correct
6 Correct 21 ms 4224 KB Output is correct
7 Correct 19 ms 4224 KB Output is correct
8 Correct 703 ms 95880 KB Output is correct
9 Correct 769 ms 95688 KB Output is correct
10 Correct 483 ms 93372 KB Output is correct
11 Correct 760 ms 96424 KB Output is correct
12 Correct 6 ms 2304 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 6 ms 2304 KB Output is correct
15 Correct 7 ms 2304 KB Output is correct
16 Correct 6 ms 2304 KB Output is correct
17 Correct 22 ms 4224 KB Output is correct
18 Correct 22 ms 4352 KB Output is correct
19 Correct 613 ms 95912 KB Output is correct
20 Correct 826 ms 99528 KB Output is correct
21 Correct 710 ms 98676 KB Output is correct
22 Correct 1014 ms 96752 KB Output is correct
23 Correct 572 ms 63464 KB Output is correct
24 Correct 477 ms 61548 KB Output is correct
25 Correct 558 ms 60392 KB Output is correct
26 Correct 568 ms 60484 KB Output is correct
27 Correct 6 ms 2304 KB Output is correct
28 Correct 6 ms 2304 KB Output is correct
29 Correct 6 ms 2304 KB Output is correct
30 Correct 6 ms 2304 KB Output is correct
31 Correct 6 ms 2304 KB Output is correct
32 Correct 17 ms 4224 KB Output is correct
33 Correct 19 ms 4224 KB Output is correct
34 Correct 21 ms 4304 KB Output is correct
35 Correct 23 ms 4344 KB Output is correct
36 Correct 560 ms 95860 KB Output is correct
37 Correct 703 ms 98540 KB Output is correct
38 Correct 768 ms 99684 KB Output is correct
39 Correct 768 ms 100208 KB Output is correct
40 Correct 805 ms 99188 KB Output is correct
41 Correct 531 ms 60536 KB Output is correct
42 Correct 529 ms 60336 KB Output is correct
43 Correct 705 ms 98676 KB Output is correct
44 Correct 7 ms 2304 KB Output is correct
45 Correct 6 ms 2304 KB Output is correct
46 Correct 6 ms 2304 KB Output is correct
47 Correct 6 ms 2304 KB Output is correct
48 Correct 5 ms 2304 KB Output is correct
49 Correct 18 ms 4224 KB Output is correct
50 Correct 19 ms 4352 KB Output is correct
51 Correct 22 ms 4352 KB Output is correct
52 Correct 21 ms 4352 KB Output is correct
53 Correct 590 ms 95760 KB Output is correct
54 Correct 952 ms 99952 KB Output is correct
55 Correct 938 ms 100260 KB Output is correct
56 Correct 840 ms 98808 KB Output is correct
57 Correct 1198 ms 100132 KB Output is correct
58 Correct 759 ms 96080 KB Output is correct
59 Correct 802 ms 98800 KB Output is correct