oj.uz

Submission #201584

# Submission time Handle Problem Language Result Execution time Memory
201584 2020-02-11T08:50:46 Z MvC Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 127 ms 6264 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,b[nmax],mx,sf[nmax],rs[nmax];
pair<int,int>a[nmax];
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n+1;i++)cin>>a[i].fr,a[i].sc=i;
	for(i=1;i<=n;i++)cin>>b[i];
	sort(a+1,a+n+2);
	sort(b+1,b+n+1);
	for(i=n+1;i>=1;i--)sf[i]=max(sf[i+1],max(a[i].fr-b[i-1],0));
	for(i=1;i<=n+1;i++)
	{
		rs[a[i].sc]=max(mx,sf[i+1]);
		mx=max(mx,max(a[i].fr-b[i],0));
	}
	for(i=1;i<=n+1;i++)cout<<rs[i]<<" ";
	cout<<endl;
	return 0;
}

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 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 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 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 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 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 336 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 5 ms 380 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 6 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 6 ms 376 KB Output is correct
32 Correct 6 ms 376 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 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 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 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 336 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 5 ms 380 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 6 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 6 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 116 ms 5736 KB Output is correct
34 Correct 118 ms 5880 KB Output is correct
35 Correct 117 ms 5752 KB Output is correct
36 Correct 113 ms 6136 KB Output is correct
37 Correct 118 ms 6264 KB Output is correct
38 Correct 118 ms 6264 KB Output is correct
39 Correct 112 ms 5368 KB Output is correct
40 Correct 127 ms 5240 KB Output is correct
41 Correct 113 ms 5368 KB Output is correct
42 Correct 111 ms 5368 KB Output is correct
43 Correct 113 ms 5240 KB Output is correct
44 Correct 111 ms 5028 KB Output is correct
45 Correct 116 ms 5368 KB Output is correct
46 Correct 112 ms 4984 KB Output is correct
47 Correct 110 ms 4856 KB Output is correct
48 Correct 107 ms 4856 KB Output is correct
49 Correct 117 ms 5496 KB Output is correct
50 Correct 117 ms 5368 KB Output is correct
51 Correct 116 ms 5496 KB Output is correct
52 Correct 115 ms 5496 KB Output is correct
53 Correct 119 ms 5512 KB Output is correct