Submission #596105

# Submission time Handle Problem Language Result Execution time Memory
596105 2022-07-14T11:35:54 Z SuhaibSawalha1 Distributing Candies (IOI21_candies) C++17
3 / 100
5000 ms 13260 KB
#include "candies.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
  int n = c.size(), q = l.size();
  vector<int> a(n);
  for (int qs = 0; qs < q; ++qs) {
    for (int i = l[qs]; i <= r[qs]; ++i) {
      if (v[qs] > 0) a[i] = min(c[i], a[i] + v[qs]);
      else a[i] = max(0, a[i] + v[qs]);
    }
  }
  return a;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 5031 ms 12116 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 198 ms 8232 KB Output is correct
3 Correct 172 ms 5900 KB Output is correct
4 Execution timed out 5089 ms 13260 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 400 ms 7652 KB Output is correct
4 Correct 403 ms 4004 KB Output is correct
5 Execution timed out 5068 ms 10840 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Execution timed out 5031 ms 12116 KB Time limit exceeded
7 Halted 0 ms 0 KB -