oj.uz

Submission #203514

# Submission time Handle Problem Language Result Execution time Memory
203514 2020-02-21T05:33:07 Z arman_ferdous Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 145 ms 7164 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5+100;

int n;
struct data{
	int x, idx;
}a[N];
int b[N];

int pre[N], suf[N], ans[N];

int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n + 1; i++) {
		scanf("%d", &a[i].x);
		a[i].idx = i;
	} for(int i = 1; i <= n; i++) scanf("%d", &b[i]);
	sort(a + 1, a + n + 2, [&](data a, data b) {
		return a.x < b.x;
	});
	sort(b + 1, b + n + 1);

	for(int i = 1; i <= n; i++) 
		pre[i] = max(a[i].x - b[i], 0);
	for(int i = n; i > 0; i--)
		suf[i] = max(a[i + 1].x - b[i], 0);
	for(int i = 2; i <= n; i++) pre[i] = max(pre[i], pre[i - 1]);
	for(int i = n - 1; i > 0; i--) suf[i] = max(suf[i], suf[i + 1]);

	for(int i = 1; i <= n + 1; i++) {
		ans[a[i].idx] = max(pre[i - 1], suf[i]);
	} for(int i = 1; i <= n + 1; i++)
		printf("%d ", ans[i]);
	return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
ho_t1.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i].x);
   ~~~~~^~~~~~~~~~~~~~~
ho_t1.cpp:19:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  } for(int i = 1; i <= n; i++) 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 248 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 380 KB Output is correct
9 Correct 5 ms 380 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 248 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 380 KB Output is correct
9 Correct 5 ms 380 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 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 6 ms 376 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 6 ms 376 KB Output is correct
30 Correct 6 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 248 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 380 KB Output is correct
9 Correct 5 ms 380 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 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 6 ms 376 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 6 ms 376 KB Output is correct
30 Correct 6 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 131 ms 6368 KB Output is correct
34 Correct 138 ms 6648 KB Output is correct
35 Correct 129 ms 6392 KB Output is correct
36 Correct 145 ms 6784 KB Output is correct
37 Correct 141 ms 7164 KB Output is correct
38 Correct 136 ms 6904 KB Output is correct
39 Correct 132 ms 6008 KB Output is correct
40 Correct 140 ms 6132 KB Output is correct
41 Correct 133 ms 6136 KB Output is correct
42 Correct 138 ms 6008 KB Output is correct
43 Correct 138 ms 6140 KB Output is correct
44 Correct 132 ms 5752 KB Output is correct
45 Correct 132 ms 5752 KB Output is correct
46 Correct 128 ms 5752 KB Output is correct
47 Correct 103 ms 5624 KB Output is correct
48 Correct 117 ms 5624 KB Output is correct
49 Correct 135 ms 6264 KB Output is correct
50 Correct 136 ms 6264 KB Output is correct
51 Correct 134 ms 6136 KB Output is correct
52 Correct 141 ms 6136 KB Output is correct
53 Correct 135 ms 6136 KB Output is correct