oj.uz

답안 #1005169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005169 2024-06-22T08:22:27 Z Mardonbekhazratov 경주 (Race) (IOI11_race) C++17
0 / 100
 135 ms 262144 KB 
#include "race.h"
#include<bits/stdc++.h>

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]){
		dfs(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++){
		dfs(i,i,0,0);
	}
	return (ans==n ? -1 : ans);
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 135 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 135 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 135 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 135 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -