Submission #830886

#TimeUsernameProblemLanguageResultExecution timeMemory
830886JohannDistributing Candies (IOI21_candies)C++17
8 / 100
82 ms13336 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vi; #define sz(x) (int)(x).size() #define all(x) (x).begin(), (x).end() int N, Q; std::vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { N = sz(c); Q = sz(l); vi S(N, 0); for (int q = 0; q < Q; ++q) { S[l[q]] += (ll)v[q]; S[++r[q]] -= (ll)v[q]; } partial_sum(all(S), S.begin()); for (int i = 0; i < N; ++i) S[i] = min((ll)c[i], S[i]); vector<int> ans; for (ll x : S) ans.push_back(x); 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...