Submission #834673

#TimeUsernameProblemLanguageResultExecution timeMemory
834673Mohmad_ZaidDistributing Candies (IOI21_candies)C++17
0 / 100
5050 ms7244 KiB
#include "candies.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

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> s(n,0);
    for(int i=0;i<q;i++){
        for(int j=l[i];j<=r[i];j++){
            if(v[i]>0){
                ll temp=s[i]+v[i];
                if(temp>INT_MAX){
                    s[i]=c[i];
                }else s[i]=min(c[i],(int)temp);
            }else{
                ll temp=s[i]-v[i];
                if(temp<0){
                    s[i]=0;
                }else s[i]=(int)temp;
            }
        }
    }
    return s;
}
#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...