oj.uz

Submission #1001679

# Submission time Handle Problem Language Result Execution time Memory
1001679 2024-06-19T06:56:35 Z uranhishig Race (IOI11_race) C++14
31 / 100
 410 ms 184672 KB 
#include <bits/stdc++.h>
using namespace std;
int k, mn = INT_MAX;
vector<vector<int>> dp(200001, vector<int>(101, INT_MAX)); // sum I and ends at node v is the minimum of the paths
vector<pair<int, int>> adj[200001];                        // save edges
vector<vector<pair<int, int>>> path;                       // keep the best paths of each weights
void dfs(int v, int p)
{
  dp[v][0] = 0;
  for (auto [i, w] : adj[v])
    if (i != p)
      dfs(i, v);
  path.assign(k + 1, {});
  for (auto [i, w] : adj[v])
  {
    if (i == p)
      continue;
    for (int j = w; j <= k; j++)
    {
      if (dp[i][j - w] == INT_MAX)
        continue;
      if (path[j].size() < 2)
        path[j].push_back({dp[i][j - w] + 1, i}); // keep best two paths
      else if (dp[i][j - w] + 1 < path[j][1].first)
        path[j][1] = {dp[i][j - w] + 1, i}; // keep current path
      if (path[j].size() == 2 && path[j][0].first > path[j][1].first)
        swap(path[j][0], path[j][1]); // swap shortest path
      dp[v][j] = min(dp[v][j], dp[i][j - w] + 1);
    }
  }
  if (!path[k].empty())
    mn = min(mn, path[k][0].first); // if there is any path which is exactly K
  for (int i = 1; i < k; i++)
  {
    if (path[i].empty() || path[k - i].empty())
      continue;
    if (path[i][0].second != path[k - i][0].second)
      mn = min(mn, path[i][0].first + path[k - i][0].first); // compare 2 best paths
    else if (1 < path[k - i].size())
      mn = min(mn, path[i][0].first + path[k - i][1].first); // compare 2 best paths if there is path over 1.
  }
}
int best_path(int N, int K, int H[][2], int L[])
{
  k = K;
  for (int i = 0; i < N - 1; i++)
  {
    adj[H[i][0]].push_back({H[i][1], L[i]});
    adj[H[i][1]].push_back({H[i][0], L[i]});
  }
  dfs(0, -1);
  if (mn == INT_MAX)
    return -1;
  else
    return mn;
}
#define MAX_N 500000
 
static int N, K;
static int H[MAX_N][2];
static int L[MAX_N];
static int solution;

Compilation message

race.cpp: In function 'void dfs(int, int)':
race.cpp:10:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   10 |   for (auto [i, w] : adj[v])
      |             ^
race.cpp:14:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   14 |   for (auto [i, w] : adj[v])
      |             ^
race.cpp: At global scope:
race.cpp:62:12: warning: 'solution' defined but not used [-Wunused-variable]
   62 | static int solution;
      |            ^~~~~~~~
race.cpp:61:12: warning: 'L' defined but not used [-Wunused-variable]
   61 | static int L[MAX_N];
      |            ^
race.cpp:60:12: warning: 'H' defined but not used [-Wunused-variable]
   60 | static int H[MAX_N][2];
      |            ^
race.cpp:59:15: warning: 'K' defined but not used [-Wunused-variable]
   59 | static int N, K;
      |               ^
race.cpp:59:12: warning: 'N' defined but not used [-Wunused-variable]
   59 | static int N, K;
      |            ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 91220 KB Output is correct
2 Correct 131 ms 91068 KB Output is correct
3 Correct 129 ms 91216 KB Output is correct
4 Correct 128 ms 91148 KB Output is correct
5 Correct 142 ms 91260 KB Output is correct
6 Correct 127 ms 91220 KB Output is correct
7 Correct 127 ms 91084 KB Output is correct
8 Correct 128 ms 91228 KB Output is correct
9 Correct 128 ms 91140 KB Output is correct
10 Correct 128 ms 91232 KB Output is correct
11 Correct 127 ms 91216 KB Output is correct
12 Correct 127 ms 91216 KB Output is correct
13 Correct 129 ms 91220 KB Output is correct
14 Correct 129 ms 91160 KB Output is correct
15 Correct 129 ms 91220 KB Output is correct
16 Correct 130 ms 91220 KB Output is correct
17 Correct 123 ms 91216 KB Output is correct
18 Correct 129 ms 91220 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 91220 KB Output is correct
2 Correct 131 ms 91068 KB Output is correct
3 Correct 129 ms 91216 KB Output is correct
4 Correct 128 ms 91148 KB Output is correct
5 Correct 142 ms 91260 KB Output is correct
6 Correct 127 ms 91220 KB Output is correct
7 Correct 127 ms 91084 KB Output is correct
8 Correct 128 ms 91228 KB Output is correct
9 Correct 128 ms 91140 KB Output is correct
10 Correct 128 ms 91232 KB Output is correct
11 Correct 127 ms 91216 KB Output is correct
12 Correct 127 ms 91216 KB Output is correct
13 Correct 129 ms 91220 KB Output is correct
14 Correct 129 ms 91160 KB Output is correct
15 Correct 129 ms 91220 KB Output is correct
16 Correct 130 ms 91220 KB Output is correct
17 Correct 123 ms 91216 KB Output is correct
18 Correct 129 ms 91220 KB Output is correct
19 Correct 133 ms 91216 KB Output is correct
20 Correct 135 ms 91072 KB Output is correct
21 Runtime error 196 ms 184672 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 91220 KB Output is correct
2 Correct 131 ms 91068 KB Output is correct
3 Correct 129 ms 91216 KB Output is correct
4 Correct 128 ms 91148 KB Output is correct
5 Correct 142 ms 91260 KB Output is correct
6 Correct 127 ms 91220 KB Output is correct
7 Correct 127 ms 91084 KB Output is correct
8 Correct 128 ms 91228 KB Output is correct
9 Correct 128 ms 91140 KB Output is correct
10 Correct 128 ms 91232 KB Output is correct
11 Correct 127 ms 91216 KB Output is correct
12 Correct 127 ms 91216 KB Output is correct
13 Correct 129 ms 91220 KB Output is correct
14 Correct 129 ms 91160 KB Output is correct
15 Correct 129 ms 91220 KB Output is correct
16 Correct 130 ms 91220 KB Output is correct
17 Correct 123 ms 91216 KB Output is correct
18 Correct 129 ms 91220 KB Output is correct
19 Correct 243 ms 96080 KB Output is correct
20 Correct 229 ms 97064 KB Output is correct
21 Correct 239 ms 96852 KB Output is correct
22 Correct 254 ms 97364 KB Output is correct
23 Correct 222 ms 97716 KB Output is correct
24 Correct 229 ms 97684 KB Output is correct
25 Correct 307 ms 103948 KB Output is correct
26 Correct 256 ms 110160 KB Output is correct
27 Correct 300 ms 102532 KB Output is correct
28 Correct 368 ms 129372 KB Output is correct
29 Correct 343 ms 127892 KB Output is correct
30 Correct 306 ms 103292 KB Output is correct
31 Correct 310 ms 103420 KB Output is correct
32 Correct 359 ms 103252 KB Output is correct
33 Correct 410 ms 102484 KB Output is correct
34 Correct 302 ms 102740 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 91220 KB Output is correct
2 Correct 131 ms 91068 KB Output is correct
3 Correct 129 ms 91216 KB Output is correct
4 Correct 128 ms 91148 KB Output is correct
5 Correct 142 ms 91260 KB Output is correct
6 Correct 127 ms 91220 KB Output is correct
7 Correct 127 ms 91084 KB Output is correct
8 Correct 128 ms 91228 KB Output is correct
9 Correct 128 ms 91140 KB Output is correct
10 Correct 128 ms 91232 KB Output is correct
11 Correct 127 ms 91216 KB Output is correct
12 Correct 127 ms 91216 KB Output is correct
13 Correct 129 ms 91220 KB Output is correct
14 Correct 129 ms 91160 KB Output is correct
15 Correct 129 ms 91220 KB Output is correct
16 Correct 130 ms 91220 KB Output is correct
17 Correct 123 ms 91216 KB Output is correct
18 Correct 129 ms 91220 KB Output is correct
19 Correct 133 ms 91216 KB Output is correct
20 Correct 135 ms 91072 KB Output is correct
21 Runtime error 196 ms 184672 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -