Submission #1242741

#TimeUsernameProblemLanguageResultExecution timeMemory
1242741franuchDistributing Candies (IOI21_candies)C++20
0 / 100
58 ms8260 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; typedef int ll; typedef pair<ll, ll> pll; #define vc vector #define st first #define nd second #define all(a) a.begin(), a.end() #define sz(a) (ll)a.size() #define pub push_back #define pob pop_back vc<ll> distribute_candies(vc<ll> c, vc<ll> l, vc<ll> r, vc<ll> v) { ll n = sz(c), q = sz(l); vc<ll> o(n + 1); for (ll i = 0; i < q; i++) { o[l[i]] += v[i]; o[r[i] + 1] -= v[i]; } vc<ll> a(n); ll s = 0; for (ll i = 0; i < n; i++) { s += o[i]; a[i] = min(s, c[i]); } return a; }
#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...