oj.uz

Submission #532140

# Submission time Handle Problem Language Result Execution time Memory
532140 2022-03-02T07:26:23 Z alanl Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 97 ms 11672 KB 
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define rep(X, a,b) for(int X=a;X<b;++X)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) (int)(a).size()
#define NL "\n"
using namespace std;
typedef pair<long long,long long> pll;
typedef pair<int,int> pii;
typedef long long ll;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << "," << p.second << ')'; }
template<typename A> ostream& operator<<(ostream &os, const vector<A> &p){
	for(const auto &a:p)
		os << a << " ";
	os << "\n";
	return os;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll n;
	cin>>n;
	vector<pll> a(n+1);
	vector<ll> b(n);
	rep(i,0,n+1){
		cin>>a[i].F;
		a[i].S=i;
	}
	rep(i,0,n) cin>>b[i];
	sort(ALL(a));
	sort(ALL(b));
	vector<ll> inc(n+1, 0);
	vector<ll> up(n+1);
	inc[n-1]=max(a[n].F-b[n-1],0ll);
	up[0]=max(a[0].F-b[0], 0ll);
	for(int i=n-2;i>=0;--i)
		inc[i]=max(inc[i+1], a[i+1].F-b[i]);
	for(int i=1;i<n;++i)
		up[i]=max(up[i-1], a[i].F-b[i]);
	vector<ll> ans(n+1);
	ans[a[0].S]=inc[0];
	for(int i=1;i<n+1;++i){
		ans[a[i].S]=max(up[i-1],inc[i]);
	}
	rep(i,0,n+1) cout<<ans[i]<<" ";
	cout<<NL;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 232 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 85 ms 10664 KB Output is correct
34 Correct 87 ms 11112 KB Output is correct
35 Correct 86 ms 10860 KB Output is correct
36 Correct 93 ms 11244 KB Output is correct
37 Correct 86 ms 11672 KB Output is correct
38 Correct 97 ms 11600 KB Output is correct
39 Correct 93 ms 10672 KB Output is correct
40 Correct 81 ms 10488 KB Output is correct
41 Correct 92 ms 10668 KB Output is correct
42 Correct 85 ms 10788 KB Output is correct
43 Correct 89 ms 10684 KB Output is correct
44 Correct 82 ms 10296 KB Output is correct
45 Correct 86 ms 10436 KB Output is correct
46 Correct 85 ms 10300 KB Output is correct
47 Correct 89 ms 10380 KB Output is correct
48 Correct 88 ms 10540 KB Output is correct
49 Correct 95 ms 11048 KB Output is correct
50 Correct 88 ms 11124 KB Output is correct
51 Correct 88 ms 11032 KB Output is correct
52 Correct 89 ms 10924 KB Output is correct
53 Correct 92 ms 11076 KB Output is correct