이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define N 300001
ll x[N];
ll y[N];
ll p[N];
void solve(){
ll n,m,s;
cin>>n>>s;
vector<pll> v;
for(int i=1;i<=n;i++){
cin>>m>>p[i];
if(x[p[i]]<0){
y[i]=max(y[p[i]],-x[p[i]]-m);
x[i]=x[p[i]]+m;
}
else{
x[i]=m;
y[i]=max(-m,y[p[i]]);
}
if(x[i]>0)
v.append({y[i],x[i]});
}
m=s;
sort(all(v));
for(auto& i:v){
if(i.ff>m) break;
m+=i.ss;
}
cout<<m-s;
}
int terminator(){
L0TA;
solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |