Submission #1206688

#TimeUsernameProblemLanguageResultExecution timeMemory
1206688tkm_algorithmsDistributing Candies (IOI21_candies)C++20
3 / 100
5093 ms7344 KiB
/** * In the name of Allah * We are nothing and you're everything **/ #include <bits/stdc++.h> #include "candies.h" using namespace std; using ll = long long; using ull = uint64_t; #define all(x) begin(x), end(x) #define sz(x) (int)(x).size() //#define int long long const char nl = '\n'; const int N = 2e5+1; const ll inf = 0x3f3f3f3f3f3f3f3fll; const int mod = 1e9+7; std::vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = sz(c), q = sz(r); vector<int> s(n); for (int i = 0; i < q; ++i) { for (int j = l[i]; j <= r[i]; ++j) { if (v[i] < 0)s[j] = max(s[j]+v[i], 0); else s[j] = min(s[j]+v[i], 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...