Submission #888634

#TimeUsernameProblemLanguageResultExecution timeMemory
888634irmuunDistributing Candies (IOI21_candies)C++17
8 / 100
83 ms14512 KiB
#include<bits/stdc++.h> #include "candies.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() vector<int>distribute_candies(vector<int>c,vector<int>l,vector<int>r,vector<int>v){ int n=c.size(),q=l.size(); vector<int>ans(n,0); vector<ll>add(n,0),sub(n,0); for(int i=0;i<q;i++){ add[l[i]]+=v[i]; sub[r[i]]+=v[i]; } ll cur=0; for(int i=0;i<n;i++){ cur+=add[i]; if(cur>c[i]){ ans[i]=c[i]; } else{ ans[i]=(int)cur; } cur-=sub[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...