제출 #1092295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1092295		DeathIsAwe	Toll (BOI17_toll)	C++17	7 / 100	145 ms	150720 KiB

toll

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
int segment[131072];
const int mini = -1000000000;
int graph[50000][5][15][5];


void add(int pos, int a) {
    pos += 65536;
    segment[pos] = a;
    pos /= 2;
    while (pos > 0) {
        if (segment[2*pos + 1] == -1 || segment[2*pos] == -1) {
            segment[pos] = -1;
        } else {
            segment[pos] = segment[2*pos + 1] + segment[2*pos];
        }
        pos /= 2;
    }
}


int find(int a, int b) {
    a += 65536; b += 65536 - 1;
    int val = 0;
    while (a <= b) {
        if (a % 2 == 1) {
            if (segment[a] == -1) {
                val = -1; break;
            }
            val += segment[a++];
        }
        if (b % 2 == 0) {
            if (segment[b] == -1) {
                val = -1; break;
            }
            val += segment[b--];
        }
        a /= 2; b /= 2;
    }
    if (val == 0) {
        return -1;
    }
    return val;
}


int main() {
    int k, n, m, o, d1, d2, t; cin >> k >> n >> m >> o;
    if (k == 1) {
        for (int i=0;i<131072;i++) {
            segment[i] = -1;
        }
        for (int i=0;i<m;i++) {
            cin >> d1 >> d2 >> t;
            add(d1, t);
        }
        for (int i=0;i<o;i++) {
            cin >> d1 >> d2;
            cout << find(d1, d2) << '\n';
        }
        return 0;
    }
    int asdf = (n + k - 1) / k;
    for (int i=0;i<50000;i++) {
        for (int j=0;j<k;j++) {
            for (int x=0;x<15;x++) {
                for (int y=0;y<k;y++) {
                    graph[i][j][x][y] = mini;
                }
            }
        }
    }
    for (int i=0;i<m;i++) {
        cin >> d1 >> d2 >> t;
        graph[d1/k][d1%k][0][d2%k] = t;
    }
    int add = 1;
    for (int i=1;i<15;i++) {
        for (int j=0;j<asdf;j++) {
            for (int x=0;x<k;x++) {
                for (int y=0;y<k;y++) {
                    for (int z=0;z<k;z++) {
                        graph[j][x][i][y] = max(graph[j][x][i][y], graph[j][x][i-1][z] + graph[j + add][z][i-1][y]);
                        if (graph[j][x][i-1][z] + graph[j + add][z][i-1][y] < 0) {
                            graph[j][x][i][y] = mini;
                        }
                    }
                }
            }
        }
        add *= 2;
    }


    int ans[5], newans[5], pow2, pow2val, diff, amodk, adivk, bmodk, bdivk;
    for (int i=0;i<o;i++) {
        cin >> d1 >> d2;
        amodk = d1 % k; adivk = d1 / k;
        bmodk = d2 % k; bdivk = d2 / k;
        pow2val = 16384; pow2 = 14;
        diff = bdivk - adivk;
        if (diff <= 0) {
            cout << -1 << '\n'; continue;
        }
        while (true) {
            if (diff < pow2val) {
                pow2val /= 2;
                pow2 -= 1;
                continue;
            }
            diff -= pow2val;
            for (int j=0;j<k;j++) {
                ans[i] = graph[adivk][amodk][pow2][j];
            }
            adivk += pow2val;
            pow2val /= 2;
            pow2 -= 1;
            break;
        }


        while (diff > 0) {
            if (diff < pow2val) {
                pow2val /= 2;
                pow2 -= 1;
                continue;
            }
            diff -= pow2val;
            for (int j=0;j<k;j++) {
                newans[j] = 1000000000;
                for (int x=0; x<k;x++) {
                    if (graph[adivk][x][pow2][j] > 0 && ans[x] > 0) {
                        newans[j] = min(newans[j], graph[adivk][x][pow2][j] + ans[x]);
                    }
                }
            }
            for (int j=0;j<k;j++) {
                ans[j] = newans[j];
            }
            adivk += pow2val;
            pow2val /= 2;
            pow2 -= 1;
        }
        cout << ans[bmodk] << '\n';
    }
}

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