oj.uz

답안 #922819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922819 2024-02-06T07:09:36 Z penguin133 Snowball (JOI21_ho_t2) C++17
0 / 100
 5 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

vector <int> pos, neg;
int n, q, X[200005];

void solve(){
	cin >> n >> q;
	for(int i = 1; i <= n; i++)cin >> X[i];
	X[n + 1] = 1e18;
	int cur = 0, mx = 0, mn = 0;
	for(int i = 1; i <= q; i++){
		int x; cin >> x;
		cur += x;
		mx = max(mx, cur);
		mn = min(mn, cur);
		pos.push_back(mx); neg.push_back(-mn);
	}
	int prv = X[1] + mn;
	for(int i = 1; i <= n; i++){
		int lp = prv;
		int lo = X[i], hi = X[i + 1], ans = lo;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			int tmp = lower_bound(pos.begin(), pos.end(), mid - X[i]) - pos.begin();
			int tmp2 = lower_bound(neg.begin(), neg.end(), X[i + 1] - mid + 1) - neg.begin();
			if(tmp < tmp2)ans = mid, lo = mid + 1;
			else hi = mid - 1;
		}
		//cout << ans << ' ' << lp << ' ';
		cout << ans - lp << '\n';
		prv = ans;
	}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

Main.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main(){
      | ^~~~

Subtask #1
0 / 33.0

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

Subtask #2
0 / 67.0

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