oj.uz

답안 #242394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242394 2020-06-27T15:16:04 Z SorahISA Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 5 ms 384 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;

int32_t main() {
    fastIO();
    
    int n;
    cin >> n;
    
    vector<int> A(n+1), B(n), id(n+1), id2(n+1), pre(n+1), suf(n+1);
    for (auto &x : A) cin >> x;
    for (auto &x : B) cin >> x;
    iota(ALL(id), 0);
    sort(ALL(id), [=](auto a, auto b) {return A[a] < A[b];});
    for (int i = 0; i <= n; ++i) id2[id[i]] = i;
    sort(ALL(A)), sort(ALL(B));
    
    for (int i = 1; i <= n; ++i) {
        pre[i] = max(pre[i-1], abs(A[i-1] - B[i-1]));
    }
    for (int i = n-1; i >= 0; --i) {
        suf[i] = max(suf[i+1], abs(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
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -