Submission #587243

# Submission time Handle Problem Language Result Execution time Memory
587243 2022-07-01T14:14:49 Z jakubd Distributing Candies (IOI21_candies) C++17
3 / 100
86 ms 12972 KB
#include "candies.h"

#include <bits/stdc++.h>

using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
  int n = c.size(), q = (int)l.size();
  vector<int> s;

  if (n <= 2000 && q <= 2000) {
    s.resize(n);

    for (int i = 0; i < q; i++) {
      for (int j = l[i]; j <= r[i]; j++) {
        s[j] += v[i];

        if (s[j] < 0) s[j] = 0;
        if (s[j] > c[j]) s[j] = c[j];
      }
    }
  } else {
    s.resize(n + 1);

    for (int i = 0; i < q; i++) {
      s[l[i]] += v[i];
      s[r[i] + 1] -= v[i];
    }

    for (int i = 0; i < n; i++) s[i + 1] += s[i];

    vector<int> res(n);
    for (int i = 0; i < n; i++) {
      res[i] = min(s[i + 1], c[i]);
    }
  }

  return s;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 86 ms 12972 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Incorrect 54 ms 8012 KB Output isn't correct
3 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 Incorrect 50 ms 7648 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 316 KB Output is correct
6 Incorrect 86 ms 12972 KB Output isn't correct
7 Halted 0 ms 0 KB -