結果

問題 No.808 Kaiten Sushi?
ユーザー TiramisterTiramister
提出日時 2019-03-22 22:32:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 634 ms / 2,000 ms
コード長 4,791 bytes
コンパイル時間 1,219 ms
コンパイル使用メモリ 115,536 KB
実行使用メモリ 10,772 KB
最終ジャッジ日時 2023-10-19 09:49:01
合計ジャッジ時間 15,297 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 10 ms
4,348 KB
testcase_08 AC 11 ms
4,348 KB
testcase_09 AC 19 ms
4,348 KB
testcase_10 AC 13 ms
4,348 KB
testcase_11 AC 10 ms
4,348 KB
testcase_12 AC 13 ms
4,348 KB
testcase_13 AC 11 ms
4,348 KB
testcase_14 AC 5 ms
4,348 KB
testcase_15 AC 17 ms
4,348 KB
testcase_16 AC 14 ms
4,348 KB
testcase_17 AC 7 ms
4,348 KB
testcase_18 AC 5 ms
4,348 KB
testcase_19 AC 3 ms
4,348 KB
testcase_20 AC 4 ms
4,348 KB
testcase_21 AC 3 ms
4,348 KB
testcase_22 AC 4 ms
4,348 KB
testcase_23 AC 241 ms
6,748 KB
testcase_24 AC 194 ms
5,228 KB
testcase_25 AC 225 ms
5,664 KB
testcase_26 AC 212 ms
5,592 KB
testcase_27 AC 537 ms
10,284 KB
testcase_28 AC 165 ms
5,052 KB
testcase_29 AC 510 ms
9,752 KB
testcase_30 AC 321 ms
6,648 KB
testcase_31 AC 545 ms
10,772 KB
testcase_32 AC 622 ms
10,084 KB
testcase_33 AC 318 ms
6,632 KB
testcase_34 AC 365 ms
6,984 KB
testcase_35 AC 449 ms
8,768 KB
testcase_36 AC 313 ms
6,456 KB
testcase_37 AC 2 ms
4,348 KB
testcase_38 AC 2 ms
4,348 KB
testcase_39 AC 572 ms
9,292 KB
testcase_40 AC 138 ms
4,692 KB
testcase_41 AC 158 ms
4,872 KB
testcase_42 AC 473 ms
9,292 KB
testcase_43 AC 207 ms
5,400 KB
testcase_44 AC 365 ms
6,984 KB
testcase_45 AC 207 ms
5,400 KB
testcase_46 AC 118 ms
4,576 KB
testcase_47 AC 634 ms
10,348 KB
testcase_48 AC 630 ms
10,348 KB
testcase_49 AC 630 ms
10,348 KB
testcase_50 AC 630 ms
10,348 KB
testcase_51 AC 631 ms
10,348 KB
testcase_52 AC 434 ms
8,816 KB
testcase_53 AC 601 ms
10,084 KB
testcase_54 AC 2 ms
4,348 KB
testcase_55 AC 2 ms
4,348 KB
testcase_56 AC 2 ms
4,348 KB
testcase_57 AC 211 ms
5,608 KB
testcase_58 AC 329 ms
6,720 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>

// contancer library
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#include <functional>
#include <limits>

using ll = long long;
using ld = long double;

/* ----- Output Functions for Debugging ----- */

template <class T>
std::ostream& operator<<(std::ostream& os, std::vector<T> v);
template <class T>
std::ostream& operator<<(std::ostream& os, std::set<T> v);
template <class L, class R>
std::ostream& operator<<(std::ostream& os, std::pair<L, R> p);
template <class K, class T>
std::ostream& operator<<(std::ostream& os, std::map<K, T> v);
template <class T>
std::ostream& operator<<(std::ostream& os, std::queue<T> q);
template <class T>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T> q);

template <class T>
std::ostream& operator<<(std::ostream& os, std::vector<T> v) {
    os << "[";
    for (auto vv : v) os << vv << ",";
    return os << "]";
}

