제출 #762995

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
762995		vjudge1	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	87 ms	6932 KiB

ho_t1

#include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <unordered_map>
#include <vector>

// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")

typedef unsigned short u16;
typedef short i16;
typedef unsigned int u32;
typedef int i32;
typedef unsigned long long u64;
typedef long long i64;
typedef float f32;
typedef double f64;
typedef long double f80;
typedef long double f128;

namespace std
{
    template <typename T, typename U>
    struct hash<pair<T, U>>
    {
        size_t operator()(const pair<T, U>& x) const { return hash<T>()(x.first) ^ hash<U>()(x.second); }
    };
}  // namespace std

template <typename T>
using limits = std::numeric_limits<T>;

template <typename T, typename U>
using pa = std::pair<T, U>;

template <typename T, typename U>
using umap = std::unordered_map<T, U>;

#ifdef LOCAL
#include <chrono>

#include "tools.hpp"
#define here(...)                                                                \
    std::cerr << __func__ << ':' << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; \
    _debug(__VA_ARGS__)
#else
#define here(...)
#endif

void solve()
{
    u32 n;
    std::cin >> n;
    std::vector<u32> id(n + 1);
    std::vector<i32> b(n), pr(n + 1), sf(n + 1);
    std::vector<std::pair<i32, u32>> c(n + 1);
    for (u32 i = 0; i < n + 1; ++i)
    {
        i32 ai;
        std::cin >> ai;
        c[i] = std::make_pair(ai, i);
    }
    for (auto& i : b)
    {
        std::cin >> i;
    }
    std::sort(b.begin(), b.end());
    std::sort(c.begin(), c.end());
    for (u32 i = 0; i < n + 1; ++i)
    {
        id[c[i].second] = i;
    }
    for (u32 i = 0; i < n + 1; ++i)
    {
        pr[i] = std::max(i > 0 ? pr[i - 1] : 0, c[i].first - (i < n ? b[i] : 0));
    }
    for (u32 i = n; i + 1 > 0; i--)
    {
        sf[i] = std::max(i < n ? sf[i + 1] : 0, c[i].first - (i > 0 ? b[i - 1] : 0));
    }
    for (auto& i : id)
    {
        std::cout << std::max(i > 0 ? pr[i - 1] : 0, i < n ? sf[i + 1] : 0) << ' ';
    }
    std::cout << '\n';
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
#ifdef LOCAL
    using std::chrono::duration_cast;
    using std::chrono::high_resolution_clock;
    using std::chrono::microseconds;
    auto st = high_resolution_clock::now();
    std::ifstream input("./in.txt");
    std::ofstream output("./log/bsol.txt");
    auto cin_buf = std::cin.rdbuf(input.rdbuf());
    auto cout_buf = std::cout.rdbuf(output.rdbuf());
#endif
    solve();
#ifdef LOCAL
    std::cin.rdbuf(cin_buf);
    std::cout.rdbuf(cout_buf);
    input.close();
    output.close();
    auto ed = high_resolution_clock::now();
    std::cerr << "Time elapsed: " << duration_cast<microseconds>(ed - st).count() << " microseconds\n";
#endif
    return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91