oj.uz

답안 #931815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931815 2024-02-22T11:17:45 Z Wansur 봉쇄 시간 (IOI23_closing) C++17
51 / 100
 1000 ms 569368 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'

using namespace std;
typedef long long ll;
const int mx=3e3+12;

vector<pair<int,ll>> g[mx];
vector<int> ord;
ll dp[4][mx][mx*2];
int sz2[mx];
ll cost1[mx];
ll cost2[mx];
ll tmp[4][mx];
bool is[mx];
int sz[mx];
ll n,k,x,y;

void init(){
	ord.clear();
	for(int i=0;i<n+10;i++){
		g[i].clear();
		cost1[i]=cost2[i]=0;
		is[i]=sz[i]=0;
		sz2[i]=0;
		tmp[0][i]=tmp[1][i]=tmp[2][i]=1e18+1;
		for(int j=0;j<n*2+10;j++){
			dp[0][i][j]=dp[1][i][j]=dp[2][i][j]=dp[3][i][j]=1e18+1;
		}
	}
}

int calc(){
	vector<ll> a,b;
	int ans=0;
	for(int i=0;i<n;i++){
		a.push_back(cost1[i]);
		b.push_back(cost2[i]);
	}
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	for(int i=1;i<n;i++){
		a[i]+=a[i-1];
	}
	for(int i=1;i<n;i++){
		b[i]+=b[i-1];
	}
	for(int i=0;i<n;i++){
		if(a[i]<=k || b[i]<=k){
			ans=max(ans,i+1);
		}
		for(int j=0;j<n;j++){
			if(a[i]+b[j]<=k){
				ans=max(ans,i+j+2);
			}
		}
	}
	return ans;
}

void calc(int v,int p,ll d[]){
	for(auto [to,w]:g[v]){
		if(to!=p){
			d[to]=d[v]+w;
			calc(to,v,d);
		}
	}
}

bool path(int v,int p,int f){
	if(v==f){
		ord.push_back(v);
		is[v]=1;
		return 1;
	}
	for(auto [to,w]:g[v]){
		if(to!=p && path(to,v,f)){
			ord.push_back(v);
			is[v]=1;
			return 1;
		}
	}
	return 0;
}

void dfs(int v,int p){
	dp[0][v][0]=0;
	dp[1][v][1]=cost1[v];
	dp[2][v][1]=cost2[v];
	dp[3][v][2]=max(cost1[v],cost2[v]);
	sz[v]=1;
	for(auto [to,w]:g[v]){
		if(to==p || is[to])continue;
		dfs(to,v);
		for(int m=0;m<4;m++){
			for(int i=0;i<=n*2;i++){
				tmp[m][i]=dp[m][v][i];
			}
		}
		for(int m=0;m<4;m++){
			for(int m1=m;m1>=0;m1=((m1-1)&m)){
				for(int x=0;x<=sz[v]*2;x++){
					for(int y=0;y<=sz[to]*2;y++){
						tmp[m][x+y]=min(tmp[m][x+y],dp[m][v][x]+dp[m1][to][y]);
					}
				}
				if(!m1)break;
			}
		}
		for(int m=0;m<4;m++){
			for(int i=0;i<=n*2;i++){
				dp[m][v][i]=tmp[m][i];
			}
		}
		sz[v]+=sz[to];
	}
}

