# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598547 | definitelynotmee | Distributing Candies (IOI21_candies) | C++17 | 465 ms | 13652 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename t>
using matrix = vector<vector<t>>;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v) {
int n = c.size();
vector<int> s(n);
if(n <= 2000){
for(int i = 0; i < l.size(); i++){
for(int j = l[i]; j <= r[i]; j++){
s[j]+=v[i];
s[j]= min(c[j],s[j]);
s[j] = max(0,s[j]);
}
}
} else {
vector<ll> delta(n+1);
for(int i = 0; i < l.size(); i++){
delta[l[i]]+=v[i];
delta[r[i]+1]-=v[i];
}
ll cur = 0;
for(int i = 0; i < n; i++){
cur+=delta[i];
s[i] = min(ll(c[i]),cur);
}
}
return s;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |