oj.uz

답안 #936622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936622 2024-03-02T12:05:05 Z koukirocks Snowball (JOI21_ho_t2) C++17
0 / 100
 1 ms 2392 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
 
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=1e5+10,P=998244353;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;

ll n,q;
ll pos[MAX];
pll dis[MAX];
pll rg[MAX];

int main() {
	speed;
	cin>>n>>q;
	for (int i=0;i<n;i++) {
		cin>>pos[i];
		rg[i]={-1,-1};
		if (i) dis[i-1]={pos[i]-pos[i-1],i-1};
	}
	sort(dis,dis+n);
	ll L=0,R=0;
	ll now=0;
	ll id=0;
	while (q--) {
		ll k;
		cin>>k;
		now+=k;
		if (now>R) {
			R=now;
			while (id<n-1 and dis[id].first<R-L) {
//				cout<<dis[id].second<<" id\n";
				rg[dis[id].second].second=pos[dis[id].second+1]+L;
				rg[dis[id].second+1].first=pos[dis[id].second+1]+L;
				id++;
			}
		} else if (now<L) {
			L=now;
			while (id<n-1 and dis[id].first<R-L) {
				rg[dis[id].second+1].first=pos[dis[id].second]+R;
				rg[dis[id].second].second=pos[dis[id].second]+R;
				id++;
			}
		}
//		cout<<L<<" "<<R<<"\n";
	}
	for (int i=0;i<n;i++) {
//		cout<<rg[i].first<<" "<<rg[i].second<<"\n";
		if (rg[i].first==-1) rg[i].first=pos[i]+L;
		if (rg[i].second==-1) rg[i].second=pos[i]+R;
		cout<<rg[i].second-rg[i].first<<"\n";
	}
	return 0;
}

Subtask #1
0 / 33.0

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

Subtask #2
0 / 67.0

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