# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1043292 | guagua0407 | Jobs (BOI24_jobs) | C++17 | 75 ms | 33876 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int mxn=3e5+5;
vector<int> adj[mxn];
vector<ll> x(mxn);
vector<ll> dp(mxn);
void dfs(int v,int p=-1){
dp[v]=x[v];
for(auto u:adj[v]){
dfs(u,v);
if(dp[u]>0) dp[v]+=dp[u];
}
}
int main() {_
int n;
ll S;
cin>>n>>S;
vector<int> p(mxn);
for(int i=1;i<=n;i++){
cin>>x[i]>>p[i];
adj[p[i]].push_back(i);
}
dfs(0);
cout<<dp[0]<<'\n';
return 0;
}
//maybe its multiset not set
//yeeorz
//laborz
Compilation message (stderr)
# | 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... |