結果

問題 No.808 Kaiten Sushi?
ユーザー jelljell
提出日時 2019-03-28 19:05:58
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 299 ms / 2,000 ms
コード長 7,452 bytes
コンパイル時間 1,068 ms
コンパイル使用メモリ 119,152 KB
実行使用メモリ 22,212 KB
最終ジャッジ日時 2023-08-03 13:01:19
合計ジャッジ時間 11,589 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 3 ms
4,384 KB
testcase_09 AC 5 ms
4,376 KB
testcase_10 AC 4 ms
4,376 KB
testcase_11 AC 3 ms
4,380 KB
testcase_12 AC 4 ms
4,380 KB
testcase_13 AC 3 ms
4,376 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 5 ms
4,376 KB
testcase_16 AC 4 ms
4,380 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 69 ms
10,728 KB
testcase_24 AC 55 ms
9,192 KB
testcase_25 AC 62 ms
10,088 KB
testcase_26 AC 59 ms
9,940 KB
testcase_27 AC 195 ms
18,944 KB
testcase_28 AC 52 ms
8,132 KB
testcase_29 AC 181 ms
18,036 KB
testcase_30 AC 111 ms
13,028 KB
testcase_31 AC 205 ms
19,748 KB
testcase_32 AC 234 ms
21,948 KB
testcase_33 AC 111 ms
12,764 KB
testcase_34 AC 133 ms
14,556 KB
testcase_35 AC 163 ms
16,704 KB
testcase_36 AC 110 ms
12,620 KB
testcase_37 AC 1 ms
4,380 KB
testcase_38 AC 2 ms
4,376 KB
testcase_39 AC 255 ms
20,408 KB
testcase_40 AC 53 ms
7,712 KB
testcase_41 AC 53 ms
8,024 KB
testcase_42 AC 220 ms
17,592 KB
testcase_43 AC 72 ms
9,584 KB
testcase_44 AC 151 ms
14,232 KB
testcase_45 AC 75 ms
9,600 KB
testcase_46 AC 38 ms
7,068 KB
testcase_47 AC 293 ms
22,204 KB
testcase_48 AC 292 ms
22,052 KB
testcase_49 AC 286 ms
22,212 KB
testcase_50 AC 299 ms
22,052 KB
testcase_51 AC 291 ms
22,144 KB
testcase_52 AC 151 ms
16,708 KB
testcase_53 AC 209 ms
21,664 KB
testcase_54 AC 1 ms
4,376 KB
testcase_55 AC 1 ms
4,376 KB
testcase_56 AC 1 ms
4,380 KB
testcase_57 AC 67 ms
9,828 KB
testcase_58 AC 110 ms
13,364 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>
#include <iostream>
#include <algorithm>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <complex>
#include <iomanip>
#include <bitset>
#include <random>

using namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
using pdi = pair<double, int>;
template <class T> using vct = vector<T>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() >> 10;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;

#define mod 1000000007LL
#define stdout_precision 10
#define stderr_precision 5
#define itr(i,v) for(auto i = begin(v); i != end(v); ++i)
#define ritr(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define fro front
#define bac back
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount

struct setupper {
    setupper() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        std::cout.tie(nullptr);
        std::cerr.tie(nullptr);
        std::cout << fixed << setprecision(stdout_precision);
        std::cerr << fixed << setprecision(stderr_precision);
#ifdef LOCAL
        freopen("input.txt","rt",stdin);
        freopen("output.txt","wt",stdout);
        // std::cerr << "\n---stderr---\n";
        // auto print_atexit = []() {
        //     std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
        //     std::cerr << "------------\n";
        // };
        // atexit((void(*)())print_atexit);
        // atexit((void(*)())fclose(stdin));
#endif
    }
} setupper_;

namespace std {
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
        static void apply(size_t& seed, Tup const& tup) {
            hashval_calc<Tup, index - 1>::apply(seed, tup);
            hash_combine(seed,get<index>(tup));
        }
    };
    template <class Tup> struct hashval_calc<Tup,0> {
        static void apply(size_t& seed, Tup const& tup) {
            hash_combine(seed,get<0>(tup));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& tup) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,tup);
            return seed;
        }
    };
}

template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
template <class T> ostream &operator<< (ostream &s, const vector<T> &v) {
    for(size_t i = 0; i < v.size(); ++i) s << (i ? " " : "") << v[i]; return s;
}
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T = i64> T read() { T x; return cin >> x, x; }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)

namespace updater {
    template <class T> static void add(T &x, const T &y) { x += y; }
    template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
    template <class T> static void mul(T &x, const T &y) { x *= y; }
    template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
    template <class T, class U> static bool chmax(T &x, const U &y) { return x < y ? x = y,true : false; }
    template <class T, class U> static bool chmin(T &x, const U &y) { return x > y ? x = y,true : false; }
};
using updater::chmax;
using updater::chmin;

template <class T> T minf(const T &x, const T &y) { return min(x,y); }
template <class T> T mixf(const T &x, const T &y) { return max(x,y); }
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; }
template <class F> i64 binry(i64 ok, i64 ng, const F &fn) {
    while (abs(ok - ng) > 1) {
        i64 mid = (ok + ng) / 2;
        (fn(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); }
template <class A> void cmprs(A ary[], size_t n) {
    vector<A> tmp(ary,ary + n);
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    for(A *i = ary; i != ary + n; ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class T> void cmprs(vector<T> &v) {
    vector<T> tmp = v; sort(begin(tmp),end(tmp));
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    for(auto i = begin(v); i != end(v); ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class F> void for_subset(uint_fast64_t s, const F &fn) {
    uint_fast64_t tmp = s;
    do { fn(tmp); } while((--tmp &= s) != s);
}

/* The main code follows. */


int n,l;
set<int> tea;
set<int> sushi;
i64 ans;
int now;


signed main() {
    cin>>n>>l;
    rep(i,n) {
        int x; cin>>x;
        sushi.emplace(x);
        sushi.emplace(x+l);
    }
    rep(i,n) {
        int x; cin>>x;
        tea.emplace(x);
        tea.emplace(x+l);
    }
    while(!tea.empty()) {
        auto tmp=sushi.lower_bound(now);
        ans+=*tmp-now;
        now=*tmp;
        if(now>=l) now-=l;

        tmp=tea.lower_bound(now);
        int nxx=*tmp;

        tmp=sushi.lower_bound(nxx);
        int nx=*tmp;

        
        sushi.erase(now);
        sushi.erase(now+l);

        tmp=tea.lower_bound(nx);
        if(tmp==tea.begin()) {
            tmp=prev(tea.end());
        } else {
            tmp--;
        }

        ans+=*tmp-now;
        now=*tmp;
        if(now>=l) now-=l;
        tea.erase(now);
        tea.erase(now+l);
    }
    writeln(ans);
}
0