Submission #1020936

#TimeUsernameProblemLanguageResultExecution timeMemory
1020936NeroZeinDistributing Candies (IOI21_candies)C++17
0 / 100
5060 ms12116 KiB
#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 = (int) c.size(), q = (int) l.size();
  vector<int> s(n);
  for (int i = 0; i < q; ++i) {
    for (int j = l[i]; j <= r[i]; ++j) {
      s[j] = s[j] + v[i];
      s[j] = max(s[j], 0);
      s[j] = min(s[j], c[j]); 
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      if (c[i] <= c[j]) assert(s[i] <= s[j]); 
    }
  }
  return s;
}
#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...