# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1052982 | mychecksedad | Distributing Candies (IOI21_candies) | C++17 | 3555 ms | 2097152 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 pb push_back
#define ll long long int
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second
const int N = 3e5+100;
std::vector<int> distribute_candies(std::vector<int> cc, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
vector<ll> c(all(cc));
int n = c.size();
int q = l.size();
std::vector<int> s(n);
vector<vector<int>> Q(n);
for(int i = 0; i < q; ++i){
for(int j = l[i]; j <= r[i]; ++j){
Q[j].pb(v[i]);
}
}
for(int i = 0; i < n; ++i){
if(Q[i].size() == 0) continue;
ll sum = 0;
int x = 0;
for(int j = Q[i].size() - 1; j >= 0; --j){
// cout << Q[i][j] << ' ';
ll v = Q[i][j];
if(v >= c[i]){
x = j;
break;
}else if(v <= -c[i]){
x = j;
break;
}
if(sum + v <= -c[i]){
x = j;
break;
}else if(sum + v >= c[i]){
x = j;
break;
}else{
sum += v;
}
}
sum = 0;
for(int j = x; j < Q[i].size(); ++j){
sum += Q[i][j];
sum = max(0ll, min(sum, c[i]));
}
s[i] = sum;
}
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... |