oj.uz

답안 #202297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202297 2020-02-15T07:41:56 Z amoo_safar Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 6 ms 1912 KB 
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 2e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

ll a[N], A[N], b[N];
ll p[N], s[N];
map<ll, ll> mp;
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	ll n;
	cin >> n;
	for(int i = 0; i <= n; i++) cin >> a[i];
	for(int i = 0; i < n; i++) cin >> b[i];
	sort(a, a + n + 1);
	sort(b, b + n);
	memcpy(A, a, sizeof a);
	for(int i = 1; i <= n; i++) p[i] = max(p[i - 1], a[i - 1] - b[i - 1]);
	for(int i = n; i > 0; i--) s[i] = max(s[i + 1], a[i] - b[i - 1]);
	for(int i = 0; i <= n; i++) mp[a[i]] = max(p[i], s[i + 1]);
	for(int i = 0; i <= n; i++) cout << mp[A[i]] << ' ';
	cout << '\n';
	return 0;
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 91.0

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