제출 #624404

#제출 시각아이디문제언어결과실행 시간메모리
624404dnx04사탕 분배 (IOI21_candies)C++17
0 / 100
5056 ms9692 KiB
#include "candies.h"

#include "bits/extc++.h"

using namespace std;

using Query = tuple<int, int, int>;

vector<int> sub1(const vector<int>& c, const vector<Query>& q) {
  vector<int> a(c.size());
  for (auto [l, r, v] : q) {
    for (int i = l; i <= r; ++i) {
      a[i] += v;
      if (a[i] < 0) a[i] = 0;
      if (a[i] > c[i]) a[i] = c[i];
    }
  }
  return a;
}

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r,
                               vector<int> v) {
  int n = c.size();
  vector<Query> q;
  for (int i = 0; i < n; ++i) q.emplace_back(l[i], r[i], v[i]);
  return sub1(c, q);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...