Submission #446196

#	Time	Username	Problem	Language	Result	Execution time	Memory
446196		arnold518	Distributing Candies (IOI21_candies)	C++17	3 / 100	5086 ms	14532 KiB

candies

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;
const ll INF = 1e18;

struct Query
{
    int l, r, v;
};

int N, Q;
int A[MAXN+10];
Query B[MAXN+10];
int ans[MAXN+10];



vector<int> distribute_candies(vector<int> _C, vector<int> _L, vector<int> _R, vector<int> _V)
{
    N=_C.size(); Q=_L.size();
    for(int i=1; i<=N; i++) A[i]=_C[i-1];
    for(int i=1; i<=Q; i++) B[i]={_L[i-1]+1, _R[i-1]+1, _V[i-1]};

    for(int i=1; i<=Q; i++)
    {
        for(int j=B[i].l; j<=B[i].r; j++)
        {
            ans[j]+=B[i].v;
            ans[j]=max(ans[j], 0);
            ans[j]=min(ans[j], A[j]);
        }
    }

    return vector<int>(ans+1, ans+N+1);
}

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