제출 #1043077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043077		Dan4Life	사탕 분배 (IOI21_candies)	C++17	38 / 100	1986 ms	7504 KiB

candies

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using vi = vector<int>;
using ll = long long;
const int mxN = (int)2e5+10;
const ll LINF = (ll)1e18;
ll mxsuf[mxN], mnsuf[mxN], pref[mxN];

vi distribute_candies(vi c, vi l, vi r, vi v){
    int n = sz(c), q = sz(l); vector<int> ans(n,0);
    if(*max_element(all(l))==0 and *min_element(all(r))==n-1){
		mxsuf[q+1]=-LINF; mnsuf[q+1]=LINF; pref[0]=0;
		for(int i = 0; i < q; i++) pref[i+1]=pref[i]+v[i];
		for(int i = q; i >= 0; i--) mxsuf[i]=max(mxsuf[i+1],pref[i]);
		for(int i = q; i >= 0; i--) mnsuf[i]=min(mnsuf[i+1],pref[i]);
		for(int i = 0; i < n; i++){
			int k = 0;
			for(int j = 0; j < q; j++){
				ans[i]+=v[j];
				if(ans[i]<=0) ans[i]=0,k=-(j+1);
				if(ans[i]>=c[i]) ans[i]=c[i],k=(j+1);
			}
			ans[i] = 0;
			if(mxsuf[0]-mnsuf[0] < c[i]){
				ans[i]+=pref[q]; continue;
			}
			int L = 0, R = q;
			while(L<R){
				int mid = (L+R+1)/2;
				if(mxsuf[mid]-mnsuf[mid] >= c[i]) L=mid;
				else R=mid-1;
			}
			L++;
			if(v[L-1]>0) ans[i]=c[i];
			ans[i]+=pref[q]-pref[L];
		}
	}
	else{
		for(int i = 0; i < q; i++){
			for(int j = l[i]; j <= r[i]; j++){
				ans[j]+=v[i]; ans[j]=min(ans[j],c[j]);
				ans[j]=max(ans[j],0);
			}
		}
	}
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

candies.cpp: In function 'vi distribute_candies(vi, vi, vi, vi)':
candies.cpp:23:8: warning: variable 'k' set but not used [-Wunused-but-set-variable]
   23 |    int k = 0;
      |        ^

• Subtask 1: 3 / 3
• Subtask 2: 8 / 8
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33