#608859 (C++17) No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩

提出ソース

結果

問題	No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー	NyaanNyaan
提出日時	2021-01-22 22:45:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	12,903 bytes
コンパイル時間	3,086 ms
コンパイル使用メモリ	283,624 KB
実行使用メモリ	12,284 KB
最終ジャッジ日時	2024-06-08 16:37:17
合計ジャッジ時間	35,612 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	4 ms 5,376 KB
testcase_09	AC	3 ms 5,376 KB
testcase_10	AC	5 ms 5,376 KB
testcase_11	AC	3 ms 5,376 KB
testcase_12	AC	4 ms 5,376 KB
testcase_13	AC	3 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	7 ms 5,376 KB
testcase_16	AC	6 ms 5,376 KB
testcase_17	AC	4 ms 5,376 KB
testcase_18	AC	47 ms 5,376 KB
testcase_19	AC	24 ms 5,376 KB
testcase_20	AC	48 ms 5,376 KB
testcase_21	AC	34 ms 5,376 KB
testcase_22	AC	46 ms 5,376 KB
testcase_23	AC	64 ms 5,376 KB
testcase_24	AC	79 ms 5,376 KB
testcase_25	AC	65 ms 5,376 KB
testcase_26	AC	67 ms 5,376 KB
testcase_27	AC	36 ms 5,376 KB
testcase_28	AC	545 ms 7,540 KB
testcase_29	AC	436 ms 5,752 KB
testcase_30	AC	333 ms 5,744 KB
testcase_31	AC	404 ms 7,796 KB
testcase_32	AC	764 ms 8,228 KB
testcase_33	AC	315 ms 5,624 KB
testcase_34	AC	644 ms 7,540 KB
testcase_35	AC	593 ms 7,928 KB
testcase_36	AC	1,048 ms 9,456 KB
testcase_37	AC	313 ms 5,376 KB
testcase_38	AC	408 ms 6,512 KB
testcase_39	AC	267 ms 5,484 KB
testcase_40	AC	378 ms 5,748 KB
testcase_41	AC	687 ms 6,492 KB
testcase_42	AC	746 ms 9,212 KB
testcase_43	AC	593 ms 7,412 KB
testcase_44	AC	563 ms 8,048 KB
testcase_45	AC	448 ms 6,648 KB
testcase_46	AC	526 ms 7,676 KB
testcase_47	AC	397 ms 5,376 KB
testcase_48	AC	1,096 ms 12,152 KB
testcase_49	AC	877 ms 12,160 KB
testcase_50	AC	1,166 ms 12,028 KB
testcase_51	AC	1,040 ms 12,032 KB
testcase_52	AC	875 ms 12,280 KB
testcase_53	AC	1,466 ms 12,160 KB
testcase_54	AC	1,410 ms 12,156 KB
testcase_55	AC	1,618 ms 12,156 KB
testcase_56	AC	1,451 ms 12,284 KB
testcase_57	AC	980 ms 12,156 KB
testcase_58	AC	699 ms 12,152 KB
testcase_59	AC	705 ms 12,156 KB
testcase_60	AC	697 ms 12,160 KB
testcase_61	AC	718 ms 12,156 KB
testcase_62	AC	691 ms 12,152 KB
testcase_63	AC	36 ms 12,284 KB
testcase_64	AC	35 ms 12,156 KB
testcase_65	AC	35 ms 12,156 KB
testcase_66	AC	35 ms 12,160 KB
testcase_67	AC	36 ms 12,276 KB
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	AC	2 ms 5,376 KB
testcase_73	WA	-

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

ソースコード

raw source code

/**
 *  date : 2021-01-22 22:45:08
 */

#define NDEBUG
using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>

// utility
namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  T &x() { return first; }
  const T &x() const { return first; }
  U &y() { return second; }
  const U &y() const { return second; }

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}
template <typename T, size_t N>
void mem(T (&a)[N], int c) {
  memset(a, c, sizeof(T) * N);
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<T> reord(const vector<T> &v, const vector<T> &ord) {
  int N = v.size();
  vector<T> ret(N);
  for (int i = 0; i < N; i++) ret[i] = v[ord[i]];
  return ret;
};

template <typename T = int>
vector<T> mkiota(int N) {
  vector<T> ret(N);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
vector<int> mkinv(vector<T> &v, int max_val = -1) {
  if (max_val < (int)v.size()) max_val = v.size() - 1;
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

}  // namespace Nyaan

// bit operation
namespace Nyaan {

__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return _mm_popcnt_u64(a);
}

__attribute__((target("bmi"))) inline int lsb(const u64 &a) {
  return _tzcnt_u64(a);
}
__attribute__((target("bmi"))) inline int ctz(const u64 &a) {
  return _tzcnt_u64(a);
}

__attribute__((target("lzcnt"))) inline int msb(const u64 &a) {
  return 63 - _lzcnt_u64(a);
}
__attribute__((target("lzcnt"))) inline int clz64(const u64 &a) {
  return _lzcnt_u64(a);
}

template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  a ^= (gbit(a, i) == b ? 0 : (T(b) << i));
}

constexpr long long PW(int n) { return 1LL << n; }

constexpr long long MSK(int n) { return (1LL << n) - 1; }

}  // namespace Nyaan

// inout
namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

void outr() {}
template <typename T, class... U, char sep = ' '>
void outr(const T &t, const U &... u) {
  cout << t;
  outr(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan

// debug
namespace DebugImpl {

template <typename U, typename = void>
struct is_specialize : false_type {};
template <typename U>
struct is_specialize<
    U, typename conditional<false, typename U::iterator, void>::type>
    : true_type {};
template <typename U>
struct is_specialize<
    U, typename conditional<false, decltype(U::first), void>::type>
    : true_type {};
template <typename U>
struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {
};

void dump(const char& t) { cerr << t; }

void dump(const string& t) { cerr << t; }

template <typename U,
          enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>
void dump(const U& t) {
  cerr << t;
}

template <typename T>
void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {
  string res;
  if (t == Nyaan::inf) res = "inf";
  if (is_signed<T>::value)
    if (t == -Nyaan::inf) res = "-inf";
  if (sizeof(T) == 8) {
    if (t == Nyaan::infLL) res = "inf";
    if (is_signed<T>::value)
      if (t == -Nyaan::infLL) res = "-inf";
  }
  if (res.empty()) res = to_string(t);
  cerr << res;
}

template <typename T, typename U>
void dump(const pair<T, U>&);
template <typename T>
void dump(const pair<T*, int>&);

template <typename T>
void dump(const T& t,
          enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {
  cerr << "[ ";
  for (auto it = t.begin(); it != t.end();) {
    dump(*it);
    cerr << (++it == t.end() ? "" : ", ");
  }
  cerr << " ]";
}

template <typename T, typename U>
void dump(const pair<T, U>& t) {
  cerr << "( ";
  dump(t.first);
  cerr << ", ";
  dump(t.second);
  cerr << " )";
}

template <typename T>
void dump(const pair<T*, int>& t) {
  cerr << "[ ";
  for (int i = 0; i < t.second; i++) {
    dump(t.first[i]);
    cerr << (i == t.second - 1 ? "" : ", ");
  }
  cerr << " ]";
}

void trace() { cerr << endl; }
template <typename Head, typename... Tail>
void trace(Head&& head, Tail&&... tail) {
  cerr << " ";
  dump(head);
  if (sizeof...(tail) != 0) cerr << ",";
  trace(forward<Tail>(tail)...);
}

}  // namespace DebugImpl

#ifdef NyaanDebug
#define trc(...)                            \
  do {                                      \
    cerr << "## " << #__VA_ARGS__ << " = "; \
    DebugImpl::trace(__VA_ARGS__);          \
  } while (0)
#else
#define trc(...)
#endif

// macro
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define repc(i, a, cond) for (long long i = (a); (cond); i++)
#define enm(i, val, vec)                                  \
  for (long long i = 0; i < (long long)(vec).size(); i++) \
    if (auto& val = vec[i]; false)                        \
      ;                                                   \
    else

#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }

#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)

namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }

//
using namespace Nyaan;

// 全体的に有名題をただ面倒くさくしただけにしか見えない
// 特にこの問題はPairsそのまま

ll pairs(ll K, vl& a, vl& b) {
  // k個より少ない　ok 以上　ng
  ll ok = -1.1e18, ng = 1.1e18;
  while (ok + 1 < ng) {
    ll med = (ok + ng) / 2;
    // med以下である数の個数を数える
    ll cnt = 0;
    ll N = sz(a);
    each(x, b) {
      // 片方がa[i]
      if (x == 0) {
        if (med >= 0) cnt += N - 1;
      } else if (x > 0) {
        // med / a[i]以下の数の個数は？
        ll nya = med / x;
        if (med < 0 && med % x != 0) nya--;
        auto it = upper_bound(all(a), nya);
        // [ 0 , n)
        int n = it - begin(a);
        cnt += n;
      } else {
        // med / a[i]以上の数の個数は？
        ll nya = med / x;
        if (med < 0 && med % x != 0) nya++;
        auto it = lower_bound(all(a), nya);
        // [ n , N)
        int n = it - begin(a);
        cnt += N - n;
      }
    }
    trc(med, cnt);
    (K > cnt ? ok : ng) = med;
  }
  return ng;
}

void Nyaan::solve() {
  inl(K, L, M, N, S);
  vl a(K), b(L), c(M), d(N);
  in(a, b, c, d);

  vl e, f;
  each(x, a) each(y, b) e.push_back(x * y);
  each(x, c) each(y, d) f.push_back(x * y);
  sort(all(e));
  sort(all(f));
  auto ans = pairs(S, e, f);
  trc(ans);

  if (ans == 0) {
    vl bns(4, 0);
    if (find(all(a), 0) != a.end()) bns[0] = 0;
    if (find(all(b), 0) != b.end()) bns[1] = 0;
    if (find(all(c), 0) != c.end()) bns[2] = 0;
    if (find(all(d), 0) != d.end()) bns[3] = 0;
    out(ans);
    out(bns);
    return;
  }

  unordered_set<ll> st;
  each(x, d) st.insert(x);
  ll cur = ans;
  each(x, a) {
    if (x == 0 or cur % x != 0) continue;
    cur /= x;
    each(y, b) {
      if (y == 0 or cur % y != 0) continue;
      cur /= y;
      each(z, c) {
        if (z == 0 or cur % z != 0) continue;
        ll w = cur / z;
        if (st.find(w) != st.end()) {
          out(ans);
          out(x, y, z, w);
          return;
        }
      }
      cur *= y;
    }
    cur *= x;
  }
}

yukicoder

結果

テストケース

ソースコード