oj.uz

Submission #1001701

# Submission time Handle Problem Language Result Execution time Memory
1001701 2024-06-19T07:05:16 Z nomuluun Race (IOI11_race) C++14
43 / 100
 3000 ms 134224 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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; 
bool vis[200005]={0};
vector<pair<int,int>>v[200005];
ll mi=INT_MAX;                      // keep the best paths of each weights
void DFS(int q, int dis, int hi, int ka){
    int m=v[q].size();
    if(dis==ka){
        if(hi<mi)mi=hi;
    }
    for(int i=0; i<m; i++){
        int k=v[q][i].first;
        ll cost=v[q][i].second;
        if(!vis[k]){
            vis[k]=1;
            DFS(k,dis+cost,hi+1,ka);
        }
    }
}
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[])
{
  
  if(K<=100){
  	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;
  }
  else{
  	for(int i=0; i<N-1; i++){
        v[H[i][0]].push_back({H[i][1], L[i]});
        v[H[i][1]].push_back({H[i][0], L[i]});
    }
    for(int i=0; i<=N-1; i++){
        for(int i=0; i<N; i++){
            vis[i]=0;
        }
        vis[i]=1;
        DFS(i,0,0,K); //ehleh oroi distance highway
    }
    if(mi==INT_MAX)return -1;
    else return mi;
  }
  
}
#define MAX_N 500000

static int N, K;
static int H[MAX_N][2];
static int L[MAX_N];
static int solution;

