oj.uz

Submission #860995

# Submission time Handle Problem Language Result Execution time Memory
860995 2023-10-15T04:53:21 Z phoenix0423 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 295 ms 19536 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 4e5 + 5;
const int INF = 1e9;

int main(void){
	// fastio;
	int n;
	cin>>n;
	vector<pll> a(n + 1);
	vector<ll> b(n);
	for(int i = 0; i < n + 1; i++){
		int x;
		cin>>x;
		a[i] = {x, i};
	}
	for(int i = 0; i < n; i++) cin>>b[i];
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	multiset<int> st;
	for(int i = 0; i < n; i++) st.insert(max(0LL, a[i + 1].f - b[i]));
	vector<int> ans(n + 1);
	for(int i = 0; i < n + 1; i++){
		auto [val, id] = a[i];
		ans[id] = *st.rbegin();
		if(i == n) break;
		st.erase(st.find(max(0LL, a[i + 1].f - b[i])));
		st.insert(max(0LL, a[i].f - b[i]));
	}
	for(int i = 0; i < n + 1; i++) cout<<ans[i]<<" ";
	cout<<"\n";
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 568 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 500 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 3 ms 756 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 604 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 568 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 500 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 3 ms 756 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 224 ms 18248 KB Output is correct
34 Correct 236 ms 19028 KB Output is correct
35 Correct 215 ms 18256 KB Output is correct
36 Correct 229 ms 18772 KB Output is correct
37 Correct 237 ms 19536 KB Output is correct
38 Correct 230 ms 19136 KB Output is correct
39 Correct 285 ms 18068 KB Output is correct
40 Correct 268 ms 18032 KB Output is correct
41 Correct 292 ms 18388 KB Output is correct
42 Correct 272 ms 18224 KB Output is correct
43 Correct 270 ms 18168 KB Output is correct
44 Correct 201 ms 17548 KB Output is correct
45 Correct 202 ms 17644 KB Output is correct
46 Correct 206 ms 17492 KB Output is correct
47 Correct 199 ms 18004 KB Output is correct
48 Correct 211 ms 18208 KB Output is correct
49 Correct 270 ms 18644 KB Output is correct
50 Correct 295 ms 18660 KB Output is correct
51 Correct 277 ms 18648 KB Output is correct
52 Correct 275 ms 18772 KB Output is correct
53 Correct 281 ms 18764 KB Output is correct