Submission #451552

#	Time	Username	Problem	Language	Result	Execution time	Memory
451552		T0p_	Distributing Candies (IOI21_candies)	C++17	3 / 100	492 ms	6460 KiB

candies

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

const int N = 2e5+5;

int n, q;
int arr[N], capacity[N];

vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    n = c.size(), q = l.size();
    if(n > 2000) return {};
    for(int i=1 ; i<=n ; i++) capacity[i] = c[i-1];
    for(int i=0 ; i<q ; i++)
    {
        int a = l[i]+1, b = r[i]+1, c = v[i];
        for(int j=a ; j<=b ; j++)
        {
            arr[j] += c;
            arr[j] = max(arr[j], 0);
            arr[j] = min(arr[j], capacity[j]);
        }
    }
    vector<int> ret;
    for(int i=1 ; i<=n ; i++) ret.push_back(arr[i]);
    return ret;
}

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