oj.uz

답안 #545877

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545877 2022-04-05T15:44:41 Z tmn2005 Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 340 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], c[N], d[N];

void solve(){
	cin>>n;
	for(int i=0; i<=n; i++){
		cin>>a[i];
	}sort(a, a+1+n);
	for(int i=1; i<=n; i++){
		cin>>b[i];
	}sort(b+1, b+1+n);
	
	for(int i=1; i<=n; i++){
		c[i] = max(c[i-1], a[i-1] - b[i]);
	}
	for(int i=n; i>=1; i--){
		d[i] = max(d[i+1], a[i] - b[i]);
	}
	cout<<d[1]<<" ";
	for(int i=1; i<=n; i++){
		cout<<max(c[i], d[i+1])<<" ";
	}
}
main(){
	NeedForSpeed;
	int T = 1;
//	cin >> T;
	while(T--){
		solve();
	}
	return 0;
}

Compilation message

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

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -