oj.uz

답안 #537544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537544 2022-03-15T08:09:24 Z jamezzz Paths (RMI21_paths) C++17
12 / 100
 129 ms 12024 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;

#define maxn 100005

int n,k,x[maxn],y[maxn],c[maxn],p[maxn];
ll d[maxn],ans[maxn];
vector<ii> AL[maxn];

void dfs(int u){
	for(ii pr:AL[u]){
		int i=pr.fi,v=pr.se;
		if(v==p[u])continue;
		p[v]=u;
		d[v]=d[u]+c[i];
		dfs(v);
	}
}

int main(){
	sf("%d%d",&n,&k);
	for(int i=0;i<n-1;++i){
		sf("%d%d%d",&x[i],&y[i],&c[i]);
		AL[x[i]].pb({i,y[i]});
		AL[y[i]].pb({i,x[i]});
	}
	d[1]=0;p[1]=0;dfs(1);
	int mx=1;
	for(int i=1;i<=n;++i)if(d[i]>d[mx])mx=i;
	d[mx]=0;p[mx]=0;dfs(mx);
	for(int i=1;i<=n;++i){
		ans[i]=d[i];
		if(d[i]>d[mx])mx=i;
	}
	d[mx]=0;p[mx]=0;dfs(mx);
	for(int i=1;i<=n;++i){
		ans[i]=max(ans[i],d[i]);
		pf("%lld\n",ans[i]);
	}
}

/*
11 3
1 2 5
2 3 3
2 6 5
3 4 4
3 5 2
1 7 6
7 8 4
7 9 5
1 10 1
10 11 1
*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:29:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  sf("%d%d",&n,&k);
      |    ^
Main.cpp:31:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |   sf("%d%d%d",&x[i],&y[i],&c[i]);
      |     ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 10572 KB Output is correct
2 Correct 129 ms 12024 KB Output is correct
3 Correct 77 ms 10200 KB Output is correct
4 Correct 69 ms 10500 KB Output is correct
5 Correct 76 ms 11528 KB Output is correct
6 Correct 76 ms 10572 KB Output is correct

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -