Submission #1053214

#TimeUsernameProblemLanguageResultExecution timeMemory
1053214noyancanturkDistributing Candies (IOI21_candies)C++17
3 / 100
62 ms7404 KiB
#include "candies.h"

#include <bits/stdc++.h>
using namespace std;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size(),m=r.size();
    if(n<=4000&&m<=4000){
        std::vector<int> s(n);
        for(int i=0;i<m;i++){
            for(int j=l[i];j<=r[i];j++){
                s[j]+=v[i];
                s[j]=min(c[j],max(0,s[j]));
            }
        }
        return s;
    }
    vector<int>s(n+1);
    for(int i=0;i<m;i++){
        s[l[i]]+=v[i];
        s[r[i]+1]-=v[i];
    }
    s.pop_back();
    for(int i=1;i<n;i++){
        s[i]+=s[i-1];
    }
    for(int i=0;i<n;i++){
        s[i]=min(s[i],c[i]);
    }
    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...