oj.uz

Submission #208980

# Submission time Handle Problem Language Result Execution time Memory
208980 2020-03-12T20:13:15 Z davitmarg Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 159 ms 6264 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 200005;

int n, b[N], sf[N], pr[N];
pair<int, int> a[N];

int main()
{
	cin >> n;
	for (int i = 1; i <= n + 1; i++)
	{
		scanf("%d", &a[i].first);
		a[i].second = i;
	}
	for (int i = 1; i <= n; i++)
		scanf("%d", b + i);
	sort(a + 1, a + 1 + n + 1);
	sort(b + 1, b + 1 + n);

	for (int i = 1; i <= n; i++)
		pr[i] = max(pr[i - 1], a[i].first - b[i]);

	for (int i = n; i >= 1; i--)
		sf[i] = max(sf[i + 1], a[i + 1].first - b[i]);

	for (int i = 0; i <= n; i++)
		b[a[i + 1].second] = max(pr[i], sf[i + 1]);
	for (int i = 1; i <= n + 1; i++)
		printf("%d ", b[i]);
	cout << endl;
	return 0;
}

/*

10
5 3 5 2 3 6 9 7 3 90 12
3 6 9 8 5 2 4 6 3 5



*/

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:36:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i].first);
   ~~~~~^~~~~~~~~~~~~~~~~~~
ho_t1.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", b + i);
   ~~~~~^~~~~~~~~~~~~

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 6 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 380 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 6 ms 504 KB Output is correct
23 Correct 7 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 6 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 380 KB Output is correct
19 Correct 5 ms 380 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 6 ms 504 KB Output is correct
23 Correct 7 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 159 ms 5796 KB Output is correct
34 Correct 138 ms 5752 KB Output is correct
35 Correct 134 ms 5624 KB Output is correct
36 Correct 146 ms 6136 KB Output is correct
37 Correct 137 ms 6264 KB Output is correct
38 Correct 137 ms 6136 KB Output is correct
39 Correct 140 ms 5472 KB Output is correct
40 Correct 137 ms 5240 KB Output is correct
41 Correct 138 ms 5368 KB Output is correct
42 Correct 133 ms 5412 KB Output is correct
43 Correct 132 ms 5240 KB Output is correct
44 Correct 130 ms 4984 KB Output is correct
45 Correct 131 ms 4984 KB Output is correct
46 Correct 129 ms 4984 KB Output is correct
47 Correct 113 ms 4728 KB Output is correct
48 Correct 112 ms 4732 KB Output is correct
49 Correct 142 ms 5496 KB Output is correct
50 Correct 140 ms 5368 KB Output is correct
51 Correct 135 ms 5368 KB Output is correct
52 Correct 138 ms 5368 KB Output is correct
53 Correct 139 ms 5496 KB Output is correct