結果

問題 No.5004 Room Assignment
ユーザー maimai
提出日時 2021-12-03 02:32:51
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 142 ms / 5,000 ms
コード長 6,757 bytes
コンパイル時間 2,861 ms
実行使用メモリ 22,356 KB
スコア 5,232,255
平均クエリ数 7650.00
最終ジャッジ日時 2021-12-03 02:33:14
合計ジャッジ時間 20,363 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 122 ms
21,912 KB
testcase_01 AC 131 ms
22,212 KB
testcase_02 AC 124 ms
21,960 KB
testcase_03 AC 125 ms
21,924 KB
testcase_04 AC 124 ms
22,008 KB
testcase_05 AC 128 ms
21,948 KB
testcase_06 AC 128 ms
21,768 KB
testcase_07 AC 124 ms
22,140 KB
testcase_08 AC 120 ms
21,984 KB
testcase_09 AC 120 ms
21,936 KB
testcase_10 AC 124 ms
21,792 KB
testcase_11 AC 136 ms
22,092 KB
testcase_12 AC 130 ms
21,984 KB
testcase_13 AC 125 ms
21,900 KB
testcase_14 AC 125 ms
21,816 KB
testcase_15 AC 124 ms
21,912 KB
testcase_16 AC 122 ms
21,948 KB
testcase_17 AC 127 ms
21,924 KB
testcase_18 AC 130 ms
21,936 KB
testcase_19 AC 123 ms
21,960 KB
testcase_20 AC 133 ms
21,780 KB
testcase_21 AC 134 ms
21,780 KB
testcase_22 AC 125 ms
22,128 KB
testcase_23 AC 124 ms
21,936 KB
testcase_24 AC 124 ms
22,152 KB
testcase_25 AC 123 ms
22,356 KB
testcase_26 AC 123 ms
21,924 KB
testcase_27 AC 120 ms
21,912 KB
testcase_28 AC 123 ms
21,960 KB
testcase_29 AC 122 ms
21,768 KB
testcase_30 AC 132 ms
22,140 KB
testcase_31 AC 128 ms
21,780 KB
testcase_32 AC 125 ms
21,732 KB
testcase_33 AC 123 ms
21,780 KB
testcase_34 AC 124 ms
21,948 KB
testcase_35 AC 121 ms
21,936 KB
testcase_36 AC 126 ms
21,956 KB
testcase_37 AC 120 ms
21,900 KB
testcase_38 AC 121 ms
22,032 KB
testcase_39 AC 124 ms
21,924 KB
testcase_40 AC 133 ms
21,804 KB
testcase_41 AC 120 ms
22,104 KB
testcase_42 AC 124 ms
21,968 KB
testcase_43 AC 116 ms
22,028 KB
testcase_44 AC 123 ms
21,948 KB
testcase_45 AC 118 ms
21,768 KB
testcase_46 AC 120 ms
21,924 KB
testcase_47 AC 119 ms
22,020 KB
testcase_48 AC 132 ms
22,140 KB
testcase_49 AC 123 ms
21,720 KB
testcase_50 AC 142 ms
21,780 KB
testcase_51 AC 121 ms
21,888 KB
testcase_52 AC 122 ms
22,212 KB
testcase_53 AC 128 ms
21,924 KB
testcase_54 AC 131 ms
21,948 KB
testcase_55 AC 121 ms
21,912 KB
testcase_56 AC 133 ms
22,128 KB
testcase_57 AC 123 ms
21,900 KB
testcase_58 AC 122 ms
21,912 KB
testcase_59 AC 121 ms
21,888 KB
testcase_60 AC 133 ms
22,020 KB
testcase_61 AC 120 ms
21,828 KB
testcase_62 AC 134 ms
22,104 KB
testcase_63 AC 121 ms
21,936 KB
testcase_64 AC 133 ms
21,924 KB
testcase_65 AC 122 ms
22,016 KB
testcase_66 AC 126 ms
21,900 KB
testcase_67 AC 120 ms
21,948 KB
testcase_68 AC 129 ms
22,032 KB
testcase_69 AC 132 ms
22,020 KB
testcase_70 AC 128 ms
21,780 KB
testcase_71 AC 128 ms
21,972 KB
testcase_72 AC 128 ms
22,032 KB
testcase_73 AC 131 ms
21,776 KB
testcase_74 AC 130 ms
21,960 KB
testcase_75 AC 119 ms
21,912 KB
testcase_76 AC 122 ms
22,356 KB
testcase_77 AC 121 ms
22,152 KB
testcase_78 AC 120 ms
21,960 KB
testcase_79 AC 132 ms
21,900 KB
testcase_80 AC 127 ms
21,984 KB
testcase_81 AC 123 ms
21,888 KB
testcase_82 AC 115 ms
21,948 KB
testcase_83 AC 118 ms
21,924 KB
testcase_84 AC 131 ms
21,960 KB
testcase_85 AC 116 ms
21,948 KB
testcase_86 AC 119 ms
21,768 KB
testcase_87 AC 120 ms
21,936 KB
testcase_88 AC 120 ms
21,912 KB
testcase_89 AC 132 ms
21,948 KB
testcase_90 AC 126 ms
21,960 KB
testcase_91 AC 118 ms
22,152 KB
testcase_92 AC 130 ms
21,924 KB
testcase_93 AC 118 ms
21,912 KB
testcase_94 AC 119 ms
22,020 KB
testcase_95 AC 118 ms
22,140 KB
testcase_96 AC 122 ms
21,948 KB
testcase_97 AC 122 ms
22,092 KB
testcase_98 AC 119 ms
21,948 KB
testcase_99 AC 131 ms
21,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template<typename T>
static ostream& operator<<(ostream& o, const std::vector<T>& v) {
  o << "[ "; for(const auto& e : v) o<<e<<' ';
  return o << ']';
}

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

//

constexpr int T = 3600;
constexpr int R = 4;

//

struct Player {
  int level;
  int id;
  inline bool operator<(const Player &p) const { return level < p.level; }
};

class Game {
  int tick_;
  int player_id_;

public:
  inline int tick() const { return tick_; }
  void initialize() {
    int t, r;
    scanner >> t >> r;
    assert(T == t);
    assert(R == r);
    tick_ = 0;
  }
  vector<Player> proceedTick() {
    assert(++tick_ <= T);
    int n;
    scanner >> n;
    vector<Player> v(n);
    repeat(i, n) {
      int l;
      scanner >> l;
      v[i].level = l;
      v[i].id = ++player_id_;
    }
    return v;
  }

  bool uniteTeam(const vector<pair<int, int>> &uni) {
    printer << int(uni.size()) << '\n';
    for (auto &p : uni) {
      printer << p.first << ' ' << p.second << '\n';
    }
    cout.flush();
    return tick_ < T;
  }
};

//

class Solver : Game {
  vector<Player> stock_;

  vector<pair<int, int>> gameloop() {
    vector<pair<int, int>> unions;

    auto newcomer = proceedTick();
    stock_.insert(stock_.end(), all(newcomer));
    sort(all(stock_));
    while (stock_.size() >= 4) {
      int n = stock_.size();
      pair<int, int> best{stock_[3].level - stock_[0].level, 0};
      repeat(i, n - 3) {
        chmin(best, pair<int, int>{stock_[3 + i].level - stock_[i].level, 0});
      }
      int idx = best.second;
      repeat(i, 3) {
        unions.emplace_back(stock_[idx].id, stock_[idx + i + 1].id);
      }
      stock_.erase(stock_.begin() + idx, stock_.begin() + idx + 4);
    }

    return unions;
  }

public:
  void solve() {
    Game::initialize();

    while (true) {
      auto uu = gameloop();
      if (!uniteTeam(uu))
        break;
    }

    cerr << 0 << endl; // TODO: print score
  }
};

//

int main() {
  Solver().solve();
  return 0;
}
0