Submission #1048923

#TimeUsernameProblemLanguageResultExecution timeMemory
1048923nisanduuDistributing Candies (IOI21_candies)C++17
0 / 100
5060 ms7420 KiB
#include "candies.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    int n = c.size();
    int q = l.size();
    vector<int> s(n);
    
    for(ll i=0;i<q;i++){
        for(ll j=l[i];j<=r[i];j++){
            if(v[i]>0){
                s[j] = min(s[j]+v[i],c[j]);
            }else{
                s[j] = max(s[j]-v[i],0);
            }
        }
    }
    
    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...