Submission #371277

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
371277	2021-02-26T10:40:40 Z	sam571128	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	130 ms	15708 KB

ho_t1

#include <bits/stdc++.h>

#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 2e5+5;
int pref[N], suff[N];

signed main(){
	fastio
	int n;
	cin >> n;
	vector<pair<int,int>> v;
	int ans[n+1] = {};
	for(int i = 0;i < n+1;i++){
		int tmp;
		cin >> tmp;
		v.push_back({tmp,i});
	}
	sort(v.begin(),v.end());
	int arr[n];
	for(auto &x : arr) cin >> x;
	sort(arr,arr+n);
	for(int i = 0;i < n;i++){
		pref[i] = max(v[i].first-arr[i],(int)0);
		if(i!=0) pref[i] = max(pref[i],pref[i-1]);  
	}
	for(int i = n-1;~i;i--){
		suff[i] = max(v[i+1].first-arr[i],(int)0);
		if(i!=n-1) suff[i] = max(suff[i],suff[i+1]);
	}
	for(int i = 0;i <= n;i++){
		ans[v[i].second] = max((i==0 ? (int)0 : pref[i-1]),suff[i]);
	}
	for(auto x : ans) cout << x << " ";
}

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	380 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct

Subtask #2

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	380 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	2 ms	512 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	1 ms	492 KB	Output is correct
22	Correct	1 ms	492 KB	Output is correct
23	Correct	1 ms	492 KB	Output is correct
24	Correct	1 ms	492 KB	Output is correct
25	Correct	2 ms	492 KB	Output is correct
26	Correct	2 ms	492 KB	Output is correct
27	Correct	2 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	2 ms	512 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Correct	2 ms	492 KB	Output is correct
32	Correct	1 ms	492 KB	Output is correct

Subtask #3

91.0 / 91.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	380 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	1 ms	492 KB	Output is correct
19	Correct	2 ms	512 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	1 ms	492 KB	Output is correct
22	Correct	1 ms	492 KB	Output is correct
23	Correct	1 ms	492 KB	Output is correct
24	Correct	1 ms	492 KB	Output is correct
25	Correct	2 ms	492 KB	Output is correct
26	Correct	2 ms	492 KB	Output is correct
27	Correct	2 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	2 ms	512 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Correct	2 ms	492 KB	Output is correct
32	Correct	1 ms	492 KB	Output is correct
33	Correct	103 ms	14756 KB	Output is correct
34	Correct	114 ms	15196 KB	Output is correct
35	Correct	108 ms	14812 KB	Output is correct
36	Correct	130 ms	15196 KB	Output is correct
37	Correct	114 ms	15708 KB	Output is correct
38	Correct	107 ms	15580 KB	Output is correct
39	Correct	106 ms	14572 KB	Output is correct
40	Correct	107 ms	14428 KB	Output is correct
41	Correct	107 ms	14684 KB	Output is correct
42	Correct	111 ms	14556 KB	Output is correct
43	Correct	104 ms	14428 KB	Output is correct
44	Correct	101 ms	14044 KB	Output is correct
45	Correct	105 ms	14172 KB	Output is correct
46	Correct	107 ms	14044 KB	Output is correct
47	Correct	102 ms	14300 KB	Output is correct
48	Correct	101 ms	14428 KB	Output is correct
49	Correct	111 ms	14940 KB	Output is correct
50	Correct	108 ms	14940 KB	Output is correct
51	Correct	108 ms	15096 KB	Output is correct
52	Correct	120 ms	14940 KB	Output is correct
53	Correct	107 ms	14940 KB	Output is correct