oj.uz

Submission #1097276

# Submission time Handle Problem Language Result Execution time Memory
1097276 2024-10-06T16:00:07 Z Trisanu_Das Bikeparking (EGOI24_bikeparking) C++17
0 / 100
 1000 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, ans = 0; cin >> n;
  int x[n], y[n];
  for(int i = 0; i < n; i++) cin >> x[i];
  for(int i = 0; i < n; i++) cin >> y[i];
  int i = 0, j = 1;
  while(true){
    while(i < n && x[i] > 0) i++;
    if(i == n) break;
    if(i >= j) j = i + 1;
    while(j < n && y[j] > 0) j++;
    if(j == n) break;
    int curr = min(x[i], y[j]);
    ans += curr;
    x[i] -= curr; y[j] -= curr;
  }
  for(int i = 0; i < n; i++) ans -= max(0, y[i] - x[i]);
  cout << ans << '\n';
}

Subtask #1
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1020 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -