oj.uz

Submission #201300

# Submission time Handle Problem Language Result Execution time Memory
201300 2020-02-10T06:40:43 Z Atalasion Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 125 ms 11768 KB 
//khodaya khodet komak kon
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimise ("ofast")
#pragma GCC optimise("unroll-loops")
#define int long long

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int N = 200000 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000000000000000;
const ll LOG = 25;

int n, b[N], pre[N], suf[N], ans[N];
pii a[N];

int32_t main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n + 1; i ++) {cin >> a[i].F; a[i].S = i;}
	for (int i = 1; i <= n; i++) cin >> b[i];
	sort(a + 1, a + n + 2);
	sort(b + 1, b + n + 1);
	//cout << b[1] << ' ' << a[1].F << '\n';
	for (int i = 1; i <= n; i++) pre[i] = max(pre[i - 1], max(0ll, a[i].F - b[i]));
	for (int i = n + 1; i > 1; i--) suf[i] = max(suf[i + 1], max(0ll, a[i].F - b[i - 1]));
	for (int i = 1; i <= n + 1; i++){
		ans[a[i].S] = max(pre[i - 1], suf[i + 1]);
	}
	for (int i = 1; i <= n + 1; i++) cout << ans[i] << ' ';








	return 0;
}

Compilation message

ho_t1.cpp:8:0: warning: ignoring #pragma GCC optimise [-Wunknown-pragmas]
 #pragma GCC optimise ("ofast")
 
ho_t1.cpp:9:0: warning: ignoring #pragma GCC optimise [-Wunknown-pragmas]
 #pragma GCC optimise("unroll-loops")

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 6 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 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 6 ms 632 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 448 KB Output is correct
25 Correct 6 ms 504 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 6 ms 504 KB Output is correct
28 Correct 0 ms 504 KB Output is correct
29 Correct 6 ms 504 KB Output is correct
30 Correct 6 ms 504 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 5 ms 504 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 6 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 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 6 ms 632 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 448 KB Output is correct
25 Correct 6 ms 504 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 6 ms 504 KB Output is correct
28 Correct 0 ms 504 KB Output is correct
29 Correct 6 ms 504 KB Output is correct
30 Correct 6 ms 504 KB Output is correct
31 Correct 6 ms 504 KB Output is correct
32 Correct 5 ms 504 KB Output is correct
33 Correct 117 ms 11000 KB Output is correct
34 Correct 122 ms 11256 KB Output is correct
35 Correct 115 ms 10872 KB Output is correct
36 Correct 119 ms 11384 KB Output is correct
37 Correct 118 ms 11768 KB Output is correct
38 Correct 123 ms 11640 KB Output is correct
39 Correct 116 ms 10616 KB Output is correct
40 Correct 113 ms 10616 KB Output is correct
41 Correct 120 ms 10744 KB Output is correct
42 Correct 119 ms 10744 KB Output is correct
43 Correct 125 ms 10636 KB Output is correct
44 Correct 116 ms 10232 KB Output is correct
45 Correct 114 ms 10360 KB Output is correct
46 Correct 112 ms 10232 KB Output is correct
47 Correct 108 ms 10360 KB Output is correct
48 Correct 112 ms 10232 KB Output is correct
49 Correct 121 ms 10872 KB Output is correct
50 Correct 120 ms 10872 KB Output is correct
51 Correct 120 ms 10872 KB Output is correct
52 Correct 119 ms 10976 KB Output is correct
53 Correct 117 ms 10872 KB Output is correct