oj.uz

답안 #747136

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747136 2023-05-23T16:41:23 Z GrindMachine Toll (BOI17_toll) C++17
46 / 100
 3000 ms 6900 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);

    while(q--){
        int u,v; cin >> u >> v;
        fill(all(dp),inf1);
        dp[u] = 0;

        for(int i = u; i <= v; ++i){
            if(dp[i] >= inf1) conts;
            for(auto [j, w] : adj[i]){
                amin(dp[j], dp[i] + w);
            }
        }

        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
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2728 ms 4488 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 3 ms 1504 KB Output is correct
8 Correct 413 ms 4176 KB Output is correct
9 Correct 285 ms 4072 KB Output is correct
10 Correct 236 ms 1752 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3045 ms 4980 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1496 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 3 ms 1492 KB Output is correct
8 Correct 3 ms 1620 KB Output is correct
9 Correct 3 ms 1504 KB Output is correct
10 Correct 23 ms 4052 KB Output is correct
11 Correct 81 ms 4688 KB Output is correct
12 Correct 86 ms 6264 KB Output is correct
13 Correct 101 ms 6768 KB Output is correct
14 Correct 80 ms 5456 KB Output is correct
15 Correct 49 ms 4084 KB Output is correct
16 Correct 42 ms 4024 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1496 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 3 ms 1492 KB Output is correct
8 Correct 3 ms 1620 KB Output is correct
9 Correct 3 ms 1504 KB Output is correct
10 Correct 23 ms 4052 KB Output is correct
11 Correct 81 ms 4688 KB Output is correct
12 Correct 86 ms 6264 KB Output is correct
13 Correct 101 ms 6768 KB Output is correct
14 Correct 80 ms 5456 KB Output is correct
15 Correct 49 ms 4084 KB Output is correct
16 Correct 42 ms 4024 KB Output is correct
17 Correct 1065 ms 4832 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1496 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 5 ms 1548 KB Output is correct
24 Correct 15 ms 1612 KB Output is correct
25 Correct 23 ms 1620 KB Output is correct
26 Correct 20 ms 1576 KB Output is correct
27 Correct 140 ms 4056 KB Output is correct
28 Correct 1256 ms 6392 KB Output is correct
29 Correct 1245 ms 6900 KB Output is correct
30 Correct 744 ms 5744 KB Output is correct

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2728 ms 4488 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 3 ms 1504 KB Output is correct
8 Correct 413 ms 4176 KB Output is correct
9 Correct 285 ms 4072 KB Output is correct
10 Correct 236 ms 1752 KB Output is correct
11 Execution timed out 3045 ms 4980 KB Time limit exceeded
12 Halted 0 ms 0 KB -