| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1035126 | BABY_GANGSTER | Jobs (BOI24_jobs) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
int a,b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c,d,e,f;
};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l,s33;
int i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
// fin(task),fou(task);
#endif
///NHP
/// cin>>s1;
// modwwe
phongbeo();
}
vector<ib> v[300001];
struct cmp
{
bool operator()(ib a,ib b)
{
return a.a>b.a;
}
};
priority_queue<ib,vector<ib>,cmp>p;
int heavy[300001];
int a[300001];
bool b[300001];
bool cmp2(ib a,ib b)
{
return a.b>b.b;
}
int dfs(int x,int c,int d,int e)
{
int d2=c-d;
int e2=e;
vector<ib> vv;
for(auto f:v[x])
{ if(c>=0) d=c,e=0;
vv.pb({f.a,dfs(f.a,c+f.b,d,min(c-d,e))});
}
sort(vv.begin(),vv.end(),cmp2);
if(vv.size()!=0)heavy[x]=vv[0].a;
if(c-d>=0) return e2;
else if(vv.size()!=0) return vv[0].b;
else return -1e18;
}
void dfs2(int x,int y,int e,int d)
{ b[x]=1;
//cout<<x<<" "<<g<<" "<<heavy[x]<<" "<<e<<" "<<d,debug
if(d>=0)p.push({abs(e),d}),d=0,e=0,y=0;
if(heavy[x]!=0)dfs2(heavy[x],y,min(e,d-y),d+a[heavy[x]]);
for(auto f:v[x])
if(!b[f.a])
dfs2(f.a,0,0,a[f.a]);
}
void phongbeo()
{
cin>>n>>dem;
dem2=dem;
for(int i=1;i<=n;i++)
cin>>l>>r,v[r].pb({i,l}),a[i]=l;
dfs(0,0,0,0);
dfs2(0,0,0,0,0);
while(!p.empty())
{
ib x=p.top();
if(dem>=x.a)dem+=x.b;
else break;
p.pop();
}
cout<<dem-dem2;
}