Submission #827094

#TimeUsernameProblemLanguageResultExecution timeMemory
827094NothingXDDistributing Candies (IOI21_candies)C++17
8 / 100
86 ms14040 KiB
#include "candies.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; void debug_out(){cerr << endl;} template<typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << ' '; debug_out(T...); } #define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__) #define F first #define S second #define all(x) x.begin(), x.end() #define MP(x, y) make_pair(x, y) const int maxn = 2e5 + 10; int n, q, c[maxn]; ll a[maxn]; vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) { n = C.size(); for (int i = 0; i < n; i++){ c[i] = C[i]; } q = L.size(); for (int i = 0; i < q; i++){ a[L[i]] += V[i]; a[R[i]+1] -= V[i]; } vector<int> ans; for (int i = 0; i < n; i++){ a[i] += a[i-1]; ans.push_back(min(a[i], (ll)c[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...