# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1003192 |
2024-06-20T07:38:36 Z |
Khanhcsp2 |
Jobs (BOI24_jobs) |
C++14 |
|
64 ms |
24144 KB |
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=3e5+11;
int n, s, x[N], p[N], ans;
vector<int> adj[N];
void dfs(int u, int s)
{
s+=x[u];
if(s<0) return;
ans=max(ans, s);
for(int v:adj[u]) dfs(v, s);
}
void sol()
{
cin >> n >> s;
for(int i=1;i<=n;i++)
{
cin >> x[i] >> p[i];
if(p[i]) adj[p[i]].push_back(i);
}
for(int i=1;i<=n;i++)
{
if(p[i]==0)
{
dfs(i, s);
}
}
cout << ans;
}
signed main()
{
// freopen("divisor.INP", "r", stdin);
// freopen("divisor.OUT", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--)
{
sol();
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
64 ms |
24144 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
7516 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
7516 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
7516 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
64 ms |
24144 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |