oj.uz

답안 #132975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
132975 2019-07-20T03:21:17 Z wilwxk 경주 (Race) (IOI11_race) C++14
31 / 100
 1160 ms 34808 KB 
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN=2e5+5;
const int MAXX=1e6+5;
vector<int> g[MAXN], pes[MAXN];
int n, respf;
ll x;

class solution {
public:
	int resp=MAXN;
	void init() {
		tam[n]=0;
		memset(prof, 0, sizeof(prof));
		fill(best, best+n+2, MAXN);
		best[0]=0;
		solve(0, 1);
	}
	void solve(int cur, int k) {
		basic_scan(cur, cur);
		cur=find_centroid(cur, cur, tam[cur]);
		prof[cur]=k;
		
		// printf(">> %d <<\n", cur);

		for(int i=0; i<g[cur].size(); i++) {
			int viz=g[cur][i]; ll peso=pes[cur][i];
			adv_scan(viz, cur, 1, peso, 0);
			adv_scan(viz, cur, 1, peso, 1);
		}
		for(int i=0; i<g[cur].size(); i++) {
			int viz=g[cur][i]; ll peso=pes[cur][i];
			adv_scan(viz, cur, 1, peso, -1);
		}

		for(auto viz : g[cur]) {
			if(prof[viz]) continue;
			solve(viz, k+1);
		}
	}

private:
	int tam[MAXN], prof[MAXN];
	int best[MAXX];
	void basic_scan(int cur, int p) {
		tam[cur]=1;
		for(auto viz : g[cur]) {
			if(viz==p||prof[viz]) continue;
			basic_scan(viz, cur);
			tam[cur]+=tam[viz];
		}
	}
	void adv_scan(int cur, int p, int d, ll dd, int k) {
		if(dd>x) return;
		if(k==0) resp=min(resp, d+best[x-dd]);
		else if(k==1) best[dd]=min(best[dd], d);
		else best[dd]=MAXN;
		for(int i=0; i<g[cur].size(); i++) {
			int viz=g[cur][i]; ll peso=pes[cur][i];
			if(viz==p||prof[viz]) continue;
			adv_scan(viz, cur, d+1, dd+peso, k);
		}
	}
	int find_centroid(int cur, int p, int val) {
		int grande=n;
		for(auto viz : g[cur]) if(viz!=p&&!prof[viz]&&tam[viz]>tam[grande]) grande=viz;
		if(tam[grande]*2<=val) return cur;
		return find_centroid(grande, cur, val);
	}

};

int best_path(int N, int K, int H[][2], int L[])
{
	n=N; x=K;
	for(int i=0; i<n-1; i++) {
		int a=H[i][0]; int b=H[i][1];
		g[a].push_back(b); pes[a].push_back(L[i]);
		g[b].push_back(a); pes[b].push_back(L[i]);
	}

	solution sol;
	sol.init();

	respf=sol.resp;
	if(respf>n) respf=-1;

	return respf;
}

Compilation message

race.cpp: In member function 'void solution::solve(int, int)':
race.cpp:29:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<g[cur].size(); i++) {
                ~^~~~~~~~~~~~~~
race.cpp:34:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<g[cur].size(); i++) {
                ~^~~~~~~~~~~~~~
race.cpp: In member function 'void solution::adv_scan(int, int, int, ll, int)':
race.cpp:61:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<g[cur].size(); i++) {
                ~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10488 KB Output is correct
2 Correct 11 ms 10616 KB Output is correct
3 Correct 11 ms 10488 KB Output is correct
4 Correct 11 ms 10488 KB Output is correct
5 Correct 11 ms 10492 KB Output is correct
6 Correct 11 ms 10616 KB Output is correct
7 Correct 11 ms 10492 KB Output is correct
8 Correct 11 ms 10616 KB Output is correct
9 Correct 12 ms 10616 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 11 ms 10488 KB Output is correct
12 Correct 10 ms 10488 KB Output is correct
13 Correct 11 ms 10616 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 11 ms 10488 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10488 KB Output is correct
2 Correct 11 ms 10616 KB Output is correct
3 Correct 11 ms 10488 KB Output is correct
4 Correct 11 ms 10488 KB Output is correct
5 Correct 11 ms 10492 KB Output is correct
6 Correct 11 ms 10616 KB Output is correct
7 Correct 11 ms 10492 KB Output is correct
8 Correct 11 ms 10616 KB Output is correct
9 Correct 12 ms 10616 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 11 ms 10488 KB Output is correct
12 Correct 10 ms 10488 KB Output is correct
13 Correct 11 ms 10616 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 11 ms 10488 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct
19 Correct 11 ms 10488 KB Output is correct
20 Correct 11 ms 10488 KB Output is correct
21 Correct 13 ms 10744 KB Output is correct
22 Incorrect 17 ms 13304 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10488 KB Output is correct
2 Correct 11 ms 10616 KB Output is correct
3 Correct 11 ms 10488 KB Output is correct
4 Correct 11 ms 10488 KB Output is correct
5 Correct 11 ms 10492 KB Output is correct
6 Correct 11 ms 10616 KB Output is correct
7 Correct 11 ms 10492 KB Output is correct
8 Correct 11 ms 10616 KB Output is correct
9 Correct 12 ms 10616 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 11 ms 10488 KB Output is correct
12 Correct 10 ms 10488 KB Output is correct
13 Correct 11 ms 10616 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 11 ms 10488 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct
19 Correct 352 ms 18808 KB Output is correct
20 Correct 349 ms 18808 KB Output is correct
21 Correct 416 ms 18940 KB Output is correct
22 Correct 451 ms 19108 KB Output is correct
23 Correct 163 ms 18808 KB Output is correct
24 Correct 159 ms 19264 KB Output is correct
25 Correct 274 ms 20728 KB Output is correct
26 Correct 177 ms 22764 KB Output is correct
27 Correct 1032 ms 28212 KB Output is correct
28 Correct 521 ms 34808 KB Output is correct
29 Correct 529 ms 34340 KB Output is correct
30 Correct 1033 ms 28460 KB Output is correct
31 Correct 1020 ms 28304 KB Output is correct
32 Correct 1160 ms 28408 KB Output is correct
33 Correct 534 ms 27196 KB Output is correct
34 Correct 439 ms 27000 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10488 KB Output is correct
2 Correct 11 ms 10616 KB Output is correct
3 Correct 11 ms 10488 KB Output is correct
4 Correct 11 ms 10488 KB Output is correct
5 Correct 11 ms 10492 KB Output is correct
6 Correct 11 ms 10616 KB Output is correct
7 Correct 11 ms 10492 KB Output is correct
8 Correct 11 ms 10616 KB Output is correct
9 Correct 12 ms 10616 KB Output is correct
10 Correct 12 ms 10488 KB Output is correct
11 Correct 11 ms 10488 KB Output is correct
12 Correct 10 ms 10488 KB Output is correct
13 Correct 11 ms 10616 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10616 KB Output is correct
16 Correct 11 ms 10488 KB Output is correct
17 Correct 11 ms 10488 KB Output is correct
18 Correct 11 ms 10616 KB Output is correct
19 Correct 11 ms 10488 KB Output is correct
20 Correct 11 ms 10488 KB Output is correct
21 Correct 13 ms 10744 KB Output is correct
22 Incorrect 17 ms 13304 KB Output isn't correct
23 Halted 0 ms 0 KB -