| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 439566 | QuantumK9 | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 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;
vector<int> st1(vector<int> c, vector<int> l,
                vector<int> r, vector<int> v) {
    int n = c.size();
    vector<int> s(n);
    for( int i = 0; i < n; i++ ){ s[i] = 0; }
    int q = v.size();
    for( int i = 0; i < q; i++ ){
        for( int j = l[i]; j <= r[i]; j++ ){
            if( v[i] > 0 ){ s[j] = min( c[j], s[j]+v[i] ); }
            else if ( v[i] < 0 ){ s[j] = max( 0, s[j]+v[i] ); }
        }
    }
    return s;
}
vector<int> st2(vector<int> c, vector<int> l,
                vector<int> r, vector<int> v) {
    int n = c.size();
    int q = v.size();
    vector<int> pfs(n+3);
    for( int i = 0; i < n+3; i++ ){ pfs[i] = 0; }
    for( int i = 0; i < q; i++ ){
        pfs[ l[i] ] += v[i];
        pfs[ r[i]+1 ] -= v[i];
    }
    vector<int> ans(s);
    int rs = 0;
    for( int i = 0; i < n; i++ ){
        rs += pfs[i+1];
        ans[i] = min( c[i], rs );
    }
    return ans;
}
vector<int> distribute_candies(vector<int> c, vector<int> l,
                               vector<int> r, vector<int> v) {
    int n = c.size();
    int q = v.size();
    if ( n <= 2000 && q <= 2000 ){ return st1(c,l,r,v); }
    else{ return st2(c,l,r,v); }
}
