Submission #826879

#TimeUsernameProblemLanguageResultExecution timeMemory
826879Sohsoh84Distributing Candies (IOI21_candies)C++17
0 / 100
5085 ms7272 KiB
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #include "candies.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 2e5; const int T = 1000; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int q = l.size(), n = c.size(); vector<int> A(n, 0); for (int s = 0; s < n; s += T) { int fl = s, fr = (s + T - 1 >= n ? n - 1 : s + T - 1); for (int i = 0; i < q; i++) { int tl = (fl > l[i] ? fl : 0); int tr = (fr < r[i] ? fr : r[i]); for (int j = tl; j <= tr; j++) { A[j] = A[j] + v[i]; A[j] = (A[j] > c[j] ? c[j] : A[j]); A[j] = (A[j] < 0 ? 0 : A[j]); } } } return A; }
#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...