| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1076635 | 2024-08-26T15:10:22 Z | MarwenElarbi | Closing Time (IOI23_closing) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#include "closing.h"
using namespace std;
#define pb push_back
#define fi first
#define se second
#define int long long
const int nax = 2e5+5;
const int MOD = 1e9+7;
int max_score(int N, int X, int Y, long long K,
std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
vector<pair<int,int>> adj[N];
long long a[N],b[N];
if(X>Y) swap(X,Y);
for (int i = 0; i < N-1; ++i)
{
adj[U[i]].pb({V[i],W[i]});
adj[V[i]].pb({U[i],W[i]});
}
for (int i = 0; i < N; ++i)
{
if(adj[i].size()==1) continue;
if(adj[i][0].fi>adj[i][1].fi) swap(adj[i][0],adj[i][1]);
}
a[X]=0;
b[Y]=0;
for (int i = X+1; i < N; ++i) a[i]=a[i-1]+adj[i][0].se;
for (int i = X-1; i >=0; --i) a[i]=a[i+1]+(i ? adj[i][1].se : adj[i][0].se);
for (int i = Y+1; i < N; ++i) b[i]=b[i-1]+adj[i][0].se;
for (int i = Y-1; i >=0; --i) b[i]=b[i+1]+(i ? adj[i][1].se : adj[i][0].se);
long long pre[N];
memset(pre,0,sizeof pre);
pre[Y]=0;
for (int i = Y+1; i < N; ++i) pre[i]=pre[i-1]+b[i];
long long cnt=K;
long long ans=0;
int res=0;
for (int i = X; i >= 0; i--)
{
ans++;
cnt-=a[i];
if(cnt<0) break;
long long cntj=cnt;
int ansj=ans;
for (int j = X; j < N; ++j)
{
if(j>X) ansj++;
cntj-=a[j];
if(cntj<0) break;
long long cntk=cntj;
int ansk=ansj;
for (int k = Y; k >= 0; k--)
{
ansk++;
if(k>j||k<i) cntk-=b[k];
else if(b[k]>a[k]) cntk-=(b[k]-a[k]);
if(cntk<0) break;
int left=max(j,Y);
int l=left;
int r=N;
while(r-l>1){
int mid=(r+l)/2;
if(pre[mid]-pre[left-1]>K) r=mid;
else if(pre[mid]-pre[left-1]>cntk) r=mid;
else l=mid;
}
res=max(res,ansk+(l-Y));
}
}
}
return res;
}