oj.uz

Submission #747138

# Submission time Handle Problem Language Result Execution time Memory
747138 2023-05-23T16:43:24 Z GrindMachine Toll (BOI17_toll) C++17
10 / 100
 50 ms 6752 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e4 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<pii> adj[N];

void solve(int test_case)
{
    int k,n,m,q; cin >> k >> n >> m >> q;
    rep(i,m){
        int u,v,w; cin >> u >> v >> w;
        adj[u].pb({v,w});
    }

    vector<int> dp(n,inf1);
    dp[0] = 0;

    rep(i,n){
        if(dp[i] >= inf1) conts;
        for(auto [j, w] : adj[i]){
            amin(dp[j], dp[i] + w);
        }
    }

    while(q--){
        int u,v; cin >> u >> v;
        int ans = dp[v];
        if(ans == inf1) ans = -1;
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 3284 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3308 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1496 KB Output is correct
7 Correct 3 ms 1636 KB Output is correct
8 Correct 3 ms 1636 KB Output is correct
9 Correct 17 ms 4064 KB Output is correct
10 Correct 50 ms 6496 KB Output is correct
11 Correct 36 ms 5000 KB Output is correct
12 Correct 33 ms 4356 KB Output is correct
13 Correct 49 ms 6752 KB Output is correct
14 Correct 32 ms 4668 KB Output is correct
15 Correct 24 ms 4048 KB Output is correct
16 Correct 24 ms 4044 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 3284 KB Output isn't correct
2 Halted 0 ms 0 KB -