oj.uz

Submission #441870

# Submission time Handle Problem Language Result Execution time Memory
441870 2021-07-06T12:40:06 Z ljuba Toll (BOI17_toll) C++17
100 / 100
 195 ms 282880 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int mxN = 1e5 + 12;
const int LG = 20;

ll dp[LG][mxN][6][6];


const ll INF = 1e18 + 12;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int k, n, m, q;
    cin >> k >> n >> m >> q;

    for(int _ = 0; _ < LG; ++_) {
        for(int i = 0; i <= n/k; ++i) {
            for(int j = 0; j < k; ++j) {
                for(int l = 0; l < k; ++l) {
                    dp[_][i][j][l] = INF;
                }
            }
        }
    }

    for(int i = 0; i < m; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        dp[0][a/k][a%k][b%k] = c;
    }

    for(int iter = 1; iter < LG; ++iter) {
        for(int i = 0; i <= n/k; ++i) {
            for(int j = 0; j < k; ++j) {
                for(int l = 0; l < k; ++l) {
                    for(int u = 0; u < k; ++u) {
                        if(i+(1<<(iter-1)) > n/k)
                            continue;
                        ckmin(dp[iter][i][j][l], dp[iter-1][i][j][u] + dp[iter-1][i+(1<<(iter-1))][u][l]);
                    }
                }
            }
        }
    }

    while(q--) {
        int a, b;
        cin >> a >> b;
        if(a == b) {
            cout << 0 << nl;
            continue;
        }
        if(a / k >= b / k) {
            cout << -1 << nl;
            continue;
        }

        vll temp(k, INF);
        temp[a%k] = 0;

        int raz = b/k - a/k;

        int mod = b % k;

        a /= k;
        b /= k;

        for(int i = LG-1; ~i; --i) {
            if(raz & (1<<i)) {
                vll temp2(k, INF);
                for(int j = 0; j < k; ++j) {
                    for(int l = 0; l < k; ++l) {
                        ckmin(temp2[l], temp[j] + dp[i][a][j][l]);
                    }
                }
                temp = temp2;
                a += (1<<i);
            }
        }

        if(temp[mod] >= INF) {
            cout << -1 << nl;
        } else {
            cout << temp[mod] << nl;
        }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 282692 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 4 ms 6092 KB Output is correct
6 Correct 4 ms 6092 KB Output is correct
7 Correct 5 ms 6092 KB Output is correct
8 Correct 168 ms 282880 KB Output is correct
9 Correct 166 ms 282728 KB Output is correct
10 Correct 147 ms 282308 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 141824 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 9 ms 6220 KB Output is correct
8 Correct 8 ms 3412 KB Output is correct
9 Correct 161 ms 282752 KB Output is correct
10 Correct 121 ms 94824 KB Output is correct
11 Correct 128 ms 141852 KB Output is correct
12 Correct 101 ms 94916 KB Output is correct
13 Correct 104 ms 34628 KB Output is correct
14 Correct 82 ms 57284 KB Output is correct
15 Correct 85 ms 34684 KB Output is correct
16 Correct 84 ms 34640 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 4 ms 6092 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 4 ms 1484 KB Output is correct
9 Correct 3 ms 1868 KB Output is correct
10 Correct 156 ms 282696 KB Output is correct
11 Correct 117 ms 141716 KB Output is correct
12 Correct 113 ms 94856 KB Output is correct
13 Correct 111 ms 94820 KB Output is correct
14 Correct 102 ms 94736 KB Output is correct
15 Correct 96 ms 34720 KB Output is correct
16 Correct 78 ms 34704 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 4 ms 6092 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 4 ms 1484 KB Output is correct
9 Correct 3 ms 1868 KB Output is correct
10 Correct 156 ms 282696 KB Output is correct
11 Correct 117 ms 141716 KB Output is correct
12 Correct 113 ms 94856 KB Output is correct
13 Correct 111 ms 94820 KB Output is correct
14 Correct 102 ms 94736 KB Output is correct
15 Correct 96 ms 34720 KB Output is correct
16 Correct 78 ms 34704 KB Output is correct
17 Correct 126 ms 141824 KB Output is correct
18 Correct 1 ms 444 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 5 ms 6092 KB Output is correct
24 Correct 4 ms 3276 KB Output is correct
25 Correct 6 ms 1612 KB Output is correct
26 Correct 5 ms 1868 KB Output is correct
27 Correct 157 ms 282704 KB Output is correct
28 Correct 120 ms 94920 KB Output is correct
29 Correct 115 ms 94812 KB Output is correct
30 Correct 107 ms 94792 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 282692 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 4 ms 6092 KB Output is correct
6 Correct 4 ms 6092 KB Output is correct
7 Correct 5 ms 6092 KB Output is correct
8 Correct 168 ms 282880 KB Output is correct
9 Correct 166 ms 282728 KB Output is correct
10 Correct 147 ms 282308 KB Output is correct
11 Correct 136 ms 141824 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 9 ms 6220 KB Output is correct
18 Correct 8 ms 3412 KB Output is correct
19 Correct 161 ms 282752 KB Output is correct
20 Correct 121 ms 94824 KB Output is correct
21 Correct 128 ms 141852 KB Output is correct
22 Correct 101 ms 94916 KB Output is correct
23 Correct 104 ms 34628 KB Output is correct
24 Correct 82 ms 57284 KB Output is correct
25 Correct 85 ms 34684 KB Output is correct
26 Correct 84 ms 34640 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 0 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 4 ms 6092 KB Output is correct
33 Correct 3 ms 3276 KB Output is correct
34 Correct 4 ms 1484 KB Output is correct
35 Correct 3 ms 1868 KB Output is correct
36 Correct 156 ms 282696 KB Output is correct
37 Correct 117 ms 141716 KB Output is correct
38 Correct 113 ms 94856 KB Output is correct
39 Correct 111 ms 94820 KB Output is correct
40 Correct 102 ms 94736 KB Output is correct
41 Correct 96 ms 34720 KB Output is correct
42 Correct 78 ms 34704 KB Output is correct
43 Correct 126 ms 141824 KB Output is correct
44 Correct 1 ms 444 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 1 ms 460 KB Output is correct
48 Correct 1 ms 460 KB Output is correct
49 Correct 5 ms 6092 KB Output is correct
50 Correct 4 ms 3276 KB Output is correct
51 Correct 6 ms 1612 KB Output is correct
52 Correct 5 ms 1868 KB Output is correct
53 Correct 157 ms 282704 KB Output is correct
54 Correct 120 ms 94920 KB Output is correct
55 Correct 115 ms 94812 KB Output is correct
56 Correct 107 ms 94792 KB Output is correct
57 Correct 152 ms 71320 KB Output is correct
58 Correct 169 ms 282816 KB Output is correct
59 Correct 150 ms 141948 KB Output is correct