oj.uz

Submission #201718

# Submission time Handle Problem Language Result Execution time Memory
201718 2020-02-11T20:15:09 Z eggag32 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 121 ms 7032 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n;
	cin >> n;
	vector<pi> a(n + 1);
	vi b(n);
	rep(i, n + 1) cin >> a[i].fi, a[i].se = i;
	rep(i, n) cin >> b[i];
	sort(all(b));
	sort(all(a));
	vi l(n + 1, 0);
	rep(i, n){
		if(!i) l[i] = max(0, a[i].fi - b[i]);
		else l[i] = max(l[i - 1], max(0, a[i].fi - b[i]));
	}
	vi r(n + 1, 0);
	for(int i = n - 1; i >= 0; i--){
		if(i == (n - 1)) r[i] = max(0, a[i + 1].fi - b[i]);
		else r[i] = max(r[i + 1], max(0, a[i + 1].fi - b[i]));
	}
	vi ans(n + 1);
	rep(i, n + 1){
		int j = a[i].se;
		if(i == n) ans[j] = l[n - 1];
		else ans[j] = max((!i ? 0 : l[i - 1]), r[i]);
	}
	rep(i, n + 1) cout << ans[i] << " ";
	cout << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 380 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 6 ms 380 KB Output is correct
33 Correct 108 ms 6396 KB Output is correct
34 Correct 118 ms 6648 KB Output is correct
35 Correct 112 ms 6392 KB Output is correct
36 Correct 115 ms 6776 KB Output is correct
37 Correct 116 ms 7032 KB Output is correct
38 Correct 114 ms 6904 KB Output is correct
39 Correct 115 ms 6008 KB Output is correct
40 Correct 114 ms 6136 KB Output is correct
41 Correct 112 ms 6136 KB Output is correct
42 Correct 112 ms 6136 KB Output is correct
43 Correct 115 ms 6008 KB Output is correct
44 Correct 114 ms 5752 KB Output is correct
45 Correct 111 ms 5752 KB Output is correct
46 Correct 111 ms 5752 KB Output is correct
47 Correct 114 ms 5628 KB Output is correct
48 Correct 108 ms 5624 KB Output is correct
49 Correct 121 ms 6264 KB Output is correct
50 Correct 121 ms 6264 KB Output is correct
51 Correct 113 ms 6264 KB Output is correct
52 Correct 117 ms 6264 KB Output is correct
53 Correct 118 ms 6264 KB Output is correct