int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W){
	n=N,k=K,x=X,y=Y;
	init();
	for(int i=0;i<n-1;i++){
		g[V[i]].push_back({U[i],W[i]});
		g[U[i]].push_back({V[i],W[i]});
	}
	calc(x,-1,cost1);
	calc(y,-1,cost2);
	int ans=calc();
	path(y,-1,x);
	for(int i=ord.size()-1;i>=0;i--){
		dfs(ord[i],-1);
	}
	for(int i=0;i<n;i++){
		sz2[i]=sz[i];
	}
	for(int i=ord.size()-2;i>=0;i--){
		int v=ord[i],u=ord[i+1];
		for(int m=2;m<4;m++){
			for(int i=0;i<n*2+10;i++){
				tmp[m][i]=1e18+1;
			}
		}
		for(int m=2;m<4;m++){
			for(int m1=m;m1>1;m1=((m1-1)&m)){
				for(int x=1;x<=sz[v]*2;x++){
					for(int y=1;y<=sz[u]*2;y++){
						tmp[m][x+y]=min(tmp[m][x+y],dp[m][v][x]+dp[m1][u][y]);
					}
				}
			}
		}
		for(int m=2;m<4;m++){
			for(int i=0;i<n*2+10;i++){
				dp[m][v][i]=tmp[m][i];
			}
		}
		sz[v]+=sz[u];
	}
	for(int i=0;i<ord.size()-1;i++){
		int u=ord[i],v=ord[i+1];
		for(int m=0;m<2;m++){
			for(int i=0;i<n*2+10;i++){
				tmp[m][i]=1e18+1;
			}
		}
		int m=1,m1=1;
		for(int x=1;x<=sz2[v]*2;x++){
			for(int y=1;y<=sz2[u]*2;y++){
				tmp[m][x+y]=min(tmp[m][x+y],dp[m][v][x]+dp[m1][u][y]);
			}	
		}
		for(int m=1;m<2;m++){
			for(int i=0;i<n*2+10;i++){
				dp[m][v][i]=tmp[m][i];
			}
		}
		sz2[v]+=sz2[u];
	}
	for(int i=0;i<n;i++){
		for(int j=n*2-1;j>=0;j--){
			dp[3][i][j]=min(dp[3][i][j+1],dp[3][i][j]);
			dp[1][i][j]=min(dp[1][i][j+1],dp[1][i][j]);
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<=n*2;j++){
			if(dp[3][x][j]<=k){
				ans=max(ans,j);
			}
		}
	}
	for(int i=0;i<ord.size()-1;i++){
		int v=ord[i],u=ord[i+1];
		int j=0;
		for(int i=n*2;i>=0;i--){
			while(j<n*2 && dp[3][u][j+1]+dp[1][v][i]<=k){
				j++;
			}
			if(dp[3][u][j]+dp[1][v][i]<=k){
				ans=max(ans,i+j);
			}
		}
	}
	return ans;
}

Compilation message

closing.cpp: In function 'void init()':
closing.cpp:26:14: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   26 |   is[i]=sz[i]=0;
      |         ~~~~~^~
closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:161:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |  for(int i=0;i<ord.size()-1;i++){
      |              ~^~~~~~~~~~~~~
closing.cpp:194:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |  for(int i=0;i<ord.size()-1;i++){
      |              ~^~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1016 ms 344360 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 16732 KB Output is correct
7 Correct 3 ms 16728 KB Output is correct
8 Correct 2 ms 16724 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 2 ms 16732 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 16732 KB Output is correct
7 Correct 3 ms 16728 KB Output is correct
8 Correct 2 ms 16724 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 2 ms 16732 KB Output is correct
12 Correct 4 ms 27228 KB Output is correct
13 Correct 4 ms 27228 KB Output is correct
14 Correct 4 ms 25180 KB Output is correct
15 Correct 3 ms 25180 KB Output is correct
16 Correct 4 ms 27228 KB Output is correct
17 Correct 4 ms 27228 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 24 ms 103280 KB Output is correct
20 Correct 20 ms 95068 KB Output is correct
21 Correct 18 ms 99160 KB Output is correct
22 Correct 19 ms 103260 KB Output is correct
23 Correct 20 ms 103260 KB Output is correct
24 Correct 20 ms 103084 KB Output is correct

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 16732 KB Output is correct
7 Correct 3 ms 16728 KB Output is correct
8 Correct 2 ms 16724 KB Output is correct
9 Correct 2 ms 16732 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 2 ms 16732 KB Output is correct
12 Correct 4 ms 27228 KB Output is correct
13 Correct 4 ms 27228 KB Output is correct
14 Correct 4 ms 25180 KB Output is correct
15 Correct 3 ms 25180 KB Output is correct
16 Correct 4 ms 27228 KB Output is correct
17 Correct 4 ms 27228 KB Output is correct
18 Correct 2 ms 12632 KB Output is correct
19 Correct 24 ms 103280 KB Output is correct
20 Correct 20 ms 95068 KB Output is correct
21 Correct 18 ms 99160 KB Output is correct
22 Correct 19 ms 103260 KB Output is correct
23 Correct 20 ms 103260 KB Output is correct
24 Correct 20 ms 103084 KB Output is correct
25 Correct 8 ms 16984 KB Output is correct
26 Incorrect 469 ms 569368 KB 1st lines differ - on the 1st token, expected: '5595', found: '5998'
27 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 1 ms 8536 KB Output is correct
8 Correct 1 ms 8708 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 10584 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12804 KB Output is correct
15 Correct 2 ms 12888 KB Output is correct
16 Correct 2 ms 12644 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12640 KB Output is correct
22 Correct 2 ms 12640 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 16728 KB Output is correct
9 Correct 2 ms 16724 KB Output is correct
10 Correct 2 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 4 ms 27228 KB Output is correct
14 Correct 4 ms 27228 KB Output is correct
15 Correct 4 ms 25180 KB Output is correct
16 Correct 3 ms 25180 KB Output is correct
17 Correct 4 ms 27228 KB Output is correct
18 Correct 4 ms 27228 KB Output is correct
19 Correct 1 ms 8536 KB Output is correct
20 Correct 1 ms 8708 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 10584 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12804 KB Output is correct
27 Correct 2 ms 12888 KB Output is correct
28 Correct 2 ms 12644 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12640 KB Output is correct
34 Correct 2 ms 12640 KB Output is correct
35 Correct 2 ms 12636 KB Output is correct
36 Correct 2 ms 12636 KB Output is correct
37 Correct 2 ms 12636 KB Output is correct
38 Correct 3 ms 16732 KB Output is correct
39 Correct 4 ms 27232 KB Output is correct
40 Correct 4 ms 27140 KB Output is correct
41 Correct 4 ms 27232 KB Output is correct
42 Correct 4 ms 27232 KB Output is correct
43 Correct 3 ms 25180 KB Output is correct
44 Correct 3 ms 27228 KB Output is correct
45 Correct 4 ms 27224 KB Output is correct
46 Correct 4 ms 27144 KB Output is correct
47 Correct 4 ms 27228 KB Output is correct
48 Correct 3 ms 25184 KB Output is correct
49 Correct 3 ms 18784 KB Output is correct
50 Correct 2 ms 12636 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 16728 KB Output is correct
9 Correct 2 ms 16724 KB Output is correct
10 Correct 2 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 4 ms 27228 KB Output is correct
14 Correct 4 ms 27228 KB Output is correct
15 Correct 4 ms 25180 KB Output is correct
16 Correct 3 ms 25180 KB Output is correct
17 Correct 4 ms 27228 KB Output is correct
18 Correct 4 ms 27228 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 24 ms 103280 KB Output is correct
21 Correct 20 ms 95068 KB Output is correct
22 Correct 18 ms 99160 KB Output is correct
23 Correct 19 ms 103260 KB Output is correct
24 Correct 20 ms 103260 KB Output is correct
25 Correct 20 ms 103084 KB Output is correct
26 Correct 1 ms 8536 KB Output is correct
27 Correct 1 ms 8708 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 10584 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12804 KB Output is correct
34 Correct 2 ms 12888 KB Output is correct
35 Correct 2 ms 12644 KB Output is correct
36 Correct 2 ms 12636 KB Output is correct
37 Correct 2 ms 12636 KB Output is correct
38 Correct 2 ms 12636 KB Output is correct
39 Correct 2 ms 12636 KB Output is correct
40 Correct 2 ms 12640 KB Output is correct
41 Correct 2 ms 12640 KB Output is correct
42 Correct 2 ms 12636 KB Output is correct
43 Correct 2 ms 12636 KB Output is correct
44 Correct 2 ms 12636 KB Output is correct
45 Correct 3 ms 16732 KB Output is correct
46 Correct 4 ms 27232 KB Output is correct
47 Correct 4 ms 27140 KB Output is correct
48 Correct 4 ms 27232 KB Output is correct
49 Correct 4 ms 27232 KB Output is correct
50 Correct 3 ms 25180 KB Output is correct
51 Correct 3 ms 27228 KB Output is correct
52 Correct 4 ms 27224 KB Output is correct
53 Correct 4 ms 27144 KB Output is correct
54 Correct 4 ms 27228 KB Output is correct
55 Correct 3 ms 25184 KB Output is correct
56 Correct 3 ms 18784 KB Output is correct
57 Correct 2 ms 12636 KB Output is correct
58 Correct 3 ms 14688 KB Output is correct
59 Correct 5 ms 27256 KB Output is correct
60 Correct 5 ms 27228 KB Output is correct
61 Correct 6 ms 37468 KB Output is correct
62 Correct 6 ms 37468 KB Output is correct
63 Correct 20 ms 103248 KB Output is correct
64 Correct 17 ms 96860 KB Output is correct
65 Correct 16 ms 95032 KB Output is correct
66 Correct 18 ms 96864 KB Output is correct
67 Correct 20 ms 103252 KB Output is correct
68 Correct 17 ms 94816 KB Output is correct
69 Correct 19 ms 103260 KB Output is correct
70 Correct 17 ms 98904 KB Output is correct
71 Correct 17 ms 98908 KB Output is correct
72 Correct 17 ms 98908 KB Output is correct
73 Correct 14 ms 82560 KB Output is correct
74 Correct 16 ms 86644 KB Output is correct
75 Correct 5 ms 27228 KB Output is correct

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 16728 KB Output is correct
9 Correct 2 ms 16724 KB Output is correct
10 Correct 2 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 4 ms 27228 KB Output is correct
14 Correct 4 ms 27228 KB Output is correct
15 Correct 4 ms 25180 KB Output is correct
16 Correct 3 ms 25180 KB Output is correct
17 Correct 4 ms 27228 KB Output is correct
18 Correct 4 ms 27228 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 24 ms 103280 KB Output is correct
21 Correct 20 ms 95068 KB Output is correct
22 Correct 18 ms 99160 KB Output is correct
23 Correct 19 ms 103260 KB Output is correct
24 Correct 20 ms 103260 KB Output is correct
25 Correct 20 ms 103084 KB Output is correct
26 Correct 8 ms 16984 KB Output is correct
27 Incorrect 469 ms 569368 KB 1st lines differ - on the 1st token, expected: '5595', found: '5998'
28 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 16728 KB Output is correct
9 Correct 2 ms 16724 KB Output is correct
10 Correct 2 ms 16732 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 4 ms 27228 KB Output is correct
14 Correct 4 ms 27228 KB Output is correct
15 Correct 4 ms 25180 KB Output is correct
16 Correct 3 ms 25180 KB Output is correct
17 Correct 4 ms 27228 KB Output is correct
18 Correct 4 ms 27228 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 24 ms 103280 KB Output is correct
21 Correct 20 ms 95068 KB Output is correct
22 Correct 18 ms 99160 KB Output is correct
23 Correct 19 ms 103260 KB Output is correct
24 Correct 20 ms 103260 KB Output is correct
25 Correct 20 ms 103084 KB Output is correct
26 Correct 8 ms 16984 KB Output is correct
27 Incorrect 469 ms 569368 KB 1st lines differ - on the 1st token, expected: '5595', found: '5998'
28 Halted 0 ms 0 KB -