제출 #1242739

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242739		franuch	사탕 분배 (IOI21_candies)	C++20	3 / 100	5095 ms	7236 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<ll, ll> pll;
#define vc vector
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define pub push_back
#define pob pop_back

vc<ll> distribute_candies(vc<ll> c, vc<ll> l, vc<ll> r, vc<ll> v) {
    ll n = sz(c), q = sz(l);
	vc<ll> a(n, 0);
	for (ll i = 0; i < q; i++) {
		for (ll j = l[i]; j <= r[i]; j++)
			if (v[i] > 0)
				a[j] = min(c[j], a[j] + v[i]);
			else
				a[j] = max(0, a[j] + v[i]);
	}
    return a;
}

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