oj.uz

답안 #416175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
416175 2021-06-02T06:37:54 Z alishahali1382 Snowball (JOI21_ho_t2) C++14
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

ll n, m, k, u, v, x, y, t, a, b, sum;
ll A[MAXN], ans[MAXN];
vector<pll> X, Y;

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<=n; i++) cin>>A[i];
	X.pb({0, 0});
	Y.pb({0, 0});
	for (int i=1; i<=m; i++){
		cin>>x;
		sum+=x;
		if (sum>X.back().first) X.pb({sum, i});
		if (sum<Y.back().first) Y.pb({sum, i});
	}
	for (auto &p:Y) p.first*=-1;
	sum=X.back().first+Y.back().first;
	if (n==1) kill(sum)
	ans[1]=Y.back().first;
	ans[n]=X.back().first;
	for (int i=1; i<n; i++){
		ll len=A[i+1]-A[i];
		if (len>=sum){
			ans[i]+=X.back().first;
			ans[i+1]+=Y.back().first;
			continue ;
		}
		ll dwn=0, up=len+1;
//		debug2(dwn, up)
		while (up-dwn>1){
			ll mid=(dwn+up)>>1;
			int x=lower_bound(all(X), pll(mid, 0))->second;
			int y=lower_bound(all(Y), pll(len-mid+1, 0))->second;
			assert(x!=y);/*
			if (i==2){
				debug(mid)
				debug2(x, y)
			}*/
			if (x<y) dwn=mid;
			else up=mid;
		}
//		debug2(len, dwn)
//		cerr<<"\n";
//		return 0;
		ans[i]+=dwn;
		ans[i+1]+=len-dwn;
	}
	for (int i=1; i<=n; i++) cout<<ans[i]<<"\n";
	
	return 0;
}

Subtask #1
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -