# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498863 | dnztnc | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//
// main.cpp
// ioi-candies
//
// Created by Deniz Tanacı on 25.12.2021.
//
#include <iostream>
using namespace std;
int seker_dagit(int sinir,int mevcut,int v){
if(v<0){
for(int i=0;i<-v&&mevcut>=1;i++){
mevcut=mevcut-1;
}
return mevcut;
}
else{
for(int i=0;i<v&&mevcut<=(sinir-1);i++){mevcut++;}
return mevcut;
}
}
int main() {
// insert code here...
int n,q;
cin>>n;
int c[n];
for (int i=0;i<n;i++){cin>>c[i];}
cin>>q;
int mevcut[n];
int l[q],r[q],v[q];
for (int i=0;i<q;i++){cin>>l[i]>>r[i]>>v[i];}
for(int i=0;i<q;i++){
for(;l[i]<=r[i];l[i]++){mevcut[l[i]]=seker_dagit(c[l[i]], mevcut[l[i]], v[i]);}
}
for(int i=0;i<n;i++){cout<<mevcut[i]<<" ";}
return 0;
}