Submission #440388

#	Time	Username	Problem	Language	Result	Execution time	Memory
440388		i_am_noob	사탕 분배 (IOI21_candies)	C++17	8 / 100	140 ms	8904 KiB

candies

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

#define ll long long
//#define int ll
#define rep(n) rep1(i,n)
#define rep1(i,n) rep2(i,0,n)
#define rep2(i,a,b) for(int i=a; i<(b); ++i)
#define rep3(i,a,b) for(int i=a; i>=(b); --i)
#define chkmax(a,b) (a=max(a,b))
#define chkmin(a,b) (a=min(a,b))
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define pb push_back
#define pii pair<int,int>
#define pow2(x) (1ll<<(x))
#ifdef zisk
#define bug(...) cerr << "#" << __LINE__ << ": " << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T x){cerr << x << endl;}
template<typename T, typename ...S> void _do(T x, S... y){cerr << x << ", "; _do(y...);}
#else
#define bug(...) 49
#endif

int n,q;

vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    n=sz(c);
    q=sz(l);
    vector<ll> res(n);
    vector<int> res2(n);
    rep1(j,q){
    	if(r[j]<n-1) res[r[j]+1]-=v[j];
    	res[l[j]]+=v[j];
    }
    rep2(i,1,n) res[i]+=res[i-1];
    rep(n) chkmin(res[i],(ll)c[i]);
    rep(n) res2[i]=res[i];
    return res2;
}

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