| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1365303 | vahagng | Jobs (BOI24_jobs) | C++20 | 98 ms | 21420 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
long long n, s, p[N], a[N], dp[2002][2002];
vector<int> adj[N];
int in[N];
int main(){
cin >> n >> s;
for(int i = 1; i <= n; i++){
cin >> a[i] >> p[i];
if(p[i]) adj[p[i]].push_back(i), in[i]++;
}
long long ans = 0, p = 0;
for(int i = 1; i <= n; i++){
if(p + a[i] >= 0){
p += a[i];
}else{
break;
}
ans = max(ans, p);
}
cout << ans << endl;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