//inline void my_assert(int e)
//{
//  if (!e)
//    abort();
//}
//
//void read_input()
//{
//  int i;
//  my_assert(2 == scanf("%d %d", &N, &K));
//  for (i = 0; i < N - 1; i++)
//    my_assert(3 == scanf("%d %d %d", &H[i][0], &H[i][1], &L[i]));
//  my_assert(1 == scanf("%d", &solution));
//}
//
//int main()
//{
//  int ans;
//  read_input();
//  ans = best_path(N, K, H, L);
//  if (ans == solution)
//    printf("Correct.\n");
//  else
//    printf("Incorrect. Returned %d, Expected %d.\n", ans, solution);
//
//  return 0;
//}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 95828 KB Output is correct
2 Correct 128 ms 95832 KB Output is correct
3 Correct 130 ms 95888 KB Output is correct
4 Correct 129 ms 95860 KB Output is correct
5 Correct 129 ms 95828 KB Output is correct
6 Correct 128 ms 95824 KB Output is correct
7 Correct 127 ms 95828 KB Output is correct
8 Correct 133 ms 95828 KB Output is correct
9 Correct 129 ms 95824 KB Output is correct
10 Correct 131 ms 95824 KB Output is correct
11 Correct 128 ms 95824 KB Output is correct
12 Correct 132 ms 95844 KB Output is correct
13 Correct 136 ms 95828 KB Output is correct
14 Correct 125 ms 95828 KB Output is correct
15 Correct 124 ms 95860 KB Output is correct
16 Correct 131 ms 95828 KB Output is correct
17 Correct 125 ms 95824 KB Output is correct
18 Correct 129 ms 95928 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 95828 KB Output is correct
2 Correct 128 ms 95832 KB Output is correct
3 Correct 130 ms 95888 KB Output is correct
4 Correct 129 ms 95860 KB Output is correct
5 Correct 129 ms 95828 KB Output is correct
6 Correct 128 ms 95824 KB Output is correct
7 Correct 127 ms 95828 KB Output is correct
8 Correct 133 ms 95828 KB Output is correct
9 Correct 129 ms 95824 KB Output is correct
10 Correct 131 ms 95824 KB Output is correct
11 Correct 128 ms 95824 KB Output is correct
12 Correct 132 ms 95844 KB Output is correct
13 Correct 136 ms 95828 KB Output is correct
14 Correct 125 ms 95828 KB Output is correct
15 Correct 124 ms 95860 KB Output is correct
16 Correct 131 ms 95828 KB Output is correct
17 Correct 125 ms 95824 KB Output is correct
18 Correct 129 ms 95928 KB Output is correct
19 Correct 128 ms 95768 KB Output is correct
20 Correct 123 ms 95920 KB Output is correct
21 Correct 132 ms 95828 KB Output is correct
22 Correct 139 ms 95828 KB Output is correct
23 Correct 140 ms 95824 KB Output is correct
24 Correct 138 ms 95900 KB Output is correct
25 Correct 136 ms 95824 KB Output is correct
26 Correct 134 ms 95828 KB Output is correct
27 Correct 135 ms 95824 KB Output is correct
28 Correct 141 ms 95828 KB Output is correct
29 Correct 142 ms 95828 KB Output is correct
30 Correct 151 ms 95936 KB Output is correct
31 Correct 158 ms 95824 KB Output is correct
32 Correct 150 ms 95876 KB Output is correct
33 Correct 149 ms 96080 KB Output is correct
34 Correct 140 ms 95824 KB Output is correct
35 Correct 139 ms 95932 KB Output is correct
36 Correct 138 ms 95820 KB Output is correct
37 Correct 141 ms 95972 KB Output is correct
38 Correct 140 ms 95988 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 95828 KB Output is correct
2 Correct 128 ms 95832 KB Output is correct
3 Correct 130 ms 95888 KB Output is correct
4 Correct 129 ms 95860 KB Output is correct
5 Correct 129 ms 95828 KB Output is correct
6 Correct 128 ms 95824 KB Output is correct
7 Correct 127 ms 95828 KB Output is correct
8 Correct 133 ms 95828 KB Output is correct
9 Correct 129 ms 95824 KB Output is correct
10 Correct 131 ms 95824 KB Output is correct
11 Correct 128 ms 95824 KB Output is correct
12 Correct 132 ms 95844 KB Output is correct
13 Correct 136 ms 95828 KB Output is correct
14 Correct 125 ms 95828 KB Output is correct
15 Correct 124 ms 95860 KB Output is correct
16 Correct 131 ms 95828 KB Output is correct
17 Correct 125 ms 95824 KB Output is correct
18 Correct 129 ms 95928 KB Output is correct
19 Correct 231 ms 100692 KB Output is correct
20 Correct 237 ms 101752 KB Output is correct
21 Correct 235 ms 101424 KB Output is correct
22 Correct 264 ms 102200 KB Output is correct
23 Correct 230 ms 102228 KB Output is correct
24 Correct 223 ms 102228 KB Output is correct
25 Correct 311 ms 108880 KB Output is correct
26 Correct 280 ms 115032 KB Output is correct
27 Correct 336 ms 107480 KB Output is correct
28 Correct 355 ms 134224 KB Output is correct
29 Correct 363 ms 132620 KB Output is correct
30 Correct 312 ms 107808 KB Output is correct
31 Correct 355 ms 107860 KB Output is correct
32 Correct 372 ms 107860 KB Output is correct
33 Correct 434 ms 107348 KB Output is correct
34 Correct 274 ms 107344 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 95828 KB Output is correct
2 Correct 128 ms 95832 KB Output is correct
3 Correct 130 ms 95888 KB Output is correct
4 Correct 129 ms 95860 KB Output is correct
5 Correct 129 ms 95828 KB Output is correct
6 Correct 128 ms 95824 KB Output is correct
7 Correct 127 ms 95828 KB Output is correct
8 Correct 133 ms 95828 KB Output is correct
9 Correct 129 ms 95824 KB Output is correct
10 Correct 131 ms 95824 KB Output is correct
11 Correct 128 ms 95824 KB Output is correct
12 Correct 132 ms 95844 KB Output is correct
13 Correct 136 ms 95828 KB Output is correct
14 Correct 125 ms 95828 KB Output is correct
15 Correct 124 ms 95860 KB Output is correct
16 Correct 131 ms 95828 KB Output is correct
17 Correct 125 ms 95824 KB Output is correct
18 Correct 129 ms 95928 KB Output is correct
19 Correct 128 ms 95768 KB Output is correct
20 Correct 123 ms 95920 KB Output is correct
21 Correct 132 ms 95828 KB Output is correct
22 Correct 139 ms 95828 KB Output is correct
23 Correct 140 ms 95824 KB Output is correct
24 Correct 138 ms 95900 KB Output is correct
25 Correct 136 ms 95824 KB Output is correct
26 Correct 134 ms 95828 KB Output is correct
27 Correct 135 ms 95824 KB Output is correct
28 Correct 141 ms 95828 KB Output is correct
29 Correct 142 ms 95828 KB Output is correct
30 Correct 151 ms 95936 KB Output is correct
31 Correct 158 ms 95824 KB Output is correct
32 Correct 150 ms 95876 KB Output is correct
33 Correct 149 ms 96080 KB Output is correct
34 Correct 140 ms 95824 KB Output is correct
35 Correct 139 ms 95932 KB Output is correct
36 Correct 138 ms 95820 KB Output is correct
37 Correct 141 ms 95972 KB Output is correct
38 Correct 140 ms 95988 KB Output is correct
39 Correct 231 ms 100692 KB Output is correct
40 Correct 237 ms 101752 KB Output is correct
41 Correct 235 ms 101424 KB Output is correct
42 Correct 264 ms 102200 KB Output is correct
43 Correct 230 ms 102228 KB Output is correct
44 Correct 223 ms 102228 KB Output is correct
45 Correct 311 ms 108880 KB Output is correct
46 Correct 280 ms 115032 KB Output is correct
47 Correct 336 ms 107480 KB Output is correct
48 Correct 355 ms 134224 KB Output is correct
49 Correct 363 ms 132620 KB Output is correct
50 Correct 312 ms 107808 KB Output is correct
51 Correct 355 ms 107860 KB Output is correct
52 Correct 372 ms 107860 KB Output is correct
53 Correct 434 ms 107348 KB Output is correct
54 Correct 274 ms 107344 KB Output is correct
55 Correct 1437 ms 96528 KB Output is correct
56 Correct 1352 ms 96268 KB Output is correct
57 Correct 184 ms 101200 KB Output is correct
58 Execution timed out 3090 ms 102012 KB Time limit exceeded
59 Halted 0 ms 0 KB -