Submission #465624

#TimeUsernameProblemLanguageResultExecution timeMemory
465624alexxela12345Distributing Candies (IOI21_candies)C++17
3 / 100
5090 ms11716 KiB
#include "candies.h" #include <bits/stdc++.h> std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { int n = c.size(); std::vector<int> s(n); for (int i = 0; i < (int) l.size(); i++) { for (int j = l[i]; j <= r[i]; j++) { if (v[i] < 0) { s[j] += v[i]; if (s[j] < 0) s[j] = 0; } else { s[j] += v[i]; if (s[j] > c[j]) s[j] = c[j]; } } } 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...