Submission #1217740

#TimeUsernameProblemLanguageResultExecution timeMemory
1217740guagua0407Distributing Candies (IOI21_candies)C++20
8 / 100
60 ms9032 KiB
#include "candies.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

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();
    int q=(int)l.size();
    vector<int> a(n);
    vector<ll> pre(n+1);
    for(int i=0;i<q;i++){
        pre[l[i]]+=v[i];
        pre[r[i]+1]-=v[i];
    }
    for(int i=1;i<n;i++){
        pre[i]+=pre[i-1];
    }
    for(int i=0;i<n;i++){
        a[i]=min((ll)c[i],pre[i]);
    }
    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...