Submission #530457

#	Time	Username	Problem	Language	Result	Execution time	Memory
530457		Icebear16	Distributing Candies (IOI21_candies)	C++17	0 / 100	5058 ms	8352 KiB

candies

#include "candies.h"
#include <vector>
#include <algorithm>

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
    int n=c.size();
    int q=l.size();
    std::vector<int> s(n,0);
    bool flag=true;
    for(int i=0;i<q;i++){
    	if(v[i]<0){
    		flag=false;
    		break;
		}
	}
	if(flag==false){
		for(int j=0;j<q;j++){
			for(int i=l[j];i<=r[j];i++){
				if(v[j]>=0){
					if(c[i]>(s[i]+v[j])) s[i]+=v[j];
					else s[i]=c[i];
				}else{
					if((s[i]+v[j])<0) s[i]=0;
					else s[i]+=v[j];
				}
			}
		}
	}else{
		s.push_back(0);
		int h=0,k=0;
		for(int j=0;j<q;j++){
			h=l[j];
			s[h]+=v[j];
			k=r[j];
			s[k+1]-=v[j];
		}
		for(int i=1;i<=n;i++){
			s[i]+=s[i-1];
		}
		s.pop_back();
		for(int i=0;i<n;i++){
			if(s[i]>c[i]){
				s[i]=c[i];
			}
		}
	}
    return s;
}

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