제출 #826891

#제출 시각아이디문제언어결과실행 시간메모리
826891Sohsoh84사탕 분배 (IOI21_candies)C++17
100 / 100
4761 ms7420 KiB
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx") #include "candies.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 2e5; const int T = 2000; int A[MAXN]; 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(MAXN, 0); A.shrink_to_fit(); for (int s = 0; s < MAXN; s += T) { int fl = s, fr = s + T - 1; for (int i = 0; i < q; i++) { int tl = (fl > l[i] ? fl : l[i]); 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 ? A[j] : 0); } } } A.resize(n); 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...