| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 975075 | pransh_8 | 사탕 분배 (IOI21_candies) | C++17 | 5080 ms | 13396 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.
//pransh_8
// #include "candies.h"
#include <bits/stdc++.h>
using namespace std;
//Macros:
#define FOR(i, a, n) for(int i=a;i<n;++i)
#define FORR(i, a, n) for(int i=a;i>=n;--i)
/*------------------------------Code-Begins----------------------------------*/
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size(), q = l.size();
vector<int> ans(n);
FOR(i,0,q) {
FOR(k,l[i],r[i]+1) {
if (v[i]>0)
ans[k]=min((long long)c[k],(long long)(ans[k]+v[i]));
else
ans[k]=max(0ll,(long long)(ans[k]+v[i]));
}
}
return ans;
}
/*
signed main() {
int n, q;
cin >> n;
vector<int> c(n);
FOR(i,0,n) cin >> c[i];
cin >> q;
vector<int> l(q), r(q), v(q);
FOR(i,0,q)
cin >> l[i] >> r[i] >> v[i];
vector<int> ans = distribute_candies(c,l,r,v);
FOR(i,0,n)
cout << ans[i] << ' ';
cout << endl;
return 0;
}*/| # | 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... | ||||
