oj.uz

Submission #987529

# Submission time Handle Problem Language Result Execution time Memory
987529 2024-05-23T01:05:52 Z cig32 Fruits (NOI22_fruits) C++17
0 / 100
 73 ms 9296 KB 
#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];
      }
    }
    cout << ans << " \n"[i == n];
  }
  if(sumai == -n) {
    int ps[n+1];
    ps[0] = 0;
    for(int i=1; i<=n; i++) {
      ps[i] = ps[i-1] + c[i];
    }
    for(int i=1; i<=n; i++) {
      cout << ps[n] - ps[n - i] << " \n"[i == n];
    }
    return;
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t=1; //cin>>t;
  for(int i=1; i<=t; i++) solve(i);
}
/*
g++ T2443.cpp -std=c++17 -O2 -o T2443
./T2443 < input.txt
*/

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 9296 KB Output is correct
2 Incorrect 73 ms 8484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 42.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -