oj.uz

Submission #423010

# Submission time Handle Problem Language Result Execution time Memory
423010 2021-06-10T15:43:00 Z blue Toll (BOI17_toll) C++17
100 / 100
 390 ms 19256 KB 
#include <iostream>
#include <vector>
using namespace std;

const int maxN = 50000;
const int maxK = 5;
const int INF = 1e9;
const int no_ranges_used = -1;

//mod, cities, edges, orders
int K, N, M, O;

vector<int> edge[maxN];
vector<int> wt[maxN];

int X[maxK];
int curr_r = no_ranges_used;
vector< vector<int> > sample_mindist;

struct segtree
{
    int l; //l and r are over [i/K]
    int r;

    vector< vector<int> > minDist = sample_mindist;

    segtree* left = NULL;
    segtree* right = NULL;

    segtree()
    {
        ;
    }

    segtree(int L, int R)
    {
        l = L;
        r = R;

        if(l == r)
        {
            for(int m = 0; m < K; m++)
                minDist[m][m] = 0;
        }
        else
        {
            int m = (l+r)/2;
            left = new segtree(l, m);
            right = new segtree(m+1, r);

            for(int a = K*m; a < K*(m+1); a++)
            {
                for(int i = 0; i < edge[a].size(); i++)
                {
                    int b = edge[a][i];
                    int t = wt[a][i];

                    for(int m1 = 0; m1 < K; m1++)
                    {
                        for(int m2 = 0; m2 < K; m2++)
                        {
                            minDist[m1][m2] = min(minDist[m1][m2], left->minDist[m1][a%K] + t + right->minDist[b%K][m2]);
                        }
                    }
                }
            }
        }
    }

    void query(int A, int B) //ans is in X[B % K]
    {
        if(l == 0/K && r == (N-1)/K)
        {
            curr_r = no_ranges_used;
        }

        if(B/K < l || r < A/K) return;
        else if(A/K <= l && r <= B/K)
        {
            if(curr_r == no_ranges_used)
            {
                for(int m = 0; m < K; m++)
                {
                    X[m] = minDist[A%K][m];
                }
            }
            else
            {
                vector<int> Y(K, INF);

                for(int a = K*(l-1); a < K*l; a++)
                {
                    for(int i = 0; i < edge[a].size(); i++)
                    {
                        int b = edge[a][i];
                        int t = wt[a][i];

                        for(int m2 = 0; m2 < K; m2++)
                        {
                            Y[m2] = min(Y[m2], X[a % K] + t + minDist[b % K][m2]);
                        }
                    }
                }

                for(int m = 0; m < K; m++)
                    X[m] = Y[m];

            }
            curr_r = B%K;
        }
        else
        {
            left->query(A, B);
            right->query(A, B);
        }
    }
};

int main()
{
    cin >> K >> N >> M >> O;

    sample_mindist = vector< vector<int> >(K, vector<int>(K, INF));

    for(int e = 1; e <= M; e++)
    {
        int a, b, t;
        cin >> a >> b >> t;

        edge[a].push_back(b);
        wt[a].push_back(t);
    }

    segtree S(0/K, (N-1)/K);

    for(int o = 1; o <= O; o++)
    {
        int a, b;
        cin >> a >> b;

        S.query(a, b);
        if(X[b % K] >= INF) cout << "-1\n";
        else cout << X[b % K] << '\n';
    }
}

Compilation message

toll.cpp: In constructor 'segtree::segtree(int, int)':
toll.cpp:53:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |                 for(int i = 0; i < edge[a].size(); i++)
      |                                ~~^~~~~~~~~~~~~~~~
toll.cpp: In member function 'void segtree::query(int, int)':
toll.cpp:93:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |                     for(int i = 0; i < edge[a].size(); i++)
      |                                    ~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 19256 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 6 ms 2892 KB Output is correct
