Submission #490534

#TimeUsernameProblemLanguageResultExecution timeMemory
490534nickmet2004Distributing Candies (IOI21_candies)C++17
0 / 100
103 ms12868 KiB
#include<bits/stdc++.h>
#include "candies.h"

#define ve vector<int>
using namespace std;
ve ans;
ve distribute_candies(ve c, ve l, ve r, ve v){
    int n =c.size() , q = v.size();
    ans.resize(n , 0);
    for(int i = 0; i < q; ++i){
        ans[l[i]] += v[i];
        ans[r[i] + 1] -= v[i];
    }
    for(int i = 1; i < n; ++i) ans[i] += ans[i - 1];
    for(int i = 0;i < n; ++i) ans[i] = min(ans[i] , c[i]);
    return ans;
}

#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...