제출 #854432

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
854432		Wansur	봉쇄 시간 (IOI23_closing)	C++17	0 / 100	1058 ms	29752 KiB

closing

#include <vector>
#include<bits/stdc++.h>
#define f first
#define s second

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

vector<pair<int,int>> g[mx];
int d1[mx];
int d2[mx];
int 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]});
	}
	if(x>y){
		swap(x,y);
	}
	dfs(x,-1,0);
	dfs(y,-1,1);
	int sum=0,len=d1[y],ans=0,cnt=2*(y-x+1);
	for(int i=x;i<=y;i++){
		sum+=max(d1[i],d2[i]);
	}
	vector<int> v;
	for(int i=0;i<x;i++){
		v.push_back(d1[i]);
	}
	for(int i=y+1;i<n;i++){
		v.push_back(d2[i]);
	}
	sort(v.begin(),v.end());
	for(int i=0;i<v.size();i++){
		if(sum+v[i]<=k){
			sum+=v[i];
			cnt++;
		}
	}
	if(sum<=k){
		cnt+=min(n-(y-x+1),(k-sum)/len);
		ans=cnt;
	}
	for(int pos=x;pos<y;pos++){
		int cnt=0,sum=0;
		vector<int> v;
		for(int i=0;i<=pos;i++){
			v.push_back(d1[i]);
		}
		for(int i=pos+1;i<n;i++){
			v.push_back(d2[i]);
		}
		sort(v.begin(),v.end());
		for(int x:v){
			if(sum+x<=k){
				cnt++;
				sum+=x;
			}
		}
		ans=max(ans,cnt);
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:57:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for(int i=0;i<v.size();i++){
      |              ~^~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17