oj.uz

답안 #545954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545954 2022-04-05T17:16:21 Z tmn2005 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 137 ms 15576 KB 
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>

using namespace __gnu_pbds;
using namespace std;
typedef long long ll;

#define fr first
#define sc second

#define mk make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front

#define int long long
#define pii pair<int,int>
#define piii pair<int,pii>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0), cin.tie(0)
#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
const int N = 2e5 + 12;
int n, m, k, a[N], b[N], pref[N], suff[N], ans[N];
vector<int>p;

bool cmp(int i, int j){
	return a[i] < a[j];
}
void solve(){
	cin>>n;
	for(int i=0; i<=n; i++){
		cin>>a[i];
		p.pb(i);
 	}sort(all(p), cmp);
	
	for(int i=0; i<n; i++){
		cin>>b[i];
	}sort(b, b+n);
	
	pref[0] = max(0ll, a[p[0]] - b[0]);
	for(int i=1; i<n; i++){
		pref[i] = max(pref[i-1], a[p[i]] - b[i]);
	}
	for(int i=n; i>=1; i--){
		suff[i] = max(suff[i+1], a[p[i]] - b[i-1]);
	}
		
	ans[p[0]] = suff[1];
	ans[p[n]] = pref[n-1];
	for(int i=1; i<n; i++){
		ans[p[i]] = max(pref[i-1], suff[i+1]);
	}
	for(int i=0; i<=n; i++)cout<<ans[i]<<" ";
}
main(){
	NeedForSpeed;
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

Compilation message

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

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 2 ms 400 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 2 ms 400 KB Output is correct
33 Correct 100 ms 14556 KB Output is correct
34 Correct 100 ms 15100 KB Output is correct
35 Correct 102 ms 14720 KB Output is correct
36 Correct 102 ms 15188 KB Output is correct
37 Correct 116 ms 15576 KB Output is correct
38 Correct 137 ms 15424 KB Output is correct
39 Correct 98 ms 14500 KB Output is correct
40 Correct 97 ms 14364 KB Output is correct
41 Correct 103 ms 14528 KB Output is correct
42 Correct 122 ms 14524 KB Output is correct
43 Correct 101 ms 14360 KB Output is correct
44 Correct 91 ms 13948 KB Output is correct
45 Correct 97 ms 14072 KB Output is correct
46 Correct 97 ms 13896 KB Output is correct
47 Correct 80 ms 14272 KB Output is correct
48 Correct 75 ms 14264 KB Output is correct
49 Correct 102 ms 14788 KB Output is correct
50 Correct 99 ms 14904 KB Output is correct
51 Correct 104 ms 14836 KB Output is correct
52 Correct 96 ms 14784 KB Output is correct
53 Correct 99 ms 14792 KB Output is correct