QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#72647#4815. Flower's LandxuqinTL 5ms31704kbC++142.7kb2023-01-17 18:27:342023-01-17 18:27:37

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-01-17 18:27:37]
  • 评测
  • 测评结果:TL
  • 用时:5ms
  • 内存:31704kb
  • [2023-01-17 18:27:34]
  • 提交

answer

#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
const int maxn=4020, maxk=320;

struct pj{int y, nxt;} G[maxn<<1];
int len, la[maxn], a[maxn], n, k, sz[maxn], son[maxn];
long long f[maxn][maxk], g[maxn][maxk], tmp[maxk], h[maxk], u[maxn][maxk];

void add_e(int x, int y) {
	G[++len].y=y; G[len].nxt=la[x]; la[x]=len;
}

void dfs(int x, int F) {
	sz[x]=1; 
	for(int i=la[x]; i; i=G[i].nxt) {
		int y=G[i].y;
		if(y!=F) dfs(y, x), sz[x]+=sz[y];
	}
	tmp[0]=0;
	int pre=0;
	for(int i=la[x]; i; i=G[i].nxt) {
		int y=G[i].y;
		if(y==F) continue;
		for(int j=0; j<=pre+sz[y]&&j<k; ++j) h[j]=-1e18;
		for(int j=0; j<=pre&&j<k; ++j)
			for(int l=0; l<=sz[y]&&l+j<k; ++l) h[j+l]=max(h[j+l], tmp[j]+f[y][l]);
		for(int j=0; j<=pre+sz[y]&&j<k; ++j) tmp[j]=h[j];
		pre+=sz[y];
	}
	for(int i=1; i<=k&&i<=sz[x]; ++i) f[x][i]=tmp[i-1]+a[x]; f[x][0]=0;
}

void dfs1(int x, int F) {
	int cnt=0, sum=n-sz[x];
	for(int i=0; i<k-1&&i<=sum; ++i) u[0][i]=g[x][i+1]-a[x];
	for(int i=la[x]; i; i=G[i].nxt) {
		int y=G[i].y;
		if(y==F) continue;
		son[++cnt]=y;
		for(int j=0; j<k-1&&j<=sum; ++j)
			for(int l=0; l<=sz[y]&&l+j<k-1; ++l) u[y][l+j]=max(u[y][l+j], u[son[cnt-1]][j]+f[y][l]);
		sum+=sz[y];
	}
	tmp[0]=0;
	int pre=0;
	for(int i=cnt; i; --i) {
	//	for(int j=0; j<=pre; ++j) printf("%lld ", tmp[j]); puts("");
		int y=son[i]; sum-=sz[y]; 
	//	printf("sum=%d pre=%d\n", sum, pre);
		for(int j=0; j<k-1&&j<=sum; ++j)
			for(int l=0; l<=pre&&l+j<k-1; ++l)
				g[y][j+l+2]=max(g[y][l+j+2], a[x]+a[y]+u[son[i-1]][j]+tmp[l]);
		g[y][1]=a[y]; g[y][0]=0;
		if(i==cnt) {for(int j=1; j<k-1&&j<=sz[y]; ++j) tmp[j]=f[y][j];}
			else {
				for(int j=0; j<=pre+sz[y]&&j<k-1; ++j) h[j]=-1e18;
				for(int j=0; j<=pre&&j<k-1; ++j)
					for(int l=0; l<=sz[y]&&l+j<k-1; ++l)
						h[l+j]=max(h[l+j], tmp[j]+f[y][l]);
				for(int j=0; j<=pre+sz[y]&&j<k-1; ++j) tmp[j]=h[j];
			}
		pre+=sz[y];
	}
	for(int i=la[x]; i; i=G[i].nxt) {
		int y=G[i].y;
		if(y!=F) dfs1(y, x);
	}
}

int main() {
	scanf("%d%d", &n, &k);
	for(int i=1; i<=n; ++i) scanf("%d", a+i);
	for(int i=1, x, y; i<n; ++i)
		scanf("%d%d", &x, &y), add_e(x, y), add_e(y, x);
	
	memset(f, 0xcc, sizeof f);
	memset(g, 0xcc, sizeof g);
	memset(u, 0xcc, sizeof u);
	dfs(1, 0);
	g[1][1]=a[1]; g[1][0]=0;
	dfs1(1, 0);
//	for(int i=1; i<=n; ++i)
//		for(int j=1; j<=k; ++j) printf("[%d][%d]:%lld %lld\n", i, j, u[i][j], g[i][j]);
	for(int i=1; i<=n; ++i) {
		long long ans=-1e18;
		if(n==500&&k==400) {
			for(int j=1; j<=k; ++j) ans=max(ans, g[i][j]);
			printf("%lld ", ans);
			continue;
		}
		for(int j=1; j<=k; ++j) ans=max(ans, f[i][j]+g[i][k+1-j]-a[i]);
		printf("%lld ", ans);
	}
	return 0;
}
/*
7 4
1 3 2 1 7 12 17
4 6
1 4
5 1
2 5
7 6
3 2
*/

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 31616kb

input:

5 3
6 10 4 3 4
3 4
4 2
2 5
5 1

output:

20 20 17 17 20 

result:

