oj.uz

Submission #526702

# Submission time Handle Problem Language Result Execution time Memory
526702 2022-02-16T02:18:22 Z Hydroxic_Acid Autobus (COCI22_autobus) C++14
15 / 70
 1000 ms 3804 KB 
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
#define ll long long

int n, m, k, q;
vector<pair<int, int> > adjl[75];
int adjm[75][75];

bool check(ll time, int c, int d){
    queue<pair<int, pair<int, ll> > > q;
    q.push(make_pair(c, make_pair(0, 0)));
    while(!q.empty()){
        pair<int, pair<int, int> > iii = q.front(); q.pop();
        if(iii.second.first > k) continue;
        if(iii.second.second > time) continue;
        if(iii.first == d) return true;
        for(int i = 0; i < (int)adjl[iii.first].size(); i++){
            q.push(make_pair(adjl[iii.first][i].first, make_pair(iii.second.first + 1, iii.second.second + adjl[iii.first][i].second)));
        }
    }
    return false;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    memset(adjm, -1, sizeof(adjm));
    for(int i = 0; i < m; i++){
        int a, b, t; cin >> a >> b >> t;
        if(adjm[a][b] == -1) adjm[a][b] = t;
        else adjm[a][b] = min(adjm[a][b], t);
    }
    ll tmax = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(adjm[i][j] != -1){
                adjl[i].push_back(make_pair(j, adjm[i][j]));
                tmax += adjm[i][j];
            }
        }
    }
    cin >> k >> q;
    for(int i = 0; i < q; i++){
        int c, d; cin >> c >> d;
        ll lower = 0;
        ll upper = tmax;
        while(lower < upper){
            ll mid = (ll)(lower + upper) / 2;
            if(check(mid, c, d))upper = mid;
            else lower = mid + 1;
        }
        if(upper == tmax && !check(upper, c, d)) cout << -1;
        else cout << lower;
        cout << "\n";
    }
    
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 336 KB Output is correct
2 Correct 377 ms 340 KB Output is correct
3 Correct 668 ms 412 KB Output is correct
4 Execution timed out 1022 ms 580 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Execution timed out 1081 ms 3804 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 80 ms 336 KB Output is correct
8 Correct 377 ms 340 KB Output is correct
9 Correct 668 ms 412 KB Output is correct
10 Execution timed out 1022 ms 580 KB Time limit exceeded
11 Halted 0 ms 0 KB -