Submission #1115509

#TimeUsernameProblemLanguageResultExecution timeMemory
1115509EfeBabagilJobs (BOI24_jobs)C++14
0 / 100
206 ms13640 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int N=1e5+5; const int mod=1e9+7; int32_t main() { int n,s; cin>>n>>s; vector<array<int,3>> jobs(n+1); vector<int> vis(n+1); int mon=s; jobs[0]={0,-1,0}; vis[0]=1; for(int i=1;i<=n;i++) { int a,b; cin>>a>>b; jobs[i]={a,b,i}; if(b==0) { if(a>0) { mon+=a; vis[i]=1; } } } for(int i=n;i>0;i--) { array<int,3> x=jobs[i]; if(x[0]<=0) continue; int prof=0; vector<int> done; int flag=1; //6 5 4 3 while(!vis[x[2]]) { prof+=x[0]; if(prof<=0){ flag=0; break; } x=jobs[x[1]]; } if(flag) { mon+=prof; } } cout<<mon-s; return 0; } // 1-> 3 0 // 2-> -3 1 // 3-> -3 0 // 4-> 2 1 // 5-> 6 3 // 6-> -4 5
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...