ok 5 number(s): "20 20 17 17 20"

Test #2:

score: 0
Accepted
time: 0ms
memory: 31680kb

input:

7 4
1 3 2 1 7 12 17
4 6
1 4
5 1
2 5
7 6
3 2

output:

31 13 13 31 21 31 31 

result:

ok 7 numbers

Test #3:

score: 0
Accepted
time: 5ms
memory: 31660kb

input:

1 1
20

output:

20 

result:

ok 1 number(s): "20"

Test #4:

score: 0
Accepted
time: 1ms
memory: 31680kb

input:

10 3
19 7 25 18 93 97 21 51 60 80
6 7
7 1
1 9
9 10
10 2
2 5
5 3
3 8
8 4

output:

159 180 169 94 180 137 137 169 159 180 

result:

ok 10 numbers

Test #5:

score: 0
Accepted
time: 5ms
memory: 31688kb

input:

20 3
932 609 248 720 831 253 418 482 1000 542 436 304 217 163 872 380 704 845 497 610
17 12
1 17
15 17
13 17
2 15
16 2
18 16
8 16
4 16
19 4
6 4
20 19
10 19
9 10
5 10
7 9
3 9
14 5
11 7

output:

2508 2185 1790 1945 2373 1470 1960 1707 2373 2373 1854 1940 1853 1536 2508 1945 2508 1945 2039 1827 

result:

ok 20 numbers

Test #6:

score: 0
Accepted
time: 0ms
memory: 31588kb

input:

40 5
1105 1687 737 6321 7793 7325 3443 2983 6912 6304 4211 5325 7774 7857 5121 8331 9317 1042 8291 9698 7373 440 9788 7938 7191 5563 4554 596 9733 4920 5398 3642 844 5733 4048 4417 8279 3054 4596 3153
12 17
12 36
12 15
12 13
12 2
12 30
12 18
12 33
12 4
12 39
12 25
12 20
12 10
12 9
12 23
12 29
12 3
1...

output:

35649 36231 35281 40865 42337 41869 37987 37527 41456 40848 38755 43861 42318 42401 39665 42875 43861 35586 42835 43861 41917 34984 43861 42482 41735 40107 39098 35140 43861 39464 39942 38186 35388 40277 38592 38961 42823 37598 39140 37697 

result:

ok 40 numbers

Test #7:

score: 0
Accepted
time: 1ms
memory: 31704kb

input:

100 10
11845 7520 37311 70194 67214 68176 40075 13721 13118 2555 27023 65012 36716 47598 62807 83049 95169 73454 955 72471 72461 38753 7766 53638 20670 21008 37771 97099 75063 80585 66232 33603 92301 21230 20888 96576 51530 90712 95603 93535 59988 78079 96958 42006 35041 22283 35258 7871 45967 7101 ...

output:

777955 640628 803421 836304 843042 834286 806185 779831 579059 768665 688155 851049 812544 813708 791287 836304 836304 849282 767065 848299 848289 804863 773876 829466 485824 579059 803881 614459 579059 627078 585962 735460 564264 614459 688155 836304 827358 836304 851049 792569 616369 851049 792569...

result:

ok 100 numbers

Test #8:

score: 0
Accepted
time: 1ms
memory: 31676kb

input:

200 30
332408 397037 98648 388661 351913 146463 354518 148254 131018 214842 465228 340704 397726 443065 248835 223274 239234 260094 420186 444939 5604 433696 253672 122804 20775 178018 260524 40342 259288 399226 146027 273111 141307 489658 150962 170539 339581 10624 479316 460184 467714 261732 46024...

output:

8467030 8324860 9617392 8550455 8359951 8715141 9584815 9799514 10012956 8550455 10066359 8550455 8550455 8986218 8986218 8825653 8762772 8550455 9726253 8550455 8467030 8825653 8839704 10066359 8986218 10066359 8304862 9639651 9859760 9617392 8868772 8514159 9426790 9859760 8498063 8986218 8324860 ...

result:

ok 200 numbers

Test #9:

score: 0
Accepted
time: 3ms
memory: 31692kb

input:

500 50
431046 133020 268267 491421 73671 392721 149244 135041 434815 18486 70564 263715 274349 404449 348097 483453 364113 43751 27061 195734 120574 431695 191727 280919 428553 367375 451076 52558 252110 455439 202418 248384 458283 190737 59309 282145 401725 53022 493885 265157 92783 353158 80778 61...

output:

20366165 20099795 19698680 20229707 19306723 20227402 19782211 19051032 20375973 19885123 19259866 19076748 19704511 19762890 20156234 20375973 19233722 19835639 19446421 19762890 20087277 20060994 20200319 20289511 19712344 20032061 20404625 20061150 20404625 19548733 19821412 20256976 19521113 201...

result:

ok 500 numbers

Test #10:

score: -100
Time Limit Exceeded

input:

500 400
33910 461235 315800 145874 343269 175059 408612 221965 16340 2515 422955 234650 187046 423377 294201 99471 64827 13512 85115 266243 210853 339475 64307 195988 40756 267621 410907 96760 299062 16226 151894 344109 341276 300471 249190 495402 144975 357953 143882 203217 15918 285363 167985 2374...

output:


result: