oj.uz

Submission #957240

# Submission time Handle Problem Language Result Execution time Memory
957240 2024-04-03T09:39:19 Z aaron_dcoder Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 189 ms 15468 KB 
#define NDEBUG


#ifdef NDEBUG
#define dbg(TXTMSG) if constexpr (false) cerr << "lol"
#define dbgv(VARN) ((void)0)
#define dbgfor(COND) if constexpr (false) for (COND)

#else
#define _GLIBCXX_DEBUG 1
#define _GLIBCXX_DEBUG_PEDANTIC 1
#pragma GCC optimize("trapv")
#define dbg(TXTMSG) cerr << "\n" << TXTMSG
#define dbgv(VARN) cerr << "\n" << #VARN << " = "<< VARN << ", line " << __LINE__ << "\n"
#define dbgfor(COND) for (COND)

#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long; 
using pll = pair<ll,ll>;
#define e0 first
#define e1 second
constexpr ll INFTY = 2e18;

int main()
{
	ll N;
	cin >> N;

	vector<pll> A(N+1);
	for (ll i = 0; i < N+1; ++i)
	{
		cin >> A[i].e0;
		A[i].e1=i;
	}

	vector<ll> B(N);
	for (ll i = 0; i < N; ++i)
	{
		cin >> B[i];
	}

	sort(A.begin(),A.end());
	sort(B.begin(),B.end());

	vector<ll> fcost(N);
	vector<ll> bcost(N+1,0);

	fcost[0] = A[0].e0-B[0];
	for (ll i = 1; i < N; ++i)
	{
		fcost[i] = max(fcost[i-1], A[i].e0-B[i]);
	}

	bcost[N-1] = A[N].e0-B[N-1];
	for (ll i = N-2; i >= 0; --i)
	{
		bcost[i] = max(bcost[i+1], A[i+1].e0-B[i]);
	}

	vector<ll> ans(N+1);

	ans[A[0].e1] = max(bcost[0],0ll);
	for (ll i = 0; i < N; ++i)
	{
		ans[A[i+1].e1] = max({fcost[i],bcost[i+1],0ll});
	}

	for (ll o : ans)
	{
		cout << o << " ";
	}
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 432 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 432 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 1 ms 500 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 444 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 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 448 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 432 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 1 ms 500 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 444 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 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 448 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 143 ms 14520 KB Output is correct
34 Correct 149 ms 15172 KB Output is correct
35 Correct 143 ms 14672 KB Output is correct
36 Correct 145 ms 15072 KB Output is correct
37 Correct 156 ms 15468 KB Output is correct
38 Correct 152 ms 15264 KB Output is correct
39 Correct 145 ms 14420 KB Output is correct
40 Correct 168 ms 14344 KB Output is correct
41 Correct 146 ms 14448 KB Output is correct
42 Correct 153 ms 14416 KB Output is correct
43 Correct 146 ms 14420 KB Output is correct
44 Correct 151 ms 13904 KB Output is correct
45 Correct 161 ms 14140 KB Output is correct
46 Correct 148 ms 13896 KB Output is correct
47 Correct 148 ms 14164 KB Output is correct
48 Correct 149 ms 14176 KB Output is correct
49 Correct 150 ms 14712 KB Output is correct
50 Correct 156 ms 14708 KB Output is correct
51 Correct 189 ms 14660 KB Output is correct
52 Correct 149 ms 14696 KB Output is correct
53 Correct 157 ms 14688 KB Output is correct