oj.uz

Submission #762962

# Submission time Handle Problem Language Result Execution time Memory
762962 2023-06-22T01:53:38 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 92 ms 6156 KB 
#include <bits/stdc++.h>
using namespace std;

// Write down the limits of the problem here

int main() {
	// Try to avoid cin, cout :)

	int tc = 1; // scanf("%d", &tc);
	while(tc--) {
		/// Your solution here
		int n;
		scanf("%d", &n);
		vector<pair<int, int>> a(n + 1);
		vector<int> b(n);
		for (int i = 0; i < n + 1; i ++){
			scanf("%d", &a[i].first);
			a[i].second = i;
		}
		for (int i = 0; i < n ; i++){
			scanf("%d", &b[i]);
		}
		sort(a.begin(), a.end());
		sort(b.begin(), b.end());
		vector<int> res(n + 1);
		vector<int> max_diff_cross(n + 1);
		for (int i = n; i >= 1; i--){
			max_diff_cross[i] = max(a[i].first - b[i - 1], 0);
			if (i != n) max_diff_cross[i] = max(max_diff_cross[i], max_diff_cross[i + 1]);
		}
		int max_diff_straight = 0;
		for (int i = 0; i <= n; i++){
			res[a[i].second] = max(i != n ? max_diff_cross[i + 1] : 0, max_diff_straight);
			max_diff_straight = max(max_diff_straight, max(a[i].first - b[i], 0));
		}
		for (int i = 0; i <= n; i++){
			printf("%d ", res[i]);
		}
	}
	return 0;
}

/*
 * Ermm don't underestimate Div2A, pls...
 * 
 * If there isn't a clear-cut approach for your program, DO NOT CODE YET!
 *
 * Write down some notes for more complicated problems
 * 
 * Also, please, CP isn't supposed to be complicated
 * 
**/

Compilation message

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

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 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 2 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 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 212 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 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 2 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 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 212 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 71 ms 5472 KB Output is correct
34 Correct 75 ms 5688 KB Output is correct
35 Correct 71 ms 5488 KB Output is correct
36 Correct 77 ms 5908 KB Output is correct
37 Correct 75 ms 6156 KB Output is correct
38 Correct 92 ms 6072 KB Output is correct
39 Correct 71 ms 5132 KB Output is correct
40 Correct 90 ms 5128 KB Output is correct
41 Correct 81 ms 5200 KB Output is correct
42 Correct 73 ms 5140 KB Output is correct
43 Correct 71 ms 5132 KB Output is correct
44 Correct 72 ms 4836 KB Output is correct
45 Correct 83 ms 4864 KB Output is correct
46 Correct 86 ms 4940 KB Output is correct
47 Correct 68 ms 4688 KB Output is correct
48 Correct 68 ms 4668 KB Output is correct
49 Correct 73 ms 5324 KB Output is correct
50 Correct 83 ms 5328 KB Output is correct
51 Correct 75 ms 5376 KB Output is correct
52 Correct 74 ms 5364 KB Output is correct
53 Correct 89 ms 5340 KB Output is correct