oj.uz

Submission #826547

# Submission time Handle Problem Language Result Execution time Memory
826547 2023-08-15T16:42:35 Z NhanBeoo Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

#define int ll
#define MAX LLONG_MAX
#define st first
#define nd second
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;

const int N = 2e5 + 5;
ii a[N];
int b[N], thang[N], cheo[N], ans[N];

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int n; cin >> n;
	for(int i=1; i<=n+1; i++){
		cin >> a[i].st;
		a[i].nd = i;
	}
	for(int i=1; i<=n; i++) cin >> b[i];
	sort(a+1, a+n+2);
	sort(b+1, b+n+1);
	for(int i=2; i<=n+1; i++) thang[i] = max(thang[i-2], max(a[i-1].st - b[i-1], (ll)0));
	for(int i=n; i>=1; i--) cheo[i] = max(cheo[i+2], max(a[i+1].st - b[i], (ll)0));
	ans[a[1].nd] = cheo[1];
	ans[a[n+1].nd] = thang[n+1];
	for(int i=2; i<=n; i++) ans[a[i].nd] = max(thang[i], cheo[i]);
	for(int i=1; i<=n+1; i++) cout << ans[i] << ' ';
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 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 340 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 340 KB Output isn't correct
2 Halted 0 ms 0 KB -