oj.uz

답안 #416188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
416188 2021-06-02T06:55:21 Z alishahali1382 Snowball (JOI21_ho_t2) C++14
100 / 100
 1043 ms 14248 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;
	ll mxX=X.back().first, mxY=Y.back().first;
	X.pb({INF, m+1});
	Y.pb({INF, m+1});
	sum=mxX+mxY;
	if (n==1) kill(sum)
	ans[1]=mxY;
	ans[n]=mxX;
	for (int i=1; i<n; i++){
		ll len=A[i+1]-A[i];
		if (len>=sum){
			ans[i]+=mxX;
			ans[i+1]+=mxY;
			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);
//			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;
}
/*
2 8
0 13
-3
5
-6
10
-13
-1
15
0

2 6
0 13
-3
5
-6
10
-14
15


*/

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 5 ms 428 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 5 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 372 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 7 ms 460 KB Output is correct
16 Correct 6 ms 444 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct

Subtask #2
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 5 ms 428 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 5 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 372 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 7 ms 460 KB Output is correct
16 Correct 6 ms 444 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 35 ms 5644 KB Output is correct
21 Correct 34 ms 5424 KB Output is correct
22 Correct 35 ms 5380 KB Output is correct
23 Correct 42 ms 5280 KB Output is correct
24 Correct 136 ms 5700 KB Output is correct
25 Correct 1043 ms 12116 KB Output is correct
26 Correct 1008 ms 11960 KB Output is correct
27 Correct 966 ms 11344 KB Output is correct
28 Correct 929 ms 11440 KB Output is correct
29 Correct 773 ms 9488 KB Output is correct
30 Correct 266 ms 7384 KB Output is correct
31 Correct 76 ms 6944 KB Output is correct
32 Correct 64 ms 6976 KB Output is correct
33 Correct 77 ms 1524 KB Output is correct
34 Correct 602 ms 9280 KB Output is correct
35 Correct 659 ms 9196 KB Output is correct
36 Correct 1018 ms 11780 KB Output is correct
37 Correct 931 ms 10916 KB Output is correct
38 Correct 957 ms 11464 KB Output is correct
39 Correct 961 ms 11444 KB Output is correct
40 Correct 511 ms 11536 KB Output is correct
41 Correct 36 ms 6532 KB Output is correct
42 Correct 66 ms 6876 KB Output is correct
43 Correct 403 ms 13628 KB Output is correct
44 Correct 37 ms 6312 KB Output is correct
45 Correct 78 ms 11504 KB Output is correct
46 Correct 506 ms 13916 KB Output is correct
47 Correct 253 ms 11752 KB Output is correct
48 Correct 303 ms 14248 KB Output is correct