oj.uz

Submission #534127

# Submission time Handle Problem Language Result Execution time Memory
534127 2022-03-08T01:23:20 Z Haruto810198 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 252 ms 21684 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;
const double eps = 1e-12;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")

const int MAX = 200010;

int n;
pii a[MAX];
int b[MAX];
multiset<int> st;

int res[MAX];

signed main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin>>n;
	FOR(i, 1, n+1, 1){
		cin>>a[i].F;
		a[i].S = i;
	}
	FOR(i, 1, n, 1){
		cin>>b[i];
	}

	sort(a+1, a+n+2);
	sort(b+1, b+n+1);

	// 1
	FOR(i, 1, n, 1){
		st.insert(max(a[i+1].F - b[i], (int)0));
	}
	res[a[1].S] = *prev(st.end());

	// 2 ~ n+1
	FOR(i, 2, n+1, 1){
		st.erase(st.find(max(a[i].F - b[i-1], (int)0)));
		st.insert(max(a[i-1].F - b[i-1], (int)0));
		res[a[i].S] = *prev(st.end());
	}

	FOR(i, 1, n+1, 1){
		cout<<res[i]<<' ';
	}
	cout<<'\n';

	return 0;

}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 2 ms 480 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 472 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 472 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 472 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 2 ms 480 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 472 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 472 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 472 KB Output is correct
33 Correct 177 ms 20528 KB Output is correct
34 Correct 191 ms 21204 KB Output is correct
35 Correct 177 ms 20544 KB Output is correct
36 Correct 178 ms 21056 KB Output is correct
37 Correct 181 ms 21684 KB Output is correct
38 Correct 184 ms 21588 KB Output is correct
39 Correct 229 ms 20420 KB Output is correct
40 Correct 245 ms 20304 KB Output is correct
41 Correct 248 ms 20564 KB Output is correct
42 Correct 236 ms 20456 KB Output is correct
43 Correct 234 ms 20288 KB Output is correct
44 Correct 156 ms 19788 KB Output is correct
45 Correct 164 ms 20036 KB Output is correct
46 Correct 155 ms 19784 KB Output is correct
47 Correct 152 ms 20312 KB Output is correct
48 Correct 168 ms 20292 KB Output is correct
49 Correct 247 ms 21048 KB Output is correct
50 Correct 238 ms 20992 KB Output is correct
51 Correct 252 ms 20988 KB Output is correct
52 Correct 240 ms 20940 KB Output is correct
53 Correct 243 ms 20928 KB Output is correct