Submission #1213378

#TimeUsernameProblemLanguageResultExecution timeMemory
1213378omsincoconutDistributing Candies (IOI21_candies)C++17
0 / 100
60 ms9028 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(), q = l.size(); vector<long long> qc(n+1); for (int i = 0; i < q; i++) { qc[l[i]] += v[i]; qc[r[i]+1] -= v[i]; } vector<int> s(n); long long sm = 0; for (int i = 0; i < n; i++) { sm += qc[i]; s[i] = min((long long)v[i], sm); } 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...