oj.uz

답안 #201565

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201565 2020-02-11T05:57:42 Z qkxwsm Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 314 ms 17912 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const int MAXN = 200013;

int N;
pll A[MAXN];
ll B[MAXN];
ll ans[MAXN];
multiset<ll> vals;

int32_t main()
{
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> N;
    FOR(i, 0, N + 1)
    {
        cin >> A[i].fi; A[i].se = i;
    }
    FOR(i, 0, N)
    {
        cin >> B[i];
    }
    sort(A, A + N + 1);
    sort(B, B + N);
    vals.insert(0);
    FOR(i, 0, N)
    {
        vals.insert(A[i].fi - B[i]);
        ans[A[N].se] = *vals.rbegin();
    }
    FORD(i, N, 0)
    {
        //originally i matched with i. now it matches with i+1.
        vals.erase(vals.find(A[i].fi - B[i]));
        vals.insert(A[i + 1].fi - B[i]);
        ans[A[i].se] = *vals.rbegin();
    }
    FOR(i, 0, N + 1)
    {
        cout << ans[i] << " \n"[i == N];
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 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 380 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 4 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 380 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 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 380 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 4 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 504 KB Output is correct
18 Correct 6 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 6 ms 504 KB Output is correct
22 Correct 6 ms 504 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 7 ms 508 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 7 ms 504 KB Output is correct
28 Correct 6 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 508 KB Output is correct
32 Correct 6 ms 504 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 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 380 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 4 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 504 KB Output is correct
18 Correct 6 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 6 ms 504 KB Output is correct
22 Correct 6 ms 504 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 7 ms 508 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 7 ms 504 KB Output is correct
28 Correct 6 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 508 KB Output is correct
32 Correct 6 ms 504 KB Output is correct
33 Correct 247 ms 16888 KB Output is correct
34 Correct 254 ms 17528 KB Output is correct
35 Correct 229 ms 16892 KB Output is correct
36 Correct 238 ms 17400 KB Output is correct
37 Correct 243 ms 17912 KB Output is correct
38 Correct 241 ms 17736 KB Output is correct
39 Correct 299 ms 16760 KB Output is correct
40 Correct 304 ms 16720 KB Output is correct
41 Correct 286 ms 16888 KB Output is correct
42 Correct 310 ms 16888 KB Output is correct
43 Correct 289 ms 16632 KB Output is correct
44 Correct 264 ms 16120 KB Output is correct
45 Correct 269 ms 16376 KB Output is correct
46 Correct 260 ms 16248 KB Output is correct
47 Correct 201 ms 16632 KB Output is correct
48 Correct 203 ms 16632 KB Output is correct
49 Correct 313 ms 17144 KB Output is correct
50 Correct 308 ms 17144 KB Output is correct
51 Correct 305 ms 17144 KB Output is correct
52 Correct 300 ms 17272 KB Output is correct
53 Correct 314 ms 17144 KB Output is correct