oj.uz

Submission #924725

# Submission time Handle Problem Language Result Execution time Memory
924725 2024-02-09T14:56:39 Z a_l_i_r_e_z_a Toll (BOI17_toll) C++17
0 / 100
 50 ms 30040 KB 
// In the name of God
// Hope is last to die

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
// #define int long long    
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())

const int maxn = 1e5, lg = 15;
const int inf = 1e9 + 7, mod = 1e9 + 7;
int k, n, m, q;

struct D{
    int node[5];
    D(){
        for(int i = 0; i < 5; i++) node[i] = inf;
    }
} dp[maxn][lg];

D merge(D a, int u, int b){
    int aa[5];
    for(int i = 0; i < k; i++){
        int x = inf;
        for(int j = 0; j < k; j++) smin(x, a.node[j] + dp[u * k + j][b].node[i]);
        aa[i] = x;
    }
    for(int i = 0; i < k; i++) a.node[i] = aa[i];
    return a;
}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> k >> n >> m >> q;
    for(int i = 0; i < m; i++){
        int u, v, w; cin >> u >> v >> w;
        dp[u][0].node[v % k] = w;
    }
    for(int i = n - 1; i >= 0; i--){
        for(int j = 1; j < lg; j++){
            dp[i][j] = merge(dp[i][j - 1], (i / k) + (1ll << (j - 1)), j - 1);
        }
    }
    while(q--){
        int u, v; cin >> u >> v;
        if(u / k >= v / k){
            cout << -1 << '\n';
            continue;
        }
        int x = u / k + 1, y = v / k;
        D ans = dp[u][0];
        for(int i = 0; i < lg; i++){
            if((y - x) & (1ll << i)){
                ans = merge(ans, x, i);
                x += 1ll << i;
            }
        }
        if(ans.node[v % k] >= inf) cout << -1 << '\n';
        else cout << ans.node[v % k] << '\n';
    }

    return 0;
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 29788 KB Output is correct
2 Correct 7 ms 29788 KB Output is correct
3 Correct 6 ms 29788 KB Output is correct
4 Correct 6 ms 29788 KB Output is correct
5 Correct 7 ms 29788 KB Output is correct
6 Correct 6 ms 29784 KB Output is correct
7 Correct 9 ms 29788 KB Output is correct
8 Correct 9 ms 29864 KB Output is correct
9 Incorrect 39 ms 29784 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29784 KB Output is correct
2 Correct 6 ms 29788 KB Output is correct
3 Correct 6 ms 29788 KB Output is correct
4 Correct 6 ms 30040 KB Output is correct
5 Correct 6 ms 29788 KB Output is correct
6 Correct 6 ms 29788 KB Output is correct
7 Correct 7 ms 29564 KB Output is correct
8 Correct 8 ms 29788 KB Output is correct
9 Correct 7 ms 29812 KB Output is correct
10 Incorrect 41 ms 29784 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29784 KB Output is correct
2 Correct 6 ms 29788 KB Output is correct
3 Correct 6 ms 29788 KB Output is correct
4 Correct 6 ms 30040 KB Output is correct
5 Correct 6 ms 29788 KB Output is correct
6 Correct 6 ms 29788 KB Output is correct
7 Correct 7 ms 29564 KB Output is correct
8 Correct 8 ms 29788 KB Output is correct
9 Correct 7 ms 29812 KB Output is correct
10 Incorrect 41 ms 29784 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

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