Submission #1043443

#TimeUsernameProblemLanguageResultExecution timeMemory
1043443DorostWefDistributing Candies (IOI21_candies)C++17
3 / 100
5081 ms13396 KiB
#include "candies.h" #define Min(a,b) ((a)<(b)?(a):(b)) #define Max(a,b) ((a)>(b)?(a):(b)) #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") using namespace std; const int N = 200004; int a[N]; 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(); int q = (int)l.size(); for (int i = 0; i < q; i++) { for (int j = l[i]; j <= r[i]; j++) { a[j] += v[i]; a[j] = Min (a[j], c[j]); a[j] = Max (a[j], 0); } } std::vector<int> s(n); for (int i = 0; i < n; i++) s[i] = a[i]; 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...