제출 #594263

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594263		sentheta	Distributing Candies (IOI21_candies)	C++17	3 / 100	5081 ms	16332 KiB

candies

#include "candies.h"
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

#define rand() (uniform_int_distribution<int>(0,1<<30)(rng))
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;

int n;
V<int> c;

int q;
V<int> l, r, v;

V<int> distribute_candies(V<int>_c,V<int>_l,V<int>_r,V<int>_v) {
	c = _c; l = _l; r = _r; v = _v;
	n = c.size(); q = v.size();

	V<int> s(n);

	rep(i,0,q){
		rep(j,l[i],r[i]+1){
			s[j] += v[i];
			s[j] = max(0, s[j]);
			s[j] = min(c[j], s[j]);
		}
	}
	return s;
}

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