oj.uz

답안 #391485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
391485 2021-04-18T21:29:49 Z ritul_kr_singh Snowball (JOI21_ho_t2) C++17
100 / 100
 120 ms 11348 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
 
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, q; cin >> n >> q;
	int x[n]; for(int &i : x) cin >> i;
	int w[q]; for(int &i : w) cin >> i;
 
	int a[q], b[q];
	a[0] = max(w[0], 0LL);
	b[0] = min(w[0], 0LL);
 
	for(int i=1; i<q; ++i){
		w[i] += w[i-1];
		a[i] = max(a[i-1], w[i]);
		b[i] = min(b[i-1], w[i]);
	}
 
	for(int &i : b) i = -i;
 
	int l[n], r[n];
	fill(l, l+n, 0LL);
	fill(r, r+n, 0LL);
 
	for(int i=0; i+1<n; ++i){
		int mx = 0, diff = x[i+1] - x[i];
		if(a[0] + b[0] >= diff){
			r[i] = min(diff, a[0]);
			l[i+1] = min(diff, b[0]);
			continue;
		}
		for(int y=1<<18; y; y/=2)
			if(mx+y < q and a[mx+y] + b[mx+y] < diff) mx += y;
		r[i] = a[mx];
		l[i+1] = b[mx];
		++mx;
		if(mx < q){
			l[i+1] = min(diff - a[mx-1], b[mx]);
			r[i] = min(diff - b[mx-1], a[mx]);
		}
	}
	l[0] = b[q-1];
	r[n-1] = a[q-1];
	for(int i=0; i<n; ++i) cout << l[i] + r[i] nl;
}

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 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 392 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 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 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 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 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 392 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 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 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 32 ms 4976 KB Output is correct
21 Correct 35 ms 4940 KB Output is correct
22 Correct 29 ms 4900 KB Output is correct
23 Correct 26 ms 4988 KB Output is correct
24 Correct 34 ms 5528 KB Output is correct
25 Correct 119 ms 11256 KB Output is correct
26 Correct 116 ms 11236 KB Output is correct
27 Correct 115 ms 11004 KB Output is correct
28 Correct 117 ms 10956 KB Output is correct
29 Correct 113 ms 10820 KB Output is correct
30 Correct 115 ms 10684 KB Output is correct
31 Correct 87 ms 10052 KB Output is correct
32 Correct 84 ms 9984 KB Output is correct
33 Correct 11 ms 1356 KB Output is correct
34 Correct 120 ms 11292 KB Output is correct
35 Correct 116 ms 10964 KB Output is correct
36 Correct 120 ms 11204 KB Output is correct
37 Correct 117 ms 10992 KB Output is correct
38 Correct 118 ms 11156 KB Output is correct
39 Correct 112 ms 11064 KB Output is correct
40 Correct 99 ms 11064 KB Output is correct
41 Correct 33 ms 4948 KB Output is correct
42 Correct 72 ms 10004 KB Output is correct
43 Correct 85 ms 11188 KB Output is correct
44 Correct 34 ms 4872 KB Output is correct
45 Correct 80 ms 11012 KB Output is correct
46 Correct 87 ms 11344 KB Output is correct
47 Correct 88 ms 11328 KB Output is correct
48 Correct 88 ms 11348 KB Output is correct