제출 #1217480

#제출 시각아이디문제언어결과실행 시간메모리
1217480hengliao사탕 분배 (IOI21_candies)C++20
3 / 100
5093 ms8464 KiB
#include "candies.h" #include<bits/stdc++.h> using namespace std; #define F first #define S second #define pb push_back #define vll vector<ll> #define pll pair<ll, ll> typedef long long ll; vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) { ll n = c.size(); ll q=l.size(); vll a(n); for(ll i=0;i<q;i++){ for(ll j=l[i];j<=r[i];j++){ a[j]+=v[i]; a[j]=max(a[j], 0LL); a[j]=min(a[j], (ll) c[j]); } } vector<int> re(n); for(ll i=0;i<n;i++){ re[i]=a[i]; } return re; }
#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...