oj.uz

Submission #826551

# Submission time Handle Problem Language Result Execution time Memory
826551 2023-08-15T16:46:56 Z NhanBeoo Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 81 ms 11680 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=1; i<=n+1; i++) thang[i] = max(thang[i-1], a[i].st - b[i]);
	for(int i=n; i>=1; i--) cheo[i] = max(cheo[i+1], a[i+1].st - b[i]);
	for(int i=1; i<=n+1; i++) ans[a[i].nd] = max(thang[i-1], cheo[i]);
	for(int i=1; i<=n+1; i++) cout << ans[i] << ' ';
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 71 ms 10744 KB Output is correct
34 Correct 72 ms 11228 KB Output is correct
35 Correct 72 ms 10828 KB Output is correct
36 Correct 73 ms 11240 KB Output is correct
37 Correct 75 ms 11680 KB Output is correct
38 Correct 74 ms 11436 KB Output is correct
39 Correct 71 ms 10604 KB Output is correct
40 Correct 74 ms 10492 KB Output is correct
41 Correct 81 ms 10680 KB Output is correct
42 Correct 71 ms 10632 KB Output is correct
43 Correct 70 ms 10500 KB Output is correct
44 Correct 75 ms 10048 KB Output is correct
45 Correct 76 ms 10184 KB Output is correct
46 Correct 69 ms 10168 KB Output is correct
47 Correct 66 ms 10128 KB Output is correct
48 Correct 67 ms 10256 KB Output is correct
49 Correct 75 ms 10764 KB Output is correct
50 Correct 73 ms 10824 KB Output is correct
51 Correct 73 ms 10828 KB Output is correct
52 Correct 71 ms 10848 KB Output is correct
53 Correct 75 ms 10796 KB Output is correct