Submission #924859

#TimeUsernameProblemLanguageResultExecution timeMemory
924859Programmer123Distributing Candies (IOI21_candies)C++17
8 / 100
84 ms12880 KiB
#include "candies.h" #include <bits/stdc++.h> typedef std::vector<int> ivec; #define int long long ivec distribute_candies(ivec c, ivec l, ivec r, ivec v) { int N = c.size(); int Q = l.size(); ivec ans(N); int diff[N + 1]; for (int i = 0; i <= N; ++i) { diff[i] = 0; } for (int i = 0; i < Q; ++i) { diff[l[i]] += v[i]; diff[r[i] + 1] -= v[i]; assert(v[i] >= 0); } for (int i = 1; i <= N; ++i) { diff[i] += diff[i - 1]; assert(diff[i] >= 0); } assert(diff[N] == 0); for (int i = 0; i < N; ++i) { ans[i] = std::min<int>(diff[i], c[i]); } return ans; }
#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...