oj.uz

답안 #246893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246893 2020-07-10T13:34:42 Z kimbj0709 Toll (BOI17_toll) C++14
100 / 100
 1206 ms 101084 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 kk:adj[node]){
        if(visited[kk.f]==1){
            continue;
        }
        topsort(kk.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++){
    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<no_of_vertex;a++){
          cout << dist[q*k+j][a] << " ";
        }
        cout << "\n-----------\n";*/
        for(int a=0;a<k;a++){
          //cout << dist[q*k+j][k*jump[k]+a] << "---\n";
          //cout << j << " " << a << " " << dist[q*k+j][k*jump[k]+a-j] << " " << currdist[j] << " " << k*jump[k]+a << "\n";
          next[a] = min(next[a],dist[q*k+j][k*jump[k]+a-j]+currdist[j]);
        }
      }
      /*for(int j=0;j<k;j++){
        cout << next[j] << " ";
      }
      cout << "\n-----\n";*/
      /*cout << q*k << "\n";
      for(auto kk:next){
        cout << kk << " ";
      }
      cout << endl;*/
      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:65: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 830 ms 97448 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 7 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 20 ms 4192 KB Output is correct
7 Correct 22 ms 4224 KB Output is correct
8 Correct 686 ms 95016 KB Output is correct
9 Correct 795 ms 95160 KB Output is correct
10 Correct 535 ms 93428 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 795 ms 97016 KB Output is correct
2 Correct 14 ms 2304 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 10 ms 2304 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 6 ms 2304 KB Output is correct
7 Correct 21 ms 4340 KB Output is correct
8 Correct 33 ms 4352 KB Output is correct
9 Correct 635 ms 95352 KB Output is correct
10 Correct 877 ms 99632 KB Output is correct
11 Correct 819 ms 98808 KB Output is correct
12 Correct 1076 ms 96580 KB Output is correct
13 Correct 642 ms 63944 KB Output is correct
14 Correct 676 ms 61444 KB Output is correct
15 Correct 598 ms 60504 KB Output is correct
16 Correct 568 ms 60432 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2280 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 2432 KB Output is correct
6 Correct 23 ms 4224 KB Output is correct
7 Correct 45 ms 4216 KB Output is correct
8 Correct 22 ms 4352 KB Output is correct
9 Correct 20 ms 4352 KB Output is correct
10 Correct 835 ms 95852 KB Output is correct
11 Correct 675 ms 98676 KB Output is correct
12 Correct 1206 ms 100064 KB Output is correct
13 Correct 766 ms 100692 KB Output is correct
14 Correct 826 ms 98804 KB Output is correct
15 Correct 530 ms 60404 KB Output is correct
16 Correct 532 ms 60404 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 2280 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 2432 KB Output is correct
6 Correct 23 ms 4224 KB Output is correct
7 Correct 45 ms 4216 KB Output is correct
8 Correct 22 ms 4352 KB Output is correct
9 Correct 20 ms 4352 KB Output is correct
10 Correct 835 ms 95852 KB Output is correct
11 Correct 675 ms 98676 KB Output is correct
12 Correct 1206 ms 100064 KB Output is correct
13 Correct 766 ms 100692 KB Output is correct
14 Correct 826 ms 98804 KB Output is correct
15 Correct 530 ms 60404 KB Output is correct
16 Correct 532 ms 60404 KB Output is correct
17 Correct 742 ms 98548 KB Output is correct
18 Correct 6 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 6 ms 2304 KB Output is correct
23 Correct 18 ms 4224 KB Output is correct
24 Correct 19 ms 4340 KB Output is correct
25 Correct 22 ms 4352 KB Output is correct
26 Correct 21 ms 4352 KB Output is correct
27 Correct 580 ms 95892 KB Output is correct
28 Correct 831 ms 100056 KB Output is correct
29 Correct 816 ms 100572 KB Output is correct
30 Correct 871 ms 98612 KB Output is correct

Subtask #5
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 830 ms 97448 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 7 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 20 ms 4192 KB Output is correct
7 Correct 22 ms 4224 KB Output is correct
8 Correct 686 ms 95016 KB Output is correct
9 Correct 795 ms 95160 KB Output is correct
10 Correct 535 ms 93428 KB Output is correct
11 Correct 795 ms 97016 KB Output is correct
12 Correct 14 ms 2304 KB Output is correct
13 Correct 13 ms 2304 KB Output is correct
14 Correct 10 ms 2304 KB Output is correct
15 Correct 6 ms 2304 KB Output is correct
16 Correct 6 ms 2304 KB Output is correct
17 Correct 21 ms 4340 KB Output is correct
18 Correct 33 ms 4352 KB Output is correct
19 Correct 635 ms 95352 KB Output is correct
20 Correct 877 ms 99632 KB Output is correct
21 Correct 819 ms 98808 KB Output is correct
22 Correct 1076 ms 96580 KB Output is correct
23 Correct 642 ms 63944 KB Output is correct
24 Correct 676 ms 61444 KB Output is correct
25 Correct 598 ms 60504 KB Output is correct
26 Correct 568 ms 60432 KB Output is correct
27 Correct 11 ms 2280 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 2432 KB Output is correct
32 Correct 23 ms 4224 KB Output is correct
33 Correct 45 ms 4216 KB Output is correct
34 Correct 22 ms 4352 KB Output is correct
35 Correct 20 ms 4352 KB Output is correct
36 Correct 835 ms 95852 KB Output is correct
37 Correct 675 ms 98676 KB Output is correct
38 Correct 1206 ms 100064 KB Output is correct
39 Correct 766 ms 100692 KB Output is correct
40 Correct 826 ms 98804 KB Output is correct
41 Correct 530 ms 60404 KB Output is correct
42 Correct 532 ms 60404 KB Output is correct
43 Correct 742 ms 98548 KB Output is correct
44 Correct 6 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 6 ms 2304 KB Output is correct
49 Correct 18 ms 4224 KB Output is correct
50 Correct 19 ms 4340 KB Output is correct
51 Correct 22 ms 4352 KB Output is correct
52 Correct 21 ms 4352 KB Output is correct
53 Correct 580 ms 95892 KB Output is correct
54 Correct 831 ms 100056 KB Output is correct
55 Correct 816 ms 100572 KB Output is correct
56 Correct 871 ms 98612 KB Output is correct
57 Correct 1065 ms 101084 KB Output is correct
58 Correct 644 ms 95956 KB Output is correct
59 Correct 769 ms 98184 KB Output is correct