oj.uz

답안 #854462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854462 2023-09-27T17:10:43 Z Wansur 봉쇄 시간 (IOI23_closing) C++17
9 / 100
 1000 ms 28516 KB 
#include <vector>
#include<bits/stdc++.h>
#define f first
#define s second

using namespace std;
const int mx=2e5+12;

vector<pair<int,long long>> g[mx];
long long d1[mx];
long long d2[mx];
long long n,k;

void dfs(int v,int p,bool ok){
	for(auto To:g[v]){
		int to=To.f,w=To.s;
		if(to==p){
			continue;
		}
		if(ok){
			d2[to]=d2[v]+w;
		}
		else{
			d1[to]=d1[v]+w;
		}
		dfs(to,v,ok);
	}
}

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;
	for(int i=0;i<n;i++){
		g[i].clear();
		d1[i]=d2[i]=0;
	}
	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]});
	}
	dfs(x,-1,0);
	dfs(y,-1,1);
	long long ans=0;
	for(int l1=x;l1>=0;l1--){
		for(int r1=x;r1<n;r1++){
			for(int l2=y;l2>=0;l2--){
				for(int r2=y;r2<n;r2++){
					long long sum=0,cnt=0;
					for(int i=0;i<n;i++){
						long long t=0;
						if(l1<=i && i<=r1){
							t=d1[i];
							cnt++;
						}
						if(l2<=i && i<=r2){
							t=max(t,d2[i]);
							cnt++;
						}
						sum+=t;
					}
					if(sum<=k){
						ans=max(ans,cnt);
					}
				}
			}
		}
	}
	long long cnt=0,sum=0;
	vector<long long> v;
	for(int i=0;i<n;i++){
		v.push_back(d1[i]);
	}
	sort(v.begin(),v.end());
	for(long long x:v){
		if(sum+x<=k){
			sum+=x;
			cnt++;
		}
	}
	ans=max(ans,cnt);
	cnt=sum=0;
	v.clear();
	for(int i=0;i<n;i++){
		v.push_back(d2[i]);
	}
	sort(v.begin(),v.end());
	for(long long x:v){
		if(sum+x<=k){
			sum+=x;
			cnt++;
		}
	}
	ans=max(ans,cnt);
	return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 4 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 48 ms 8064 KB Output is correct
7 Correct 39 ms 8028 KB Output is correct
8 Correct 14 ms 8028 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8092 KB Output is correct

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 4 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 48 ms 8064 KB Output is correct
7 Correct 39 ms 8028 KB Output is correct
8 Correct 14 ms 8028 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8092 KB Output is correct
12 Correct 154 ms 8024 KB Output is correct
13 Correct 99 ms 8228 KB Output is correct
14 Correct 300 ms 8028 KB Output is correct
15 Correct 138 ms 8076 KB Output is correct
16 Correct 3 ms 8028 KB Output is correct
17 Correct 3 ms 7856 KB Output is correct
18 Correct 12 ms 8028 KB Output is correct
19 Execution timed out 1012 ms 8024 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 4 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 48 ms 8064 KB Output is correct
7 Correct 39 ms 8028 KB Output is correct
8 Correct 14 ms 8028 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8092 KB Output is correct
12 Correct 154 ms 8024 KB Output is correct
13 Correct 99 ms 8228 KB Output is correct
14 Correct 300 ms 8028 KB Output is correct
15 Correct 138 ms 8076 KB Output is correct
16 Correct 3 ms 8028 KB Output is correct
17 Correct 3 ms 7856 KB Output is correct
18 Correct 12 ms 8028 KB Output is correct
19 Execution timed out 1012 ms 8024 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -