Submission #796717

#	Time	Username	Problem	Language	Result	Execution time	Memory
796717		Minindu206	Distributing Candies (IOI21_candies)	C++17	3 / 100	85 ms	8800 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v)
{
    int n = c.size(), q = l.size();
    vector<int> candies(n, 0);
    if (n <= 2000 && q <= 2000)
    {
        for (int i = 0; i < q; i++)
        {
            int ll = l[i], rr = r[i];
            while (ll <= rr)
            {
                candies[ll] += v[i];
                if (candies[ll] > c[ll])
                    candies[ll] = c[ll];
                if (candies[ll] < 0)
                    candies[ll] = 0;
                ll++;
            }
        }
        return candies;
    }
    else
    {
        vector<int> pref1(n, 0), pref2(n, 0);
        for (int i = 0; i < q; i++)
        {
            pref1[l[i]] += v[i];
            pref2[r[i]] += v[i];
        }
        for(int i=0;i<n;i++)
        {
            int ans = pref1[i];
            if(i > 0)
                ans -= pref2[i - 1];
            candies[i] = min(c[i], ans);
            if(i < n - 1)
            {
                pref1[i + 1] += pref1[i];
                pref2[i + 1] += pref2[i];
            }
        }
        return candies;
    }
}

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