oj.uz

답안 #702717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
702717 2023-02-24T21:51:00 Z TimDee Paths (RMI21_paths) C++17
56 / 100
 225 ms 22140 KB 
#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2,popcnt")

using ll = long long;
#define int long long
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second
#define vii(a,n) vector<int> a(n); forn(i,n) cin>>a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = INT_MAX;
const int mod = 998244353;

int n=2e3,k;
vector<vector<pi>> adj(n);
vector<vector<ll>> ans(n);
vector<int> mx(n,-1);

vector<int> d(n,0);
vector<int> paiuans(n,0);
void paiu() {

}

void dfs(int u,int p) {
	int m=-1;
	for(auto&e:adj[u]) {
		int v=e.f,w=e.s;
		if (v==p) continue;
		dfs(v,u);
		if (ans[u].size()<ans[v].size()) swap(ans[u],ans[v]);
		if (mx[v]+w>m) {
			if (m!=-1) ans[u].pb(m);
			m=mx[v]+w;
		} else {
			ans[u].pb(mx[v]+w);
		}
		for(auto&x:ans[v]) ans[u].pb(x);
	}
	//if (!ans[u].size()) mx[u]=0;
		mx[u]=max(m,0ll);
	//cout<<"dfs "<<u<<": "<<mx[u]<<"  "; for(auto&x:ans[u]) cout<<x<<' '; cout<<'\n';
}

void solve() {

	cin>>n>>k;
	forn(i,n-1) {
		int u,v,w; cin>>u>>v>>w; --u, --v;
		adj[u].pb({v,w});
		adj[v].pb({u,w});
	}
	if (k==1) paiu();
	forn(u,n) {
		forn(i,n) ans[i].clear();
		mx.assign(n,-1);
		dfs(u,-1);
		ll answer=mx[u];
		sort(rall(ans[u]));

		//cout<<"! "<<u<<": "<<mx[u]<<"  "; for(auto&x:ans[u]) cout<<x<<' '; cout<<'\n';
		forn(i,min(k-1,(int)ans[u].size())) {
			answer+=ans[u][i];
		}
		cout<<answer<<'\n';
	}

}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t=1;
    //cin>>t;
    while (t--) solve();
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 596 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 48 ms 3572 KB Output is correct
9 Correct 40 ms 3664 KB Output is correct
10 Correct 32 ms 1236 KB Output is correct
11 Correct 51 ms 6788 KB Output is correct
12 Correct 30 ms 1920 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 48 ms 3572 KB Output is correct
9 Correct 40 ms 3664 KB Output is correct
10 Correct 32 ms 1236 KB Output is correct
11 Correct 51 ms 6788 KB Output is correct
12 Correct 30 ms 1920 KB Output is correct
13 Correct 223 ms 18840 KB Output is correct
14 Correct 186 ms 12748 KB Output is correct
15 Correct 105 ms 2056 KB Output is correct
16 Correct 216 ms 22140 KB Output is correct
17 Correct 146 ms 6484 KB Output is correct
18 Correct 111 ms 10012 KB Output is correct
19 Correct 225 ms 12720 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 724 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 48 ms 3572 KB Output is correct
9 Correct 40 ms 3664 KB Output is correct
10 Correct 32 ms 1236 KB Output is correct
11 Correct 51 ms 6788 KB Output is correct
12 Correct 30 ms 1920 KB Output is correct
13 Correct 223 ms 18840 KB Output is correct
14 Correct 186 ms 12748 KB Output is correct
15 Correct 105 ms 2056 KB Output is correct
16 Correct 216 ms 22140 KB Output is correct
17 Correct 146 ms 6484 KB Output is correct
18 Correct 111 ms 10012 KB Output is correct
19 Correct 225 ms 12720 KB Output is correct
20 Runtime error 1 ms 724 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -