oj.uz

Submission #988514

# Submission time Handle Problem Language Result Execution time Memory
988514 2024-05-25T04:59:32 Z KasymK Race (IOI11_race) C++17
21 / 100
 260 ms 120804 KB 
#include "bits/stdc++.h"
#define MAX_N 500000
#define ff first
#define ss second
using namespace std;
const int M = 2e5 + 5;
vector<pair<int, int>> adj[M];
int vis[M], dis[M], edge[M], dp[M][105];
int answer = INT_MAX, Ka;
void dfs(int nd, int pr = -1){
	dp[nd][0] = 0;
	for(int i = 1; i <= Ka; ++i)
		dp[nd][i] = 1e9;
	for(auto &i : adj[nd])
		if(i.ff != pr){
			dfs(i.ff, nd);
//			jogaby tazele
			for(int a1 = 0; a1 + i.ss <= Ka; ++a1){
				int a2 = Ka - a1 - i.ss;
				answer = min(answer, dp[nd][a1] + dp[i.ff][a2] + 1);
			}
//			dp-ni tazele
			for(int k = 0; k + i.ss <= Ka; ++k)
				dp[nd][k+i.ss] = min(dp[nd][k+i.ss], dp[i.ff][k] + 1);
		}
}

int best_path(int n, int k, int H[][2], int L[]){
	Ka = 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]});
	if(n <= 1e3 + 5){
		queue<int> q;
		for(int ad = 0; ad < n; ++ad){
			for(int i = 0; i <= n; ++i)
				vis[i] = 0, dis[i] = 0, edge[i] = 0;
			while(!q.empty())
				q.pop();
			q.push(ad);
			vis[ad] = 1;
			while(!q.empty()){
				int x = q.front();
				q.pop();
				for(auto &i : adj[x])
					if(!vis[i.ff]){
						vis[i.ff] = 1;
						q.push(i.ff);
						dis[i.ff] = dis[x] + i.ss;
						edge[i.ff] = edge[x] + 1;
					}
			}
//			dis[i] = ad-den i-e cenli uzaklyk
//			tree-da dine bir path bar
			for(int i = 0; i < n; ++i)
				if(dis[i] == k)
					answer = min(answer, edge[i]);	
		}
	}
	else if(k <= 100)
		dfs(1);
	return (answer == INT_MAX ? -1 : answer);
	assert(false);
}

