# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1052842 | 2024-08-11T04:33:50 Z | amongus_pvp | 사탕 분배 (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include <iostream> #include <vector> #include <algorithm> using namespace std; // Function that takes vectors by const reference to avoid copying and improve efficiency vector<int> distribute_candies(const vector<int>& c, const vector<int>& l, const vector<int>& r, const vector<int>& v) { int n = c.size(); int q = l.size(); // Initialize the difference array with zeroes vector<int> diff(n + 1, 0); for (int j = 0; j < q; ++j) { diff[l[j]] += v[j]; if (r[j] + 1 < n) { diff[r[j] + 1] -= v[j]; } } // Calculate the actual number of candies in each box vector<int> s(n, 0); int current = 0; for (int i = 0; i < n; ++i) { current += diff[i]; s[i] = min(max(current, 0), c[i]); } return s; }