Submission #996374

#TimeUsernameProblemLanguageResultExecution timeMemory
996374cpdreamerDistributing Candies (IOI21_candies)C++17
0 / 100
5015 ms7248 KiB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define V vector
typedef long long ll;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v) {
    int n = (int)c.size();
    std::vector<int> s(n,0);
    for(int i=0;i<(int)l.size();i++){
        for(int 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...