oj.uz

Submission #1045471

# Submission time Handle Problem Language Result Execution time Memory
1045471 2024-08-06T02:11:05 Z Minbaev Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 123 ms 30136 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define ll long long
#define pii pair<int,int>
#define ar array
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;
 
int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}
 
int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}
 
int n,m,k;
 
void solve(){
	
	cin >> n;
	vector<int>a(n+1), b(n);
	for(auto &to:a)cin >> to;
	for(auto &to:b)cin >> to;
	
	vector<pii>v;
	for(int i = 0;i<=n;i++){
		v.pb({a[i], i});
	}
	sort(all(v));
	sort(all(a));
	sort(all(b));
	vector<int>ans(n+1);
	map<int,int>mp;
	
	for(int i = 0;i<=n;i++){
		mp[i] = v[i].s;
	}
	
	vector<int>pref(n+1),suff(n+1);
	for(int i = 0;i<n;i++){
		pref[i] = max(a[i]-b[i], 0ll);
		if(i)pref[i] = max(pref[i], pref[i-1]);
	}
	
	for(int i = n;i>0;i--){
		suff[i] = max(a[i]-b[i-1], 0ll);
		if(i < n)suff[i] = max(suff[i], suff[i+1]);
	}
	
	for(int i = 0;i<=n;i++){
		if(i && i < n)ans[mp[i]] = max(pref[i-1], suff[i+1]);
		else if(i < n)ans[mp[i]] = suff[i+1];
		else ans[mp[i]] = pref[i-1];
	}
	
	for(int i = 0;i<=n;i++){
		cout << ans[i] << " ";
	}
	
}
/*
 
*/
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 424 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 476 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 424 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 476 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 112 ms 27984 KB Output is correct
34 Correct 123 ms 29068 KB Output is correct
35 Correct 119 ms 28396 KB Output is correct
36 Correct 108 ms 29376 KB Output is correct
37 Correct 113 ms 30136 KB Output is correct
38 Correct 113 ms 30124 KB Output is correct
39 Correct 106 ms 28816 KB Output is correct
40 Correct 110 ms 27844 KB Output is correct
41 Correct 107 ms 28352 KB Output is correct
42 Correct 111 ms 28608 KB Output is correct
43 Correct 110 ms 28608 KB Output is correct
44 Correct 119 ms 27208 KB Output is correct
45 Correct 109 ms 27584 KB Output is correct
46 Correct 106 ms 27332 KB Output is correct
47 Correct 109 ms 29128 KB Output is correct
48 Correct 103 ms 28648 KB Output is correct
49 Correct 113 ms 29552 KB Output is correct
50 Correct 113 ms 28864 KB Output is correct
51 Correct 115 ms 28868 KB Output is correct
52 Correct 112 ms 29416 KB Output is correct
53 Correct 115 ms 28868 KB Output is correct