oj.uz

Submission #762967

# Submission time Handle Problem Language Result Execution time Memory
762967 2023-06-22T01:55:33 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 74 ms 11660 KB 
#include <bits/stdc++.h>
#define ii pair<int,int>
#define f first
#define s second
#define pb push_back
#define int long long
#define endl '\n'
using namespace std;
const int MAXN = 1e18;
int mod = 1e9 + 7;
pair<int,int> a[200005];
int b[200005];
int prefix[200005];
int prefix2[200005];
int ans[200005];
void AcSolution()
{
	int n;
	cin >> n;
	for(int i = 1;i <= n + 1;i++)
	{
		cin >> a[i].first;
		a[i].second = i;
	}
	for(int i = 1;i <= n;i++)
	{
		cin >> b[i];
	}
	sort(b + 1,b + n + 1);
	sort(a + 1,a + n + 2);
	for(int i = 1;i <= n;i++)
	{
		prefix[i] = max({prefix[i - 1],a[i].first - b[i],0ll});
	}
	for(int i = n + 1;i >= 2;i--)
	{
		prefix2[i] = max({prefix2[i + 1],a[i].first - b[i - 1],0ll});
	}	
	for(int i = 1;i <= n + 1;i++)
	{
		ans[a[i].second] = max(prefix[i - 1],prefix2[i + 1]);
	}
	for(int i = 1;i <= n + 1;i++)
	{
		cout << ans[i] << " ";
	}
	cout << endl;
}
signed main()
{
//	freopen("A1.inp", "r",stdin);
//    freopen("A1.out", "w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
//	cin >> t;
	while(t--)
	{
	 	AcSolution();
	}
}

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 340 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 0 ms 340 KB Output is correct
8 Correct 0 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 0 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 340 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 0 ms 340 KB Output is correct
8 Correct 0 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 0 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 400 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 340 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 0 ms 340 KB Output is correct
8 Correct 0 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 0 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 400 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 73 ms 10684 KB Output is correct
34 Correct 72 ms 11212 KB Output is correct
35 Correct 72 ms 10796 KB Output is correct
36 Correct 70 ms 11256 KB Output is correct
37 Correct 73 ms 11660 KB Output is correct
38 Correct 72 ms 11540 KB Output is correct
39 Correct 74 ms 10572 KB Output is correct
40 Correct 69 ms 10452 KB Output is correct
41 Correct 70 ms 10624 KB Output is correct
42 Correct 70 ms 10536 KB Output is correct
43 Correct 69 ms 10572 KB Output is correct
44 Correct 72 ms 10212 KB Output is correct
45 Correct 70 ms 10200 KB Output is correct
46 Correct 72 ms 10060 KB Output is correct
47 Correct 67 ms 10212 KB Output is correct
48 Correct 67 ms 10252 KB Output is correct
49 Correct 72 ms 10880 KB Output is correct
50 Correct 72 ms 10828 KB Output is correct
51 Correct 72 ms 10776 KB Output is correct
52 Correct 72 ms 10796 KB Output is correct
53 Correct 72 ms 10860 KB Output is correct