oj.uz

Submission #1114683

# Submission time Handle Problem Language Result Execution time Memory
1114683 2024-11-19T11:17:32 Z AdamGS Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 2384 KB 
#include <iostream>
#include <algorithm>

using namespace std;

const int MAXN = 200003;

int n;

int val1[MAXN];
int val2[MAXN];
int pref_max[MAXN];
int suf_max[MAXN];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	for (int i = 1; n + 1>= i; i++) {
		cin >> val1[i];
	}
	
	for (int i = 1; n >= i; i++) {
		cin >> val2[i];
	}
	sort(val1 + 1, val1 + n + 2);
	sort(val2 + 1, val2 + n + 1);
	
	for (int i = 1; n >= i; i++) {
		pref_max[i] = max(pref_max[i - 1], val1[i] - val2[i]);
	}
	for (int i = n; i > 0; i--) {
		suf_max[i]= max(suf_max[i + 1], val1[i + 1] - val2[i]);
	}
	for (int i = 1; n + 1 >= i; i++) {
		cout << max(pref_max[i - 1], suf_max[i]) << " ";
	}
	return 0;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2384 KB Output isn't correct
2 Halted 0 ms 0 KB -