제출 #1241959

#제출 시각아이디문제언어결과실행 시간메모리
1241959hayford08사탕 분배 (IOI21_candies)C++20
8 / 100
61 ms9032 KiB
#include <vector> using namespace std; 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(); vector<long long> prefix(n + 1, 0); int numQueries = l.size(); for (int i = 0; i < numQueries; i++) { int left = l[i], right = r[i], value = v[i]; prefix[left] += value; prefix[right + 1] -= value; } for (int i = 1; i < n; i++) { prefix[i] += prefix[i - 1]; } vector<int> res(n); for (int i = 0; i < n; i++) { long long val = min(1ll * c[i], prefix[i]); res[i] = (int)val; } return res; }
#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...