Submission #535398

#TimeUsernameProblemLanguageResultExecution timeMemory
535398pokmui9909Distributing Candies (IOI21_candies)C++17
0 / 100
5058 ms12256 KiB
#include "candies.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;

ll N, Q;
vector<int> a;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {

    N = c.size(), Q = l.size();
    a = c;
    for(int i = 0; i < Q; i++){
        for(int j = l[i]; j <= r[i]; j++){
            a[j] += v[i];
            if(a[j] > c[j]) a[j] = c[j];
            if(a[j] < 0   ) a[j] = 0;
        }
    }
    return a;
}
#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...