Submission #435498

#TimeUsernameProblemLanguageResultExecution timeMemory
435498kshitij_sodaniDistributing Candies (IOI21_candies)C++17
3 / 100
5045 ms7276 KiB
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long llo;

#include "candies.h"

#include <vector>
int cur[200001];
std::vector<int> distribute_candies(vector<int> it,vector<int> ll,
                                    vector<int> rr,vector<int> aa) {
    
	int n=it.size();
	int q=ll.size();
	for(int i=0;i<n;i++){
		cur[i]=0;
	}
	for(int i=0;i<q;i++){
		for(int j=ll[i];j<=rr[i];j++){
			cur[j]+=aa[i];
			cur[j]=max(cur[j],0);
			cur[j]=min(cur[j],it[j]);
		}
	}
	vector<int> ans;
	for(int i=0;i<n;i++){
		ans.pb(cur[i]);
	}










    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...