Submission #1064214

#TimeUsernameProblemLanguageResultExecution timeMemory
1064214glupanDistributing Candies (IOI21_candies)C++17
8 / 100
82 ms13300 KiB
#include <bits/stdc++.h> using namespace std; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { int ok = 1; for(auto u : v) if(u < 0) ok=0; int n = c.size(), q = l.size(); if(ok) { vector<int>s(n); vector<long long> pref(n+1,0); for(int i=0; i<q; i++) { pref[l[i]] += v[i]; pref[r[i]+1] -= v[i]; } for(int i=1; i<=n; i++) pref[i]+=pref[i-1]; for(int i=0; i<n; i++) s[i] = min((long long)c[i],pref[i]); return s; } else { vector<int>s(n,0); for(int i=0; i<q; i++) { for(int j=l[i]; j<=r[i]; j++) { if(v[j] > 0) s[j] = min((long long)c[j], (long long) s[j] + (long long)v[i]); else s[j] = max(0LL, (long long)s[j] + (long long)v[i]); } } return s; } }
#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...