| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 832774 | 2023-08-21T14:50:12 Z | vqpahmad | 사탕 분배 (IOI21_candies) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h>
#include "candies.h"
using namespace std;
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define endl '\n'
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mod = 1e9 + 7;
const int N = 1e6 + 15;
const ll inf = 1e18;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
int n = c.size();
vector<int> s(n);
int q = sz(v);
int sub1 = (n<=2000&&q<=2000);
int sub2 = 1;
int sub3 = 1;
int sub4 = 1;
for (auto it : v){
if (it < 0) sub2 = 0;
}
for (int i=1;i<n;i++){
sub3 &= c[i]==c[i-1];
}
for (int i=0;i<q;i++){
sub4 &= l[i]==0&&r[i]==n-1;
}
if (sub1){
for (int i=0;i<q;i++){
for (int k=l[i];k<=r[i];k++){
s[k] += v[i];
s[k] = max(0ll,s[k]);
s[k] = min(s[k],c[k]);
}
}
}
else if (sub2){
vector<int> prf(n+1,0);
for (int i=0;i<q;i++){
prf[l[i]]+=v[i];
prf[r[i]+1]-=v[i];
}
for (int i=1;i<=n;i++){
prf[i] += prf[i-1];
}
for (int i=0;i<n;i++){
prf[i] = min(prf[i],c[i]);
s[i] = prf[i];
}
}
else if (sub3){
}
else if (sub4){
vector<int> a(q);
for (int i=0;i<q;i++){
a[i] = v[i];
if (i) a[i] += a[i-1];
}
vector<int> mn(q+1), mx(q+1);
mn[q] = inf, mx[q] = -inf;
for (int i=n-1;i>=0;i--){
mn[i] = min(a[i],mn[i+1]);
mx[i] = max(a[i],mx[i+1]);
}
for (int i=0;i<n;i++){
int lo=-1,hi=q;// lo + 1
while (hi-lo > 1){
int mi = (lo+hi)/2;
if (mx[mi]-mn[mi] >= c[i]) hi = mi;
else lo = mi;
}
if (hi==n){
s[i] = a.back();
}
else {
if (a[hi]==mx[hi]){// hit zero
s[i] = mx[hi]-mn[hi];
}
else {
s[i] = c[i] - (mx[hi]-mn[hi]);
}
}
}
}
return s;
}
#undef int