Submission #1201514

#TimeUsernameProblemLanguageResultExecution timeMemory
1201514HappyCapybaraDistributing Candies (IOI21_candies)C++17
8 / 100
63 ms9032 KiB
#include "candies.h" #include<bits/stdc++.h> using namespace std; #define ll long long vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){ int n = c.size(), q = l.size(); vector<ll> res(n+1, 0); for (int i=0; i<q; i++){ res[l[i]] += v[i]; res[r[i]+1] -= v[i]; } for (int i=1; i<n; i++) res[i] += res[i-1]; vector<int> bruh(n); for (int i=0; i<n; i++) bruh[i] = min((ll) c[i], res[i]); return bruh; }
#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...