6 Correct 7 ms 2892 KB Output is correct
7 Correct 6 ms 2892 KB Output is correct
8 Correct 141 ms 19200 KB Output is correct
9 Correct 140 ms 19024 KB Output is correct
10 Correct 72 ms 15180 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 16764 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 31 ms 3056 KB Output is correct
8 Correct 31 ms 3004 KB Output is correct
9 Correct 123 ms 19172 KB Output is correct
10 Correct 237 ms 15792 KB Output is correct
11 Correct 179 ms 16812 KB Output is correct
12 Correct 182 ms 14524 KB Output is correct
13 Correct 269 ms 12192 KB Output is correct
14 Correct 131 ms 10560 KB Output is correct
15 Correct 134 ms 9804 KB Output is correct
16 Correct 128 ms 9736 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 2892 KB Output is correct
7 Correct 4 ms 2892 KB Output is correct
8 Correct 9 ms 2916 KB Output is correct
9 Correct 6 ms 2892 KB Output is correct
10 Correct 84 ms 19040 KB Output is correct
11 Correct 139 ms 16604 KB Output is correct
12 Correct 185 ms 15812 KB Output is correct
13 Correct 223 ms 15972 KB Output is correct
14 Correct 165 ms 15248 KB Output is correct
15 Correct 116 ms 9684 KB Output is correct
16 Correct 116 ms 9768 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 2892 KB Output is correct
7 Correct 4 ms 2892 KB Output is correct
8 Correct 9 ms 2916 KB Output is correct
9 Correct 6 ms 2892 KB Output is correct
10 Correct 84 ms 19040 KB Output is correct
11 Correct 139 ms 16604 KB Output is correct
12 Correct 185 ms 15812 KB Output is correct
13 Correct 223 ms 15972 KB Output is correct
14 Correct 165 ms 15248 KB Output is correct
15 Correct 116 ms 9684 KB Output is correct
16 Correct 116 ms 9768 KB Output is correct
17 Correct 157 ms 16660 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 12 ms 2908 KB Output is correct
24 Correct 14 ms 2960 KB Output is correct
25 Correct 20 ms 2836 KB Output is correct
26 Correct 18 ms 2868 KB Output is correct
27 Correct 106 ms 19012 KB Output is correct
28 Correct 222 ms 15864 KB Output is correct
29 Correct 238 ms 15992 KB Output is correct
30 Correct 217 ms 15356 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 19256 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 6 ms 2892 KB Output is correct
6 Correct 7 ms 2892 KB Output is correct
7 Correct 6 ms 2892 KB Output is correct
8 Correct 141 ms 19200 KB Output is correct
9 Correct 140 ms 19024 KB Output is correct
10 Correct 72 ms 15180 KB Output is correct
11 Correct 166 ms 16764 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 31 ms 3056 KB Output is correct
18 Correct 31 ms 3004 KB Output is correct
19 Correct 123 ms 19172 KB Output is correct
20 Correct 237 ms 15792 KB Output is correct
21 Correct 179 ms 16812 KB Output is correct
22 Correct 182 ms 14524 KB Output is correct
23 Correct 269 ms 12192 KB Output is correct
24 Correct 131 ms 10560 KB Output is correct
25 Correct 134 ms 9804 KB Output is correct
26 Correct 128 ms 9736 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 2 ms 2636 KB Output is correct
29 Correct 2 ms 2636 KB Output is correct
30 Correct 2 ms 2636 KB Output is correct
31 Correct 2 ms 2636 KB Output is correct
32 Correct 3 ms 2892 KB Output is correct
33 Correct 4 ms 2892 KB Output is correct
34 Correct 9 ms 2916 KB Output is correct
35 Correct 6 ms 2892 KB Output is correct
36 Correct 84 ms 19040 KB Output is correct
37 Correct 139 ms 16604 KB Output is correct
38 Correct 185 ms 15812 KB Output is correct
39 Correct 223 ms 15972 KB Output is correct
40 Correct 165 ms 15248 KB Output is correct
41 Correct 116 ms 9684 KB Output is correct
42 Correct 116 ms 9768 KB Output is correct
43 Correct 157 ms 16660 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 2 ms 2636 KB Output is correct
46 Correct 2 ms 2636 KB Output is correct
47 Correct 2 ms 2636 KB Output is correct
48 Correct 2 ms 2636 KB Output is correct
49 Correct 12 ms 2908 KB Output is correct
50 Correct 14 ms 2960 KB Output is correct
51 Correct 20 ms 2836 KB Output is correct
52 Correct 18 ms 2868 KB Output is correct
53 Correct 106 ms 19012 KB Output is correct
54 Correct 222 ms 15864 KB Output is correct
55 Correct 238 ms 15992 KB Output is correct
56 Correct 217 ms 15356 KB Output is correct
57 Correct 390 ms 16528 KB Output is correct
58 Correct 133 ms 19140 KB Output is correct
59 Correct 214 ms 16948 KB Output is correct