Submission #603008

#TimeUsernameProblemLanguageResultExecution timeMemory
603008FatihSolakDistributing Candies (IOI21_candies)C++17
3 / 100
5098 ms11180 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 = c.size();
    int q = l.size();
    vector<int> s(n);
    for(int i = 0;i<q;i++){
        for(int j = l[i];j<=r[i];j++){
            s[j] += v[i];
            s[j] = max(s[j],0);
            s[j] = min(s[j],c[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...