Submission #609536

#TimeUsernameProblemLanguageResultExecution timeMemory
609536OzyDistributing Candies (IOI21_candies)C++17
8 / 100
108 ms12884 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for (int i = (a); i <= (b); i++) #define repa(i,a,b) for (int i = (a); i >= (b); i--) #define lli long long int #define debug(a) cout << #a << " = " << a << endl #define debugsl(a) cout << #a << " = " << a << ", " #define MAX 200000 #define LIM 1000000001 lli n,q; int a; std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) { n = c.size(); q = r.size(); vector<int> arr; vector<lli> acu; arr.resize(n,0); acu.resize(n+2,0); rep(i,0,q-1) { acu[l[i]] += v[i]; acu[r[i]+1] -= v[i]; } lli sum = 0; rep(i,0,n-1) { sum += acu[i]; if (sum > LIM) a = LIM; else a = sum; arr[i] = min(a,c[i]); } return arr; }
#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...