oj.uz

Submission #246567

# Submission time Handle Problem Language Result Execution time Memory
246567 2020-07-09T15:42:10 Z kimbj0709 Toll (BOI17_toll) C++14
8 / 100
 3000 ms 8308 KB 
#include<bits/stdc++.h>
using namespace std;
#define maxn 50050
#define f first
#define s second
vector<vector<pair<int,int> > > adj(maxn);
vector<int> top;
vector<int> visited(maxn,0);
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);
}
int32_t main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int k,no_of_vertex,no_of_edge,no_of_query;
    int input1,input2,input3;
    cin >> k >> no_of_vertex >> no_of_edge >> no_of_query;
    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());
    vector<int> dist(maxn,INT_MAX);
    for (int i = 0; i < top.size(); i++)
        ipos[top[i]] = i;
    for(int i=0;i<no_of_query;i++){
        cin >> input1 >> input2;
        for(int j=0;j<dist.size();j++){
            dist[j] = INT_MAX;
        }
        int pos = ipos[input1];
        // for(int j=0;j<top.size();j++){
        //     if(top[j]==input1){
        //         pos = j;
        //         break;
        //     }
        // }
        dist[input1] = 0;
        for(int j=pos;j<top.size();j++){
            if(dist[top[j]]==INT_MAX){
                continue;
            }
            for(auto kk:adj[top[j]]){
                dist[kk.first] = min(dist[kk.first],dist[top[j]]+kk.second);
            }
        }
 
        if(dist[input2]==INT_MAX){
            cout << -1 << "\n";
        }
        else{
            cout << dist[input2] << "\n";
        }
    }
 
 
}

Compilation message

toll.cpp: In function 'int32_t main()':
toll.cpp:37:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < top.size(); i++)
                     ~~^~~~~~~~~~~~
toll.cpp:41:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0;j<dist.size();j++){
                     ~^~~~~~~~~~~~
toll.cpp:52:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=pos;j<top.size();j++){
                       ~^~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3057 ms 7432 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 3094 ms 6368 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2048 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 6 ms 2048 KB Output is correct
4 Correct 6 ms 2048 KB Output is correct
5 Correct 7 ms 2176 KB Output is correct
6 Correct 8 ms 2176 KB Output is correct
7 Correct 9 ms 2176 KB Output is correct
8 Correct 12 ms 2304 KB Output is correct
9 Correct 15 ms 2304 KB Output is correct
10 Correct 33 ms 4992 KB Output is correct
11 Correct 150 ms 6904 KB Output is correct
12 Correct 175 ms 7796 KB Output is correct
13 Correct 191 ms 8308 KB Output is correct
14 Correct 155 ms 7284 KB Output is correct
15 Correct 96 ms 5240 KB Output is correct
16 Correct 89 ms 5144 KB Output is correct

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2048 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 6 ms 2048 KB Output is correct
4 Correct 6 ms 2048 KB Output is correct
5 Correct 7 ms 2176 KB Output is correct
6 Correct 8 ms 2176 KB Output is correct
7 Correct 9 ms 2176 KB Output is correct
8 Correct 12 ms 2304 KB Output is correct
9 Correct 15 ms 2304 KB Output is correct
10 Correct 33 ms 4992 KB Output is correct
11 Correct 150 ms 6904 KB Output is correct
12 Correct 175 ms 7796 KB Output is correct
13 Correct 191 ms 8308 KB Output is correct
14 Correct 155 ms 7284 KB Output is correct
15 Correct 96 ms 5240 KB Output is correct
16 Correct 89 ms 5144 KB Output is correct
17 Correct 2702 ms 7048 KB Output is correct
18 Correct 6 ms 2176 KB Output is correct
19 Correct 6 ms 2048 KB Output is correct
20 Correct 6 ms 2048 KB Output is correct
21 Correct 6 ms 2048 KB Output is correct
22 Correct 6 ms 2176 KB Output is correct
23 Correct 74 ms 2296 KB Output is correct
24 Correct 101 ms 2296 KB Output is correct
25 Correct 121 ms 2380 KB Output is correct
26 Correct 116 ms 2304 KB Output is correct
27 Correct 200 ms 5112 KB Output is correct
28 Execution timed out 3058 ms 7996 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

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