Submission #481457

#	Time	Username	Problem	Language	Result	Execution time	Memory
481457		yungyao	Distributing Candies (IOI21_candies)	C++17	3 / 100	5068 ms	13252 KiB

candies

using namespace std;
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>

typedef long long LL;
typedef pair<int,int> pii;
#define pb push_back
#define mkp make_pair
#define F first
#define S second
#define REP(n) for (int __=n;__--;)
#define REP1(i,n) for (int i=1;i<=n;++i)
#define REP0(i,n) for (int i=0;i<n;++i)
typedef vector <int> vi;

#include "candies.h"

vi distribute_candies(vi c,vi l,vi r,vi v){
    int n = c.size(),q = v.size();

    vi ret(n);
    REP0(i,q){
        for (int j=l[i];j<=r[i];++j)
            ret[j] = max(0,min(c[j],ret[j] + v[i]));
    }
    return ret;
}

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