template <class T>
std::ostream& operator<<(std::ostream& os, std::set<T> v) {
    os << "{";
    for (auto vv : v) os << vv << ",";
    return os << "}";
}

template <class L, class R>
std::ostream& operator<<(std::ostream& os, std::pair<L, R> p) {
    return os << "(" << p.first << "," << p.second << ")";
}

template <class K, class T>
std::ostream& operator<<(std::ostream& os, std::map<K, T> v) {
    os << "{";
    for (auto vv : v) os << vv << ",";
    return os << "}";
}

template <class T>
std::ostream& operator<<(std::ostream& os, std::queue<T> q) {
    os << "[";
    while (!q.empty()) {
        os << q.front() << ",";
        q.pop();
    }
    return os << "]";
}

template <class T>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T> q) {
    os << "{";
    while (!q.empty()) {
        os << q.top() << ",";
        q.pop();
    }
    return os << "}";
}

/* ----- Short Functions ----- */

template <class T>
T Vec(T v) { return v; }

template <class T, class... Ts>
auto Vec(size_t l, Ts... ts) {
    return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}

template <class T>
inline T sq(T a) { return a * a; }

template <class T>
inline T iceil(T n, T d) { return (n + d - 1) / d; }

template <class T>
T gcd(T a, T b) {
    while (b > 0) {
        a %= b;
        swap(a, b);
    }
    return a;
}

template <class T, class U>
T ipow(T b, U n) {
    T ret = 1;
    while (n > 0) {
        if (n & 1) ret *= b;
        n >>= 1;
        b *= b;
    }
    return ret;
}

// 0-indexed
template <class T, class U>
inline T kthbit(T a, U k) { return (a >> k) & 1; }

template <class T, class U>
inline T mask(T a, U k) { return a & ((1 << k) - 1); }

/* ----- class ----- */

template <class T>
struct Edge {
    int from, to;
    T cost;
    Edge(int from = -1, int to = -1, T cost = 1) : from(from), to(to), cost(cost){};

    bool operator<(const Edge<T>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<T>& e) const { return this->cost > e.cost; }
};

template <class T = int>
class Graph {
public:
    explicit Graph(int N = 0) : size(N) { path.resize(size); }
    void span(int u, int v, T cost = 1) { path[u].push_back(Edge<T>(u, v, cost)); }
    std::vector<Edge<T>> operator[](int v) const { return path[v]; }

    int size;
    std::vector<std::vector<Edge<T>>> path;
};

/* ----- Constants ----- */

// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const ld PI = acos(-1);
// const ld EPS = 1e-10;
// mt19937 mt(ll(time(0)));

int main() {
    int N;
    ll L;
    std::cin >> N >> L;

    std::vector<std::pair<ll, int>> pos(N * 2);
    for (int i = 0; i < N; ++i) {
        std::cin >> pos[i].first;
        pos[i].second = 1;
    }
    for (int i = 0; i < N; ++i) {
        std::cin >> pos[i + N].first;
        pos[i + N].second = -1;
    }

    std::sort(pos.begin(), pos.end());
    int bitr = 0;
    while (pos[bitr].second < 0) ++bitr;

    ll buf = pos[bitr].first;
    for (auto& p : pos) {
        p.first -= buf;
        if (p.first < 0) p.first += L;
    }
    std::sort(pos.begin(), pos.end());
    pos.push_back(pos.front());

    std::vector<ll> sushi(N * 2 + 1);
    sushi[0] = 0;
    for (int i = 0; i < N * 2; ++i) {
        sushi[i + 1] = sushi[i] + pos[i].second;
    }
    ll min = *std::min_element(sushi.begin(), sushi.end());
    for (auto& s : sushi) s -= min;
    std::cerr << sushi << std::endl;

    ll ans = 0;
    for (int i = 1; i <= N * 2; ++i) {
        if (pos[i].second < 0) {
            ans = std::max(ans, pos[i].first + L * (sushi[i] - 1));
        }
    }
    std::cout << ans + buf << std::endl;
    return 0;
}
0