oj.uz

답안 #242403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242403 2020-06-27T15:28:11 Z SorahISA Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 151 ms 15608 KB 
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(1, 1E8); \
                 auto rnd = bind(__dis, __gen)

const int INF = 1E18;
const int mod = 1E9 + 7;
const int maxn = 2E5 + 5;

int A[maxn], B[maxn], id[maxn], id2[maxn], pre[maxn], suf[maxn];

int32_t main() {
    fastIO();
    
    int n;
    cin >> n;
    
    for (int i = 0; i <= n; ++i) cin >> A[i], id[i] = i;
    for (int i = 0; i <  n; ++i) cin >> B[i];
    sort(id, id + n + 1, [](auto a, auto b) {return A[a] < A[b];});
    for (int i = 0; i <= n; ++i) id2[id[i]] = i;
    sort(A, A + n + 1), sort(B, B + n);
    
    for (int i = 1; i <= n; ++i) {
        pre[i] = max(pre[i-1], A[i-1] - B[i-1]);
    }
    for (int i = n-1; i >= 0; --i) {
        suf[i] = max(suf[i+1], A[i+1] - B[i]);
    }
    
    for (int i = 0; i <= n; ++i) {
        // cout << pre[id2[i]] << " " << suf[id2[i]] << "\n";
        cout << max(pre[id2[i]], suf[id2[i]]) << " \n"[i == n];
    }
    
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 144 ms 10920 KB Output is correct
34 Correct 140 ms 15096 KB Output is correct
35 Correct 134 ms 14584 KB Output is correct
36 Correct 138 ms 15096 KB Output is correct
37 Correct 141 ms 15608 KB Output is correct
38 Correct 139 ms 15352 KB Output is correct
39 Correct 142 ms 14444 KB Output is correct
40 Correct 150 ms 14328 KB Output is correct
41 Correct 134 ms 14456 KB Output is correct
42 Correct 151 ms 14584 KB Output is correct
43 Correct 141 ms 14328 KB Output is correct
44 Correct 132 ms 13944 KB Output is correct
45 Correct 136 ms 14072 KB Output is correct
46 Correct 138 ms 13944 KB Output is correct
47 Correct 104 ms 14200 KB Output is correct
48 Correct 109 ms 14200 KB Output is correct
49 Correct 140 ms 14840 KB Output is correct
50 Correct 143 ms 14724 KB Output is correct
51 Correct 136 ms 14712 KB Output is correct
52 Correct 136 ms 14716 KB Output is correct
53 Correct 141 ms 14712 KB Output is correct