| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 839273 | nguyentunglam | Distributing Candies (IOI21_candies) | C++17 | 5089 ms | 9200 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
vector<int> distribute_candies (vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
vector<int> p;
p.resize(c.size());
for(int query = 0; query < v.size(); query++) {
for(int i = l[query]; i <= r[query]; i++) {
p[i] += v[query];
p[i] = max(0, p[i]);
p[i] = min(c[i], p[i]);
}
// for(int i = 0; i < p.size(); i++) cout << p[i] << " "; cout << endl;
}
return p;
}
#ifdef ngu
int main() {
freopen ("task.inp", "r", stdin);
freopen ("task.out", "w", stdout);
int n, q; cin >> n >> q;
vector<int> c(n), l(q), r(q), v(q);
for(int i = 0; i < n; i++) cin >> c[i];
for(int i = 0; i < q; i++) cin >> l[i] >> r[i] >> v[i];
vector<int> ans = distribute_candies(c, l, r, v);
// for(int &j : ans) cout << j << " ";
}
#endif // ngu
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