//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;
//}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 13144 KB Output is correct
2 Correct 4 ms 13144 KB Output is correct
3 Correct 4 ms 13148 KB Output is correct
4 Correct 3 ms 13148 KB Output is correct
5 Correct 4 ms 13144 KB Output is correct
6 Correct 3 ms 13144 KB Output is correct
7 Correct 3 ms 13148 KB Output is correct
8 Correct 3 ms 13144 KB Output is correct
9 Correct 3 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13144 KB Output is correct
14 Correct 4 ms 13144 KB Output is correct
15 Correct 3 ms 13148 KB Output is correct
16 Correct 3 ms 13148 KB Output is correct
17 Correct 3 ms 13148 KB Output is correct
18 Correct 3 ms 13148 KB Output is correct
19 Correct 3 ms 13148 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 12 ms 13148 KB Output is correct
22 Correct 14 ms 13328 KB Output is correct
23 Correct 14 ms 13148 KB Output is correct
24 Correct 15 ms 13144 KB Output is correct
25 Correct 13 ms 13144 KB Output is correct
26 Correct 13 ms 13344 KB Output is correct
27 Correct 14 ms 13144 KB Output is correct
28 Correct 15 ms 13404 KB Output is correct
29 Correct 14 ms 13148 KB Output is correct
30 Correct 13 ms 13144 KB Output is correct
31 Correct 13 ms 13144 KB Output is correct
32 Correct 13 ms 13144 KB Output is correct
33 Correct 14 ms 13148 KB Output is correct
34 Correct 9 ms 13284 KB Output is correct
35 Correct 9 ms 13148 KB Output is correct
36 Correct 10 ms 13144 KB Output is correct
37 Correct 8 ms 13320 KB Output is correct
38 Correct 10 ms 13148 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 13144 KB Output is correct
2 Correct 4 ms 13144 KB Output is correct
3 Correct 4 ms 13148 KB Output is correct
4 Correct 3 ms 13148 KB Output is correct
5 Correct 4 ms 13144 KB Output is correct
6 Correct 3 ms 13144 KB Output is correct
7 Correct 3 ms 13148 KB Output is correct
8 Correct 3 ms 13144 KB Output is correct
9 Correct 3 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13144 KB Output is correct
14 Correct 4 ms 13144 KB Output is correct
15 Correct 3 ms 13148 KB Output is correct
16 Correct 3 ms 13148 KB Output is correct
17 Correct 3 ms 13148 KB Output is correct
18 Correct 3 ms 13148 KB Output is correct
19 Correct 129 ms 58196 KB Output is correct
20 Correct 121 ms 59140 KB Output is correct
21 Correct 146 ms 58760 KB Output is correct
22 Correct 128 ms 59052 KB Output is correct
23 Correct 91 ms 59604 KB Output is correct
24 Correct 88 ms 58960 KB Output is correct
25 Correct 132 ms 67072 KB Output is correct
26 Correct 86 ms 67156 KB Output is correct
27 Correct 197 ms 103944 KB Output is correct
28 Incorrect 260 ms 120804 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 13144 KB Output is correct
2 Correct 4 ms 13144 KB Output is correct
3 Correct 4 ms 13148 KB Output is correct
4 Correct 3 ms 13148 KB Output is correct
5 Correct 4 ms 13144 KB Output is correct
6 Correct 3 ms 13144 KB Output is correct
7 Correct 3 ms 13148 KB Output is correct
8 Correct 3 ms 13144 KB Output is correct
9 Correct 3 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13144 KB Output is correct
14 Correct 4 ms 13144 KB Output is correct
15 Correct 3 ms 13148 KB Output is correct
16 Correct 3 ms 13148 KB Output is correct
17 Correct 3 ms 13148 KB Output is correct
18 Correct 3 ms 13148 KB Output is correct
19 Correct 3 ms 13148 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 12 ms 13148 KB Output is correct
22 Correct 14 ms 13328 KB Output is correct
23 Correct 14 ms 13148 KB Output is correct
24 Correct 15 ms 13144 KB Output is correct
25 Correct 13 ms 13144 KB Output is correct
26 Correct 13 ms 13344 KB Output is correct
27 Correct 14 ms 13144 KB Output is correct
28 Correct 15 ms 13404 KB Output is correct
29 Correct 14 ms 13148 KB Output is correct
30 Correct 13 ms 13144 KB Output is correct
31 Correct 13 ms 13144 KB Output is correct
32 Correct 13 ms 13144 KB Output is correct
33 Correct 14 ms 13148 KB Output is correct
34 Correct 9 ms 13284 KB Output is correct
35 Correct 9 ms 13148 KB Output is correct
36 Correct 10 ms 13144 KB Output is correct
37 Correct 8 ms 13320 KB Output is correct
38 Correct 10 ms 13148 KB Output is correct
39 Correct 129 ms 58196 KB Output is correct
40 Correct 121 ms 59140 KB Output is correct
41 Correct 146 ms 58760 KB Output is correct
42 Correct 128 ms 59052 KB Output is correct
43 Correct 91 ms 59604 KB Output is correct
44 Correct 88 ms 58960 KB Output is correct
45 Correct 132 ms 67072 KB Output is correct
46 Correct 86 ms 67156 KB Output is correct
47 Correct 197 ms 103944 KB Output is correct
48 Incorrect 260 ms 120804 KB Output isn't correct
49 Halted 0 ms 0 KB -