제출 #1118770

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1118770		gdragon	Toll (BOI17_toll)	C++17	7 / 100	363 ms	361856 KiB

toll

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 5e4 + 5;
const int M = 1e6 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
struct DSU {
    int n;
    vector<int> par;
    DSU(int _n = 0) {
        n = _n;
        par.assign(n + 2, -1);
    }
    int root(int v) {
        return par[v] < 0 ? v : (par[v] = root(par[v]));
    }
    bool join(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (par[y] < par[x]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        return true;
    }
} dsu;
struct Edge {
    int u, v, c;
    Edge(int _u = 0, int _v = 0, int _c = 0) {
        u = _u; v = _v; c = _c;
    }
} e[M];
vector<ii> adj[N];
int n, K, m, q;
void read() {
    cin >> K >> n >> m >> q;
    dsu = DSU(n);
    for(int i = 1; i <= m; i++) {
        int u, v, c; cin >> u >> v >> c;
        assert(v - u < 2 * K);
        adj[u].push_back({v, c});
        dsu.join(u, v);
        if (K == 1) assert(v == u + 1);
        e[i] = Edge(u, v, c);
    }
}
long long dp[N];
int timer = 0;
long long backtrack(int u, int t) {
    if (u == t) return 0;
    if (u / K >= t / K) return INF;
    long long &res = dp[u];
    if (res != -1) return res;
    res = INF;
    for(auto [v, c]: adj[u]) {
        minimize(res, backtrack(v, t) + c);
    }
    return res;
}
// void solve() {
//     vector<long long> d(n + 2, 0);
//     if (K == 1) {
//         for(int i = 1; i <= m; i++) d[e[i].v] = e[i].c;
//         for(int i = 1; i <= n; i++) d[i] += d[i - 1];
//     }
//     vector<long long> d0(n + 1, INF);
//     d0[0] = 0;
//     priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> heap;
//     heap.push({0, 0});
//     while(!heap.empty()) {
//         auto tmp = heap.top(); heap.pop();
//         long long du = tmp.fi;
//         int u = tmp.se;
//         if (du != d0[u]) continue;
//         for(auto [v, c]: adj[u]) if (minimize(d0[v], du + c)) {
//             heap.push({d0[v], v});
//         }
//     }
//     while(q--) {
//         int u, v; cin >> u >> v;
//         if (u == v) {
//             cout << 0 << endl;
//             continue;
//         }
//         if (u > v || u/K == v/K || dsu.root(u) != dsu.root(v)) {
//             cout << -1 << endl;
//             continue;
//         }
//         if (K == 1) {
//             cout << d[v] - d[u] << endl;
//             continue;
//         }
//         if (u == 0) {
//             cout << (d0[v] == INF ? -1 : d0[v]) << endl;
//             continue;
//         }
//         for(int i = 0; i < n; i++) dp[i] = -1;
//         long long ans = backtrack(u, v);
//         cout << (ans == INF ? -1 : ans) << endl;
//     }
// }
#define LOG 16
long long f[N][LOG + 2][7][7];
void prepare() {
    memset(f, 0x3f, sizeof(f));
    // for(int i = 0; i < n; i++) f[i][0][i % K][i % K] = 0;
    for(int i = 1; i <= m; i++) {
        minimize(f[e[i].u / K][0][e[i].u % K][e[i].v % K], e[i].c);
    }
    int block = (n + 1) / K + 1;
    for(int j = 1; j <= LOG; j++) {
        for(int i = 0; i + MASK(j) - 1 < block; i++) {
            for(int r1 = 0; r1 < K; r1++) {
                for(int r2 = 0; r2 < K; r2++) {
                    for(int x = 0; x < K; x++) {
                        if (f[i][j - 1][r1][x] < INF && 
                        f[i + MASK(j - 1)][j - 1][x][r2] < INF) {
                            minimize(f[i][j][r1][r2], f[i][j - 1][r1][x] + f[i + MASK(j - 1)][j - 1][x][r2]);
                        }
                    }
                }
            }
        }
    }
    // cerr << f[0][1][0][2] << endl;
}
long long get(int u, int v) {
    int d = (v / K) - (u / K);
    if (d < 0) return -1;
    if (d == 0 && u != v) return -1;
    vector<vector<long long>> ans(2, vector<long long>(K, 0));
    int bl1 = u / K;
    ans[1][u % K] = 0;
    for(int i = LOG; i >= 0; i--) if (GETBIT(d, i)) {
        swap(ans[0], ans[1]);
        for(int j = 0; j < K; j++) ans[1][j] = INF; 
        for(int r1 = 0; r1 < K; r1++) {
            for(int r2 = 0; r2 < K; r2++) {
                if (f[bl1][i][r1][r2] < INF && ans[0][r1] < INF) {
                    ans[1][r2] = min(ans[1][r2], ans[0][r1] + f[bl1][i][r1][r2]);
                }
            }
        }
        bl1 += MASK(i);
    }
    return (ans[1][v % K] == INF ? -1 : ans[1][v % K]);
}
void solve() {
    prepare();
    while(q--) {
        int u, v; cin >> u >> v;
        cout << get(u, v) << endl;
    }
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
   if (fopen(TASK".inp", "r")) {
       freopen(TASK".inp", "r", stdin);
       freopen(TASK".out", "w", stdout);
   }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

// rmq - rmq2d
// hash
// fw - fw2d
// segtree

컴파일 시 표준 에러 (stderr) 메시지

toll.cpp: In function 'int main()':
toll.cpp:173:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  173 |        freopen(TASK".inp", "r", stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:174:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  174 |        freopen(TASK".out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 31
• Subtask 5: 0 / 44