oj.uz

Submission #955171

# Submission time Handle Problem Language Result Execution time Memory
955171 2024-03-29T14:45:05 Z jcelin Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 73 ms 17232 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef vector<pll> vpll;

#define PB push_back
#define PF push_front<<
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define all(x) (x).begin(), (x).end()

const int mod = 1e9 + 7; //998244353;
const int inf = 1e9 + 7;
const ll INF = 1e18 + 7;
const int logo = 20;
const int MAXN = 1e6 + 7;
const int off = 1 << logo;
const int trsz = off << 1;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};

vii arr;
vi b;

int pf[MAXN], sf[MAXN], ans[MAXN];

void solve(){
	int n;
	cin >> n;
	arr.resize(n + 1);
	for(int i=0; i<n+1; i++){
		cin >> arr[i].X;
		arr[i].Y = i;
	}
	sort(all(arr));
	b.resize(n);
	for(auto &x : b) cin >> x;
	sort(all(b));
	
	for(int i=0; i<n; i++){
		pf[i] = arr[i].X - b[i];
		if(i) pf[i] = max(pf[i], pf[i - 1]);
	}
	
	for(int i=n-1; i>=0; i--){
		sf[i] = arr[i + 1].X - b[i];
		sf[i] = max(sf[i], sf[i + 1]);
	}
	
	for(int i=0; i<n+1; i++){
		int vl = sf[i];
		if(i) vl = max(vl, pf[i - 1]);
		ans[arr[i].Y] = vl;
	}
	for(int i=0; i<n+1; i++) cout << ans[i] << ' ';
	cout << "\n";
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2512 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2508 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2512 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2508 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2572 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2512 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2508 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2572 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct
33 Correct 67 ms 16468 KB Output is correct
34 Correct 70 ms 16972 KB Output is correct
35 Correct 71 ms 16532 KB Output is correct
36 Correct 69 ms 16976 KB Output is correct
37 Correct 71 ms 17232 KB Output is correct
38 Correct 70 ms 17232 KB Output is correct
39 Correct 69 ms 16220 KB Output is correct
40 Correct 68 ms 16284 KB Output is correct
41 Correct 72 ms 16464 KB Output is correct
42 Correct 68 ms 16248 KB Output is correct
43 Correct 68 ms 16208 KB Output is correct
44 Correct 66 ms 16024 KB Output is correct
45 Correct 68 ms 15952 KB Output is correct
46 Correct 67 ms 15952 KB Output is correct
47 Correct 64 ms 15972 KB Output is correct
48 Correct 64 ms 15828 KB Output is correct
49 Correct 73 ms 16976 KB Output is correct
50 Correct 70 ms 16468 KB Output is correct
51 Correct 70 ms 16464 KB Output is correct
52 Correct 69 ms 16616 KB Output is correct
53 Correct 72 ms 16468 KB Output is correct