oj.uz

Submission #1005179

# Submission time Handle Problem Language Result Execution time Memory
1005179 2024-06-22T08:30:39 Z Mardonbekhazratov Race (IOI11_race) C++17
21 / 100
 3000 ms 11516 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include "race.h"
#include<vector>
#include<queue>
#include<array>

using namespace std;

int n,k,ans;
vector<vector<pair<int,int>>>v;

void dfs(int x,int p,long long dis,int cnt){
	if(dis>=k){
		if(dis==k) ans=min(ans,cnt);
		return;
	}
	for(auto [z,w]:v[x]){
		if(z!=p) dfs(z,x,dis+w,cnt+1);
	}
}

void solve(int x){
	queue<array<int,4>>q;
	q.push({x,x,0,0});
	while(!q.empty()){
		auto [x,p,dis,cnt]=q.front();
		q.pop();
		if(dis==k){
			ans=min(ans,cnt);
			continue;
		}
		for(auto [z,w]:v[x]){
			if(z!=p && dis+w<=k){
				q.push({z,x,dis+w,cnt+1});
			} 
		}
	}
}

int best_path(int N, int K, int H[][2], int L[]){
	n=N;
	k=K;
	vector<long long>pref(n);
	pref[0]=0;
	v.resize(n);
	bool sub1=true;
	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]});
		pref[i+1]=pref[i]+L[i];
		if(H[i][0]!=i || H[i][1]!=i+1) sub1=false;
	}
	ans=n;
	if(sub1){
		for(int i=0;i<n-1;i++){
			auto pos=lower_bound(pref.begin(),pref.end(),pref[i]+K)-pref.begin();
			if(pos!=n && pref[pos]-pref[i]==K) ans=min(ans,(int)pos-i);
		}
		return (ans==n ? -1 : ans);
	}
	for(int i=0;i<n;i++){
		solve(i);
	}
	return (ans==n ? -1 : ans);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2648 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2392 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1241 ms 9676 KB Output is correct
20 Correct 1131 ms 9560 KB Output is correct
21 Correct 2593 ms 9776 KB Output is correct
22 Execution timed out 3052 ms 11516 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2648 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2392 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 10 ms 2552 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 8 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 3 ms 2396 KB Output is correct
29 Correct 6 ms 2396 KB Output is correct
30 Correct 7 ms 2396 KB Output is correct
31 Correct 9 ms 2396 KB Output is correct
32 Correct 9 ms 2396 KB Output is correct
33 Correct 8 ms 2552 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 4 ms 2396 KB Output is correct
38 Correct 5 ms 2392 KB Output is correct
39 Correct 1241 ms 9676 KB Output is correct
40 Correct 1131 ms 9560 KB Output is correct
41 Correct 2593 ms 9776 KB Output is correct
42 Execution timed out 3052 ms 11516 KB Time limit exceeded
43 Halted 0 ms 0 KB -