結果

問題 No.808 Kaiten Sushi?
ユーザー lumc_lumc_
提出日時 2019-03-22 22:38:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,291 bytes
コンパイル時間 960 ms
コンパイル使用メモリ 120,240 KB
実行使用メモリ 22,400 KB
最終ジャッジ日時 2024-09-19 06:04:18
合計ジャッジ時間 7,274 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 WA -
testcase_02 AC 2 ms
5,376 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 2 ms
5,376 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 5 ms
5,376 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 4 ms
5,376 KB
testcase_13 AC 4 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 5 ms
5,376 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 57 ms
10,240 KB
testcase_26 AC 53 ms
9,728 KB
testcase_27 AC 187 ms
18,944 KB
testcase_28 AC 49 ms
8,192 KB
testcase_29 AC 176 ms
18,048 KB
testcase_30 AC 107 ms
12,928 KB
testcase_31 AC 199 ms
19,712 KB
testcase_32 WA -
testcase_33 AC 105 ms
12,800 KB
testcase_34 AC 129 ms
14,336 KB
testcase_35 WA -
testcase_36 AC 106 ms
12,672 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 2 ms
5,376 KB
testcase_39 AC 265 ms
20,608 KB
testcase_40 AC 52 ms
7,680 KB
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 69 ms
9,600 KB
testcase_44 WA -
testcase_45 WA -
testcase_46 AC 39 ms
6,784 KB
testcase_47 WA -
testcase_48 AC 285 ms
22,144 KB
testcase_49 AC 282 ms
22,272 KB
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 AC 2 ms
5,376 KB
testcase_57 WA -
testcase_58 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <list>
#include <ostream>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
template < int n, class... T >
typename std::enable_if< (n >= sizeof...(T)) >::type __output_tuple(
    std::ostream &, std::tuple< T... > const &) {}
template < int n, class... T >
typename std::enable_if< (n < sizeof...(T)) >::type __output_tuple(
    std::ostream &os, std::tuple< T... > const &t) {
  os << (n == 0 ? "" : ", ") << std::get< n >(t);
  __output_tuple< n + 1 >(os, t);
}
template < class... T >
std::ostream &operator<<(std::ostream &os, std::tuple< T... > const &t) {
  os << "(";
  __output_tuple< 0 >(os, t);
  os << ")";
  return os;
}
template < class T, class U >
std::ostream &operator<<(std::ostream &os, std::pair< T, U > const &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template < class T >
std::ostream &operator<<(std::ostream &os, const std::stack< T > &a) {
  os << "{";
  for(auto tmp = a; tmp.size(); tmp.pop())
    os << (a.size() == tmp.size() ? "" : ", ") << tmp.top();
  os << "}";
  return os;
}
template < class T, class Container, class Compare >
std::ostream &operator<<(std::ostream &os,
    std::priority_queue< T, Container, Compare > a) {
  os << "{ (top) ";
  while(a.size()) os << a.top() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
template < class T, class Container >
std::ostream &operator<<(std::ostream &os, std::queue< T, Container > a) {
  os << "{ ";
  while(a.size()) os << a.front() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
#ifdef DEBUG
#if !defined(DEBUG_OUT)
#define DEBUG_OUT std::cerr
#endif
#define dump(...)                                                                \
  [&]() {                                                                        \
    auto __debug_tap = std::make_tuple(__VA_ARGS__);                             \
    DEBUG_OUT << "[" << __LINE__ << "] " << #__VA_ARGS__ << " = " << __debug_tap \
    << std::endl;                                                      \
  }()
template < class T >
inline void dump2D(T &d, size_t sizey, size_t sizex) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << "\t";
    for(size_t j = 0; j < sizex; j++)
      DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t");
    DEBUG_OUT << std::endl;
  }
}
template < class T >
inline void dump1D(T &d, size_t sizey) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << d[i] << (i + 1 == sizey ? "" : " ");
  }
  DEBUG_OUT << std::endl;
}
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        os << "{";
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : ", ") << *ite;
        os << "}";
        return os;
      }
#else
#define dump(...) (42)
#define dump2D(...) (42)
#define dump1D(...) (42)
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : " ") << *ite;
        return os;
      }
#endif
// }}}

// int x[112345];
// int y[112345];

int n, l;

int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  cin >> n >> l;
  int xx, yy;
  set<int> x, y;
  for(int i = 0; i < n; i++) cin >> xx, x.insert(xx), x.insert(xx + l);
  for(int i = 0; i < n; i++) cin >> yy, y.insert(yy), y.insert(yy + l);

  int now = 0;
  ll ans = 0;
  int nex = *y.begin();
  for(int i = 0; i < n; i++) {
    assert(now < l);
    assert(now <= nex);
    {
      auto ite0 = x.lower_bound(now);
      auto ite = x.lower_bound(nex);
      if(ite0 == ite) {
        if(ite == x.end()) ans += (l - now), now = 0, ite = x.begin();
        ans += *ite - now;
        now = *ite;
      } else {
        ite--;
        ans += *ite - now;
        now = *ite;
      }
      if(now >= l) now -= l;
      x.erase(now);
      x.erase(now + l);
      if(x.size()) nex = *x.lower_bound(now);
      else nex = 2 * l;
    }

    {
      auto ite0 = y.lower_bound(now);
      auto ite = y.lower_bound(nex);
      if(ite0 == ite) {
        if(ite == y.end()) ans += (l - now), now = 0, ite = y.begin();
        ans += *ite - now;
        now = *ite;
      } else {
        ite--;
        ans += *ite - now;
        now = *ite;
      }
      if(now >= l) now -= l;
      y.erase(now);
      y.erase(now + l);
      if(y.size()) nex = *y.lower_bound(now);
      else nex = 2 * l;
    }
  }

  cout << ans << endl;
  return 0;
}
0