oj.uz

Submission #255079

# Submission time Handle Problem Language Result Execution time Memory
255079 2020-07-31T08:00:51 Z Goolakh Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 118 ms 15608 KB 
#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math") 
 
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair
 
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
 
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=2e5+10, maxm=1e3+10, lg=21, mod=1e9+7, inf=1e18;

ll n,b[maxn],lm[maxn],rm[maxn],ans[maxn];
pll a[maxn];

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	cin>>n;
	for(int i=1;i<=n+1;i++) cin>>a[i].F, a[i].S=i;
	for(int i=1;i<=n;i++) cin>>b[i];
	sort(a+1,a+n+1+1), sort(b+1,b+n+1);
	for(int i=1;i<=n;i++) lm[i]=max(lm[i-1],a[i].F-b[i]);
	for(int i=n+1;i>1;i--) rm[i]=max(rm[i+1],a[i].F-b[i-1]);
	for(int i=1;i<=n+1;i++) ans[a[i].S]=max(lm[i-1],rm[i+1]);
	for(int i=1;i<=n+1;i++) cout<<ans[i]<<' ';
	
	return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 548 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 114 ms 14580 KB Output is correct
34 Correct 111 ms 15096 KB Output is correct
35 Correct 117 ms 14712 KB Output is correct
36 Correct 108 ms 15096 KB Output is correct
37 Correct 110 ms 15608 KB Output is correct
38 Correct 112 ms 15352 KB Output is correct
39 Correct 107 ms 14456 KB Output is correct
40 Correct 114 ms 14556 KB Output is correct
41 Correct 109 ms 14456 KB Output is correct
42 Correct 109 ms 14456 KB Output is correct
43 Correct 106 ms 14356 KB Output is correct
44 Correct 104 ms 13944 KB Output is correct
45 Correct 110 ms 13944 KB Output is correct
46 Correct 108 ms 13816 KB Output is correct
47 Correct 104 ms 14200 KB Output is correct
48 Correct 105 ms 14200 KB Output is correct
49 Correct 113 ms 14852 KB Output is correct
50 Correct 111 ms 14840 KB Output is correct
51 Correct 114 ms 14840 KB Output is correct
52 Correct 118 ms 14840 KB Output is correct
53 Correct 116 ms 15032 KB Output is correct