oj.uz

답안 #856855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856855 2023-10-04T17:42:28 Z StefanSebez Snowball (JOI21_ho_t2) C++14
0 / 100
 2 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
const int inf=1e18;
signed main()
{
    int n,q;cin>>n>>q;
    int a[n+1];for(int i=1;i<=n;i++)cin>>a[i];
    int w[q+1],pref[q+1]={0},mn[q+1],maks[q+1];
    mn[0]=inf;
    maks[0]=-inf;
    /*map<int,int>mapa;
    set<int>st;*/
    for(int i=1;i<=q;i++)
	{
		cin>>w[i];
		pref[i]=pref[i-1]+w[i];
		mn[i]=min(mn[i-1],pref[i]);
		maks[i]=max(maks[i-1],pref[i]);
		//if(pref[i]>=0) st.insert(pref[i]);
	}
	/*for(int i=q;i>=1;i--) mapa[pref[i]]=i;
	vector<int>b;
	while(!st.empty())
	{
		int x=*st.begin();
		b.pb(x);
		st.erase(x);
	}
	for(auto i:b) printf("%i ",i);
	printf("\n");
	for(int i=1;i<=q;i++) printf("%i: %i %i\n",i,mn[i],maks[i]);*/
	int L[n+1]={0},R[n+1]={0};
    for(int i=1;i<n;i++)
	{
		int l=1,r=q,mid=(l+r)/2,ind=0;
		while(l<=r)
		{
			int x=maks[mid],y=-mn[mid];
			if(a[i+1]-a[i]>=x+y)
			{
				R[i]=x;
				L[i+1]=y;
				l=mid+1;
			}
			else
			{
				r=mid-1;
				ind=mid;
			}
			mid=(l+r)/2;
		}
		if(ind==0) continue;
		if(pref[ind]>=0) R[i]=a[i+1]-a[i]-L[i+1];
		else L[i+1]=a[i+1]-a[i]-R[i];
		/*int l=0,r=lower_bound(b.begin(),b.end(),a[i+1]-a[i]+1)-b.begin()-1,mid=(l+r)/2;
		while(l<=r)
		{
			int j=mapa[b[mid]];
			printf("%i %i %i %i: %i %i\n",i,l,mid,r,b[mid],j);
			if(a[i]+b[mid]<=a[i+1]+mn[j])
			{
				R[i]=b[mid];
				l=mid+1;
			}
			else r=mid-1;
			mid=(l+r)/2;
		}*/
	}
	R[n]=maks[q];if(R[n]<0) R[n]=0;
	L[1]=-mn[q];if(L[1]<0) L[1]=0;
	/*for(int i=2;i<=n;i++)
	{
		if(mn[q]>=0) {L[i]=0;continue;}
		L[i]=min(-mn[q],a[i]-a[i-1]-R[i-1]);
	}
	for(int i=1;i<=n;i++) printf("%i ",L[i]);
	printf("\n");
	for(int i=1;i<=n;i++) printf("%i ",R[i]);
	printf("\n");*/
	int res[n+1]={0};
	for(int i=1;i<=n;i++)
	{
		res[i]=R[i]+L[i];
		cout<<res[i]<<" ";
	}
	printf("\n");
    return 0;
}

Subtask #1
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Incorrect 2 ms 604 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Incorrect 2 ms 604 KB Output isn't correct
8 Halted 0 ms 0 KB -