oj.uz

Submission #979117

# Submission time Handle Problem Language Result Execution time Memory
979117 2024-05-10T09:12:48 Z chautanphat Toll (BOI17_toll) C++11
0 / 100
 3000 ms 30800 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e4;

struct query
{
    int a, b, id, ans;
} queries[N];
int k, n, m, o, cost[N][5][5];

void dnc(int l, int r, int level = 0)
{
    if (l == r) return;
    int mid = (l+r)/2, L[n][k][k], R[n][k][k];
    for (int i = l; i <= r; i++)
        for (int a = 0; a < k; a++)
            for (int b = 0; b < k; b++)
                L[i][a][b] = R[i][a][b] = 1e9;
    for (int a = 0; a < k; a++)
        for (int b = 0; b < k; b++)
            L[mid][a][b] = 0;
    for (int i = mid-1; i >= l; i--)
        for (int a = 0; a < k; a++)
            for (int b = 0; b < k; b++)
                for (int c = 0; c < k; c++)
                    L[i][a][c] = min(L[i][a][c], L[i+1][b][c]+cost[i][a][b]);
    for (int a = 0; a < k; a++)
        for (int b = 0; b < k; b++)
            R[mid+1][a][b] = cost[mid][a][b];
    for (int i = mid+2; i <= r; i++)
        for (int a = 0; a < k; a++)
            for (int b = 0; b < k; b++)
                for (int c = 0; c < k; c++)
                    R[i][c][a] = min(R[i][c][a], R[i-1][c][b]+cost[i-1][b][a]);
    for (int i = 0; i < o; i++)
    {
        int a = queries[i].a, b = queries[i].b;
        if (l <= a/k && a/k <= mid && mid+1 <= b/k && b/k <= r)
            for (int j = 0; j < k; j++)
                queries[i].ans = min(queries[i].ans, L[a/k][a%k][j]+R[b/k][j][b%k]);
    }

    dnc(l, mid, level+1);
    dnc(mid+1, r, level+1);
}

int main()
{    
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> k >> n >> m >> o;

    for (int i = 0; i < n; i++)
        for (int a = 0; a < k; a++)
            for (int b = 0; b < k; b++)
                cost[i][a][b] = 1e9;

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

    for (int i = 0; i < o; i++)
        cin >> queries[i].a >> queries[i].b, queries[i].id = i, queries[i].ans = 1e9;

    dnc(0, n/k);

    for (int i = 0; i < o; i++)
        cout << (queries[i].ans == 1e9 ? -1 : queries[i].ans) << '\n';
    return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3010 ms 12632 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3010 ms 12632 KB Time limit exceeded
2 Halted 0 ms 0 KB -