oj.uz

답안 #854938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854938 2023-09-29T12:20:56 Z Wansur 봉쇄 시간 (IOI23_closing) C++17
0 / 100
 1000 ms 36384 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 pos=x;pos<y;pos++){
		vector<long long> v;
		for(int i=0;i<n;i++){
			if(i<=pos){
				v.push_back(d1[i]);
			}
			else{
				v.push_back(d2[i]);
			}
		}
		sort(v.begin(),v.end());
		long long sum=0,cnt=0;
		for(long long x:v){
			if(sum+x<=k){
				sum+=x;
				cnt++;
			}
		}
		ans=max(ans,cnt);
	}
	for(int lx=0;lx<=x;lx++){
		for(int rx=y;rx<n;rx++){
			for(int ly=0;ly<=x;ly++){
				for(int ry=y;ry<n;ry++){
					long long sum=0,cnt=0;
					for(int i=0;i<n;i++){
						long long t=0;
						if(lx<=i && i<=rx){
							t=d1[i];
						}
						if(ly<=i && i<=ry){
							t=max(t,d2[i]);
						}
						sum+=t;
					}
					if(sum<=k){
						ans=max(ans,cnt);
						continue;
					}
					break;
				}
			}
		}
	}
	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 36384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 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 -