#327725 (C++14) No.808 Kaiten Sushi?

提出ソース

結果

問題	No.808 Kaiten Sushi?
ユーザー	lumc_
提出日時	2019-03-22 22:23:08
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,359 bytes
コンパイル時間	1,030 ms
コンパイル使用メモリ	118,852 KB
実行使用メモリ	22,272 KB
最終ジャッジ日時	2024-09-19 05:54:37
合計ジャッジ時間	7,833 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	WA	-
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	3 ms 6,940 KB
testcase_08	AC	3 ms 6,944 KB
testcase_09	AC	6 ms 6,940 KB
testcase_10	AC	4 ms 6,940 KB
testcase_11	AC	3 ms 6,944 KB
testcase_12	AC	4 ms 6,940 KB
testcase_13	AC	4 ms 6,940 KB
testcase_14	AC	3 ms 6,940 KB
testcase_15	AC	5 ms 6,944 KB
testcase_16	AC	4 ms 6,944 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	2 ms 6,944 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	71 ms 10,624 KB
testcase_24	AC	57 ms 9,216 KB
testcase_25	AC	62 ms 10,240 KB
testcase_26	AC	59 ms 9,856 KB
testcase_27	AC	204 ms 18,816 KB
testcase_28	AC	54 ms 8,064 KB
testcase_29	AC	193 ms 18,048 KB
testcase_30	AC	117 ms 12,928 KB
testcase_31	AC	212 ms 19,712 KB
testcase_32	AC	249 ms 21,760 KB
testcase_33	AC	118 ms 12,800 KB
testcase_34	AC	137 ms 14,464 KB
testcase_35	AC	171 ms 16,640 KB
testcase_36	AC	114 ms 12,672 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	2 ms 6,940 KB
testcase_39	AC	274 ms 20,480 KB
testcase_40	AC	54 ms 7,552 KB
testcase_41	AC	55 ms 8,064 KB
testcase_42	AC	208 ms 17,664 KB
testcase_43	AC	74 ms 9,600 KB
testcase_44	AC	157 ms 14,336 KB
testcase_45	AC	78 ms 9,600 KB
testcase_46	AC	40 ms 6,944 KB
testcase_47	AC	293 ms 22,272 KB
testcase_48	AC	289 ms 22,144 KB
testcase_49	AC	294 ms 22,144 KB
testcase_50	AC	290 ms 22,144 KB
testcase_51	AC	341 ms 22,144 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	AC	2 ms 6,944 KB
testcase_55	AC	2 ms 6,944 KB
testcase_56	AC	2 ms 6,940 KB
testcase_57	AC	63 ms 9,984 KB
testcase_58	AC	103 ms 13,312 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// 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--;
        if(ite == x.end()) ans += (l - now), now = 0, ite = x.begin();
        ans += *ite - now;
        now = *ite;
      }
      if(now >= l) now -= l;
      x.erase(now);
      x.erase(now + l);
      nex = *x.lower_bound(now);
    }

    {
      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--;
        if(ite == y.end()) ans += (l - now), now = 0, ite = y.begin();
        ans += *ite - now;
        now = *ite;
      }
      if(now >= l) now -= l;
      y.erase(now);
      y.erase(now + l);
      nex = *y.lower_bound(now);
    }
  }

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

yukicoder

結果

テストケース

ソースコード