제출 #441870

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441870		ljuba	Toll (BOI17_toll)	C++17	100 / 100	195 ms	282880 KiB

toll

#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 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44