Submission #1215467

#TimeUsernameProblemLanguageResultExecution timeMemory
1215467thelegendary08Distributing Candies (IOI21_candies)C++17
3 / 100
5093 ms7240 KiB
#include "candies.h"
#include<bits/stdc++.h>
#define vi vector<int>
#define f0r(i,n) for(int i = 0; i<n; i++)
#define mp make_pair
#define pb push_back
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define pii pair<int,int>
#define dout(x) cout<<x<<' '<<#x<<'\n';
#define vout(x) for(auto u : x)cout<<u<<' '; cout<<'\n';
#define vvi vector<vi>
#define vb vector<bool>
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();
    vi ans(n);
    int q = l.size();
    f0r(i, q){
    	FOR(j, l[i], r[i] + 1){
    		if(v[i] > 0){
    			ans[j] = min(c[j], ans[j] + v[i]);
    		}
    		if(v[i] < 0){
    			ans[j] = max(0, ans[j] + v[i]);
    		}
    	}
    }
    return ans;
}
#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...