# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987529 | cig32 | Fruits (NOI22_fruits) | C++17 | 73 ms | 9296 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.
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int MAXN = 4e5 + 10;
void solve(int tc) {
int n;
cin >> n;
int a[n+1], c[n+1];
for(int i=1; i<=n; i++) cin >> a[i];
for(int i=1; i<=n; i++) cin >> c[i];
int sumci = 0;
int sumai = 0;
for(int i=1; i<=n; i++) {
sumci += c[i];
sumai += a[i];
}
int mx = 0, ans = 0;
for(int i=1; i<=n; i++) {
if(a[i] == -1) {
if(mx < n) {
mx++;
ans++;
}
}
else {
if(a[i] > mx) {
ans++;
mx = a[i];
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |