Submission #1179390

#TimeUsernameProblemLanguageResultExecution timeMemory
1179390hyakupDistributing Candies (IOI21_candies)C++20
3 / 100
5093 ms7240 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(), m = l.size(); vector<int> resp(n); for( int i = 0; i < m; i++ ){ for( int j = l[i]; j <= r[i]; j++ ){ resp[j] += v[i]; resp[j] = min( resp[j], c[j] ); resp[j] = max( resp[j], 0 ); } } return resp; }
#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...