제출 #500239

#제출 시각아이디문제언어결과실행 시간메모리
500239sazid_alamDistributing Candies (IOI21_candies)C++17
11 / 100
432 ms8900 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int n = c.size(); vector<int> s(n, 0); vector<long long int> sum(n + 1, 0); if(n < 2005){ for(int i = 0; i < (int)v.size(); i++){ for(int j = l[i]; j <= r[i]; j++){ if(v[i] > 0) s[j] = min(c[j], s[j] + v[i]); else s[j] = max(0, s[j] + v[i]); } } return s; } else{ for(int i = 0; i < (int)v.size(); i++){ sum[l[i]] += v[i] * 1LL; sum[r[i] + 1] -= v[i] * 1LL; } for(int i = 1; i < n; i++) sum[i] += sum[i - 1]; for(int i = 0; i < n; i++) c[i] = min(c[i] * 1LL, sum[i]); return c; } }
#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...