Submission #623034

#	Time	Username	Problem	Language	Result	Execution time	Memory
623034		Hanksburger	Distributing Candies (IOI21_candies)	C++17	3 / 100	5075 ms	13604 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v)
{
    int n=c.size(), q=v.size();
    for (int i=0; i<n; i++)
        ans.push_back(0);
    for (int i=0; i<q; i++)
        for (int j=l[i]; j<=r[i]; j++)
            ans[j]=max(0, min(c[j], ans[j]+v[i]));
    return ans;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33