제출 #435838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
435838		paisie	사탕 분배 (IOI21_candies)	C++17	0 / 100	124 ms	8132 KiB

candies

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forr(X) for(int i = 0; i<X; i++)
#pragma GCC optimize("Ofast")



vector<int> distribute_candies(vector <int> c, vector<int> l, vector <int>r, vector<int> v){
	int n = c.size();
	int q = l.size();
	
	vector <int> pre(n+1, 0), ans(n, 0);
	
	forr(q){
		pre[l[i]]+=v[i];
		pre[r[i]+1]-=v[i];
	}
	ans[0] = pre[0];
	for(int i=1; i<n; i++){
		ans[i] = ans[i-1] + pre[i];
	}
	forr(n){
		ans[i] = max(0, ans[i]);
		ans [i] = min(c[i], ans[i]);
	}
	
	
	
		
	return ans;
 }


/*int main(){
	vector <int> a = distribute_candies({10, 15, 13}, {0, 0}, {2, 1}, {20, -11});
	for(auto it:a)cout<<it<<" ";
}*/

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