oj.uz

Submission #533473

# Submission time Handle Problem Language Result Execution time Memory
533473 2022-03-06T06:25:51 Z Slavita Autobus (COCI22_autobus) C++14
15 / 70
 1000 ms 396704 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 1e5 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, k, q;
bool mrk[N];
vector<pair<ll, ll>> g[N];
priority_queue<pair<pair<ll, ll>, ll>> Q;

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> m;
    for (int i = 1; i <= m; i++){
        ll a, b, t;
        cin >> a >> b >> t;
        g[a].pb({b, t});
    }
    cin >> k >> q;
    while(q--){
        ll start, finish;
        cin >> start >> finish;
        Q.push({{0, 0}, start});

        ll ans = llbig;

        for (int i = 1; i <= n; i++) mrk[i] = 0;
        while(!Q.empty()){
            ll v = Q.top().se;
            ll time = -Q.top().fi.fi;
            ll kol = -Q.top().fi.se;
            Q.pop();

            if (kol > k) {continue;}
            if (v == finish){
                ans = min(ans, time);
                continue;
            }

            for (int i = 0; i < si(g[v]); i++){
                ll u = g[v][i].fi;
                ll c = g[v][i].se;
                if (mrk[u]) continue;
                Q.push({{-time-c, -kol-1}, u});
            }
        }

        cout << (ans == llbig ? -1 : ans) << en;
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 14 ms 2800 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 125 ms 3088 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2636 KB Output is correct
2 Correct 180 ms 2692 KB Output is correct
3 Execution timed out 1094 ms 2764 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 14 ms 2800 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 125 ms 3088 KB Output is correct
7 Execution timed out 1102 ms 396704 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 14 ms 2800 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 125 ms 3088 KB Output is correct
7 Correct 22 ms 2636 KB Output is correct
8 Correct 180 ms 2692 KB Output is correct
9 Execution timed out 1094 ms 2764 KB Time limit exceeded
10 Halted 0 ms 0 KB -