Submission #1044210

#TimeUsernameProblemLanguageResultExecution timeMemory
1044210UnforgettableplDistributing Candies (IOI21_candies)C++17
8 / 100
59 ms13020 KiB
#include "candies.h" #include <bits/stdc++.h> 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 = v.size(); vector<int> s(n); vector<long long> p(n+1); for(int i=0;i<q;i++){ p[l[i]]+=v[i]; p[r[i]+1]-=v[i]; } for(int i=1;i<n;i++)p[i]+=p[i-1]; for(int i=0;i<n;i++)s[i]=min(p[i],(long long)c[i]); 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...