oj.uz

Submission #571681

# Submission time Handle Problem Language Result Execution time Memory
571681 2022-06-02T14:13:54 Z Mounir Toll (BOI17_toll) C++14
100 / 100
 315 ms 167628 KB 
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define pb push_back
#define pii pair<int, int>
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define print(x) cout << #x << " est " << x << endl;
#define x first
#define y second
#define int long long
using namespace std;

const int K = 5, N = 1e5, OO = 1e9, B = 17;
struct Chemin {
      int dMin[K][K];

      void init(int a){
            for (int i = 0; i < K; ++i)
                  for (int j = 0; j < K; ++j)
                        dMin[i][j] = a;
      }

      void combine(Chemin left, Chemin right){
            for (int i = 0; i < K; ++i)
                  for (int j = 0; j < K; ++j){
                        dMin[i][j] = OO;
                        for (int k = 0; k < K; ++k)
                              chmin(dMin[i][j], left.dMin[i][k] + right.dMin[k][j]);
                  }
      }
};

Chemin chemins[N][B];


signed main(){  
      int tZone, nNoeuds, nAretes, nReqs; cin >> tZone >> nNoeuds >> nAretes >> nReqs;
      int nZones = ceil(nNoeuds/double(tZone));

      for (int iZone = 0; iZone < nZones; ++iZone)
            chemins[iZone][0].init(OO);

      for (int i = 0; i < nAretes; ++i){
            int source, destination, poids; cin >> source >> destination >> poids;
            swap(source, destination);
            int zoneSource = source/tZone;
            chmin(chemins[zoneSource][0].dMin[source%tZone][destination%tZone], poids);
       //     cout << "c " << chemins[zoneSource][0].dMin[source%tZone][destination%tZone] << endl;
      }

      int pow2 = 2;
      for (int b = 1; b < B; ++b, pow2 *= 2){
            for (int source = nZones - 1; source - pow2 >= 0; --source)
                  chemins[source][b].combine(chemins[source][b - 1], chemins[source - pow2/2][b - 1]);
      }

      for (int iReq = 0; iReq < nReqs; ++iReq){
            int source, dest; cin >> source >> dest;
            swap(source, dest);
            int zoneSource = source/tZone, zoneDest = dest/tZone;
            Chemin cCur; cCur.init(OO);
            for (int i = 0; i < K; ++i)
                  cCur.dMin[i][i] = 0;
           // cout << zoneSource << " " << zoneDest << endl;
            int pow2 = 1;
            for (int i = 0; i < B - 1; ++i)
                  pow2 *= 2;
            for (int b = B - 1; b >= 0; --b, pow2 /= 2){
                //  cout << zoneSource << " " << zoneDest << endl;
                  if (zoneSource - pow2 >= zoneDest){
                     //   if (false)
                       //       cout << "req " << iReq << endl;
                  //      cout << "req " << iReq << " " << b << endl;
                        cCur.combine(cCur, chemins[zoneSource][b]);
                        zoneSource -= pow2;
                  }
            }

            if (cCur.dMin[source%tZone][dest%tZone] < OO)
                  cout << cCur.dMin[source%tZone][dest%tZone] << endl;
            else
                  cout << -1 << endl;
      }
      return 0;   
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 313 ms 167628 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 6 ms 3540 KB Output is correct
6 Correct 6 ms 3540 KB Output is correct
7 Correct 9 ms 3652 KB Output is correct
8 Correct 300 ms 167500 KB Output is correct
9 Correct 298 ms 167500 KB Output is correct
10 Correct 255 ms 166664 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 85060 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 27 ms 3668 KB Output is correct
8 Correct 27 ms 2064 KB Output is correct
9 Correct 284 ms 167460 KB Output is correct
10 Correct 208 ms 57984 KB Output is correct
11 Correct 217 ms 85156 KB Output is correct
12 Correct 150 ms 57124 KB Output is correct
13 Correct 156 ms 22664 KB Output is correct
14 Correct 123 ms 34932 KB Output is correct
15 Correct 80 ms 21380 KB Output is correct
16 Correct 80 ms 21380 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 3 ms 1876 KB Output is correct
8 Correct 4 ms 960 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 251 ms 167316 KB Output is correct
11 Correct 175 ms 85012 KB Output is correct
12 Correct 181 ms 57916 KB Output is correct
13 Correct 196 ms 58152 KB Output is correct
14 Correct 150 ms 57536 KB Output is correct
15 Correct 78 ms 21432 KB Output is correct
16 Correct 89 ms 21388 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 3 ms 1876 KB Output is correct
8 Correct 4 ms 960 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 251 ms 167316 KB Output is correct
11 Correct 175 ms 85012 KB Output is correct
12 Correct 181 ms 57916 KB Output is correct
13 Correct 196 ms 58152 KB Output is correct
14 Correct 150 ms 57536 KB Output is correct
15 Correct 78 ms 21432 KB Output is correct
16 Correct 89 ms 21388 KB Output is correct
17 Correct 180 ms 85020 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 10 ms 3668 KB Output is correct
24 Correct 11 ms 2024 KB Output is correct
25 Correct 12 ms 1108 KB Output is correct
26 Correct 9 ms 1108 KB Output is correct
27 Correct 273 ms 167468 KB Output is correct
28 Correct 205 ms 57896 KB Output is correct
29 Correct 185 ms 58188 KB Output is correct
30 Correct 171 ms 57548 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 313 ms 167628 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 6 ms 3540 KB Output is correct
6 Correct 6 ms 3540 KB Output is correct
7 Correct 9 ms 3652 KB Output is correct
8 Correct 300 ms 167500 KB Output is correct
9 Correct 298 ms 167500 KB Output is correct
10 Correct 255 ms 166664 KB Output is correct
11 Correct 207 ms 85060 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 27 ms 3668 KB Output is correct
18 Correct 27 ms 2064 KB Output is correct
19 Correct 284 ms 167460 KB Output is correct
20 Correct 208 ms 57984 KB Output is correct
21 Correct 217 ms 85156 KB Output is correct
22 Correct 150 ms 57124 KB Output is correct
23 Correct 156 ms 22664 KB Output is correct
24 Correct 123 ms 34932 KB Output is correct
25 Correct 80 ms 21380 KB Output is correct
26 Correct 80 ms 21380 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 4 ms 3540 KB Output is correct
33 Correct 3 ms 1876 KB Output is correct
34 Correct 4 ms 960 KB Output is correct
35 Correct 3 ms 1108 KB Output is correct
36 Correct 251 ms 167316 KB Output is correct
37 Correct 175 ms 85012 KB Output is correct
38 Correct 181 ms 57916 KB Output is correct
39 Correct 196 ms 58152 KB Output is correct
40 Correct 150 ms 57536 KB Output is correct
41 Correct 78 ms 21432 KB Output is correct
42 Correct 89 ms 21388 KB Output is correct
43 Correct 180 ms 85020 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 308 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 10 ms 3668 KB Output is correct
50 Correct 11 ms 2024 KB Output is correct
51 Correct 12 ms 1108 KB Output is correct
52 Correct 9 ms 1108 KB Output is correct
53 Correct 273 ms 167468 KB Output is correct
54 Correct 205 ms 57896 KB Output is correct
55 Correct 185 ms 58188 KB Output is correct
56 Correct 171 ms 57548 KB Output is correct
57 Correct 235 ms 45184 KB Output is correct
58 Correct 315 ms 167552 KB Output is correct
59 Correct 233 ms 85220 KB Output is correct