oj.uz

Submission #245590

# Submission time Handle Problem Language Result Execution time Memory
245590 2020-07-06T22:06:08 Z Tc14 Toll (BOI17_toll) C++17
0 / 100
 1000 ms 5112 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ve vector
typedef long long ll;

const int INF = 1e9;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int k, n, m, o, a, b, t, rows, compRows, index;
    ve<ve<pair<int, int>>> Graph;
    ve<tuple<int, int, int, int>> DiffComp;
    ve<tuple<int, int, int>> SameComp;
    ve<int> Ans, T, TNew;
    ve<ve<int>> TF, TFNew, TB, TBNew;

    cin >> k >> n >> m >> o;
    Graph = ve<ve<pair<int, int>>>(n);
    Ans = ve<int>(o);

    if (n % k == 0) rows = n / k;
    else rows = n / k + 1;

    compRows = sqrt(rows);

    for (int i = 0; i < m; i++) {
        cin >> a >> b >> t;
        Graph[a].push_back({b, t});
    }

    for (int i = 0; i < o; i++) {
        cin >> a >> b;
        if (b >= a) {
            int ca = a / k / compRows;
            int cb = b / k / compRows;
            if (ca == cb) SameComp.push_back({a, b, i});
            else DiffComp.push_back({ca, b, a, i});
        }
    }

    for (tuple<int, int, int> p : SameComp) {
        tie(a, b, index) = p;
        int r = a / k;
        T = ve<int>(k, INF);
        T[a % k] = 0;

        while (r != b / k) {
            TNew = ve<int>(k, INF);

            for (int i = 0; i < k; i++) {
                if (T[i] != INF) {
                    for (pair<int, int> e : Graph[r * k + i]) {
                        int tNew = T[i] + e.second;
                        TNew[e.first % k] = min(TNew[e.first % k], tNew);
                    }
                }
            }
            T = TNew;
            r++;
        }

        if (T[b % k] == INF) Ans[index] = -1;
        else Ans[index] = T[b % k];
    }

    sort(DiffComp.begin(), DiffComp.end());

    auto it = DiffComp.begin();

    while (it != DiffComp.end()) {

        int c = get<0>(*it);
        int rf = (c + 1) * compRows - 1;

        TF = ve<ve<int>>(k, ve<int>(k, INF));
        for (int i = 0; i < k; i++) TF[i][i] = 0;

        while (it != DiffComp.end() && get<0>(*it) == c) {
            b = get<1>(*it);
            a = get<2>(*it);
            index = get<3>(*it);

            while (rf != b / k) {
                TFNew = ve<ve<int>>(k, ve<int>(k, INF));
                for (int i = 0; i < k; i++) {
                    for (int j = 0; j < k; j++) {
                        if (TF[i][j] != INF) {
                            for (pair<int, int> e : Graph[rf * k + j]) {
                                int tNew = TF[i][j] + e.second;
                                TFNew[i][e.first % k] = min(TFNew[i][e.first % k], tNew);
                            }
                        }
                    }
                }
                TF = TFNew;
                rf++;
            }

            int rb = (c + 1) * compRows - 1;
            TB = TF;

            while (rb != a / k) {
                rb--;
                TBNew = ve<ve<int>>(k, ve<int>(k, INF));
                for (int i = 0; i < k; i++) {
                    for (pair<int, int> e : Graph[rb * k + i]) {
                        for (int j = 0; j < k; j++) {
                            int tNew = TF[e.first % k][j] + e.second;
                            TBNew[i][j] = min(TBNew[i][j], tNew);
                        }
                    }
                }
                TB = TBNew;
            }

            if (TB[a % k][b % k] == INF) Ans[index] = -1;
            else Ans[index] = TB[a % k][b % k];
            it++;
        }

    }

    for (int i = 0; i < o; i++) {
        cout << Ans[i] << endl;
    }

    return 0;
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Incorrect 7 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Incorrect 7 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

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