oj.uz

Submission #980508

# Submission time Handle Problem Language Result Execution time Memory
980508 2024-05-12T08:07:38 Z hieptk Race (IOI11_race) C++17
43 / 100
 3000 ms 67924 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <cstring>
#include <unordered_map>
#include <iomanip>
#include <queue>
#include <map>
#include <sstream>
#include <stack>
#include <bitset>
 
using ll = long long;
using ld = long double;
 
using namespace std;

const int nm = 200002;
const ll inf = 1e18;

vector<pair<int, ll>> adj[nm];
int H[nm][2], L[nm];
int Res;

unordered_map<ll, int> dfs(int i, int p, int k) {
    unordered_map<ll, int> res;
    for (auto [j, w]: adj[i]) {
        if (j == p) continue;
        auto resj = dfs(j, i, k);
        for (auto [cost, len]: resj) {
            if (cost + w > k) continue;
            if (cost + w == k) {
                Res = min(Res, len + 1);
            } else if (res.count(k - cost - w)) {
                Res = min(Res, res[k - cost - w] + len + 1);
            }
        }
        if (w == k) Res = 1;
        else if (res.count(k - w)) {
          Res = min(Res, res[k - w] + 1);
        }
        for (auto [cost, len]: resj) {
            if (cost + w > k) continue;
            if (res.count(cost + w)) {
              res[cost + w] = min(res[cost + w], len + 1);
            } else {
              res[cost + w] = len + 1;
            }
        }
        res[w] = 1;
    }
    // cout << "dfs " << i << "\n";
    // for (auto [cost, len]: res) cout << cost << " " << len << "\n";
    // cout << Res << "\n";
    return res;
}

void bfs(int i, int n, int k) {
  queue<int> q;
  q.push(i);
  vector<pair<ll, ll>> d(n);
  for (int j = 0; j < n; ++j) d[j] = {inf, inf};
  d[i] = {0, 0};
  while (q.size()) {
    int i = q.front();
    q.pop();
    for (auto [j, w]: adj[i]) {
      if (d[j].second > d[i].second + 1) {
        d[j].first = d[i].first + w;
        d[j].second = d[i].second + 1;
        q.push(j);
      }
    }
  }
  for (int j = 0; j < n; ++j) {
    if (d[j].first == k) Res = min(Res, (int) d[j].second);
  }
}

int best_path(int n, int k, int H[][2], int L[]) {
    for (int i = 0; i < n - 1; ++i) {
        adj[H[i][0]].emplace_back(H[i][1], L[i]);
        adj[H[i][1]].emplace_back(H[i][0], L[i]);
    }
    
    Res = n + 1;
    dfs(0, -1, k);
    return Res <= n ? Res : -1;
}
 
// int main() {
//     #ifdef LOCAL
//     freopen("input.txt", "r", stdin);
//     #endif
//     ios::sync_with_stdio(0);
//     cin.tie(0);
//     int n, k;
//     cin >> n >> k;
//     for (int i = 0; i < n - 1; ++i) cin >> H[i][0] >> H[i][1] >> L[i];
//     cout << best_path(n, k, H, L) << "\n";
// }

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11100 KB Output is correct
2 Correct 2 ms 11100 KB Output is correct
3 Correct 2 ms 11100 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 2 ms 11100 KB Output is correct
6 Correct 2 ms 11100 KB Output is correct
7 Correct 2 ms 11096 KB Output is correct
8 Correct 2 ms 11100 KB Output is correct
9 Correct 2 ms 11100 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 2 ms 11112 KB Output is correct
13 Correct 2 ms 11100 KB Output is correct
14 Correct 2 ms 11100 KB Output is correct
15 Correct 2 ms 11100 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 2 ms 11100 KB Output is correct
18 Correct 2 ms 11100 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11100 KB Output is correct
2 Correct 2 ms 11100 KB Output is correct
3 Correct 2 ms 11100 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 2 ms 11100 KB Output is correct
6 Correct 2 ms 11100 KB Output is correct
7 Correct 2 ms 11096 KB Output is correct
8 Correct 2 ms 11100 KB Output is correct
9 Correct 2 ms 11100 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 2 ms 11112 KB Output is correct
13 Correct 2 ms 11100 KB Output is correct
14 Correct 2 ms 11100 KB Output is correct
15 Correct 2 ms 11100 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 2 ms 11100 KB Output is correct
18 Correct 2 ms 11100 KB Output is correct
19 Correct 2 ms 11100 KB Output is correct
20 Correct 2 ms 11100 KB Output is correct
21 Correct 3 ms 11152 KB Output is correct
22 Correct 2 ms 11100 KB Output is correct
23 Correct 2 ms 11100 KB Output is correct
24 Correct 2 ms 11096 KB Output is correct
25 Correct 3 ms 11096 KB Output is correct
26 Correct 3 ms 11100 KB Output is correct
27 Correct 2 ms 11100 KB Output is correct
28 Correct 3 ms 11100 KB Output is correct
29 Correct 3 ms 11096 KB Output is correct
30 Correct 3 ms 11100 KB Output is correct
31 Correct 3 ms 11124 KB Output is correct
32 Correct 4 ms 11100 KB Output is correct
33 Correct 4 ms 11100 KB Output is correct
34 Correct 4 ms 11352 KB Output is correct
35 Correct 4 ms 11100 KB Output is correct
36 Correct 5 ms 11100 KB Output is correct
37 Correct 11 ms 11284 KB Output is correct
38 Correct 7 ms 11100 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11100 KB Output is correct
2 Correct 2 ms 11100 KB Output is correct
3 Correct 2 ms 11100 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 2 ms 11100 KB Output is correct
6 Correct 2 ms 11100 KB Output is correct
7 Correct 2 ms 11096 KB Output is correct
8 Correct 2 ms 11100 KB Output is correct
9 Correct 2 ms 11100 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 2 ms 11112 KB Output is correct
13 Correct 2 ms 11100 KB Output is correct
14 Correct 2 ms 11100 KB Output is correct
15 Correct 2 ms 11100 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 2 ms 11100 KB Output is correct
18 Correct 2 ms 11100 KB Output is correct
19 Correct 80 ms 18460 KB Output is correct
20 Correct 89 ms 19508 KB Output is correct
21 Correct 76 ms 19028 KB Output is correct
22 Correct 68 ms 19796 KB Output is correct
23 Correct 53 ms 20012 KB Output is correct
24 Correct 43 ms 19352 KB Output is correct
25 Correct 536 ms 30868 KB Output is correct
26 Correct 420 ms 40528 KB Output is correct
27 Correct 187 ms 25556 KB Output is correct
28 Correct 186 ms 67924 KB Output is correct
29 Correct 159 ms 65216 KB Output is correct
30 Correct 194 ms 26548 KB Output is correct
31 Correct 205 ms 26356 KB Output is correct
32 Correct 146 ms 26108 KB Output is correct
33 Correct 911 ms 25684 KB Output is correct
34 Correct 139 ms 25920 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11100 KB Output is correct
2 Correct 2 ms 11100 KB Output is correct
3 Correct 2 ms 11100 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 2 ms 11100 KB Output is correct
6 Correct 2 ms 11100 KB Output is correct
7 Correct 2 ms 11096 KB Output is correct
8 Correct 2 ms 11100 KB Output is correct
9 Correct 2 ms 11100 KB Output is correct
10 Correct 3 ms 11100 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 2 ms 11112 KB Output is correct
13 Correct 2 ms 11100 KB Output is correct
14 Correct 2 ms 11100 KB Output is correct
15 Correct 2 ms 11100 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 2 ms 11100 KB Output is correct
18 Correct 2 ms 11100 KB Output is correct
19 Correct 2 ms 11100 KB Output is correct
20 Correct 2 ms 11100 KB Output is correct
21 Correct 3 ms 11152 KB Output is correct
22 Correct 2 ms 11100 KB Output is correct
23 Correct 2 ms 11100 KB Output is correct
24 Correct 2 ms 11096 KB Output is correct
25 Correct 3 ms 11096 KB Output is correct
26 Correct 3 ms 11100 KB Output is correct
27 Correct 2 ms 11100 KB Output is correct
28 Correct 3 ms 11100 KB Output is correct
29 Correct 3 ms 11096 KB Output is correct
30 Correct 3 ms 11100 KB Output is correct
31 Correct 3 ms 11124 KB Output is correct
32 Correct 4 ms 11100 KB Output is correct
33 Correct 4 ms 11100 KB Output is correct
34 Correct 4 ms 11352 KB Output is correct
35 Correct 4 ms 11100 KB Output is correct
36 Correct 5 ms 11100 KB Output is correct
37 Correct 11 ms 11284 KB Output is correct
38 Correct 7 ms 11100 KB Output is correct
39 Correct 80 ms 18460 KB Output is correct
40 Correct 89 ms 19508 KB Output is correct
41 Correct 76 ms 19028 KB Output is correct
42 Correct 68 ms 19796 KB Output is correct
43 Correct 53 ms 20012 KB Output is correct
44 Correct 43 ms 19352 KB Output is correct
45 Correct 536 ms 30868 KB Output is correct
46 Correct 420 ms 40528 KB Output is correct
47 Correct 187 ms 25556 KB Output is correct
48 Correct 186 ms 67924 KB Output is correct
49 Correct 159 ms 65216 KB Output is correct
50 Correct 194 ms 26548 KB Output is correct
51 Correct 205 ms 26356 KB Output is correct
52 Correct 146 ms 26108 KB Output is correct
53 Correct 911 ms 25684 KB Output is correct
54 Correct 139 ms 25920 KB Output is correct
55 Correct 12 ms 11924 KB Output is correct
56 Correct 9 ms 11612 KB Output is correct
57 Correct 57 ms 18924 KB Output is correct
58 Correct 27 ms 18888 KB Output is correct
59 Execution timed out 3050 ms 41748 KB Time limit exceeded
60 Halted 0 ms 0 KB -