結果

問題 No.906 Y字グラフ
ユーザー btk
提出日時 2019-10-11 22:06:09
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 21,359 bytes
コンパイル時間 2,039 ms
コンパイル使用メモリ 196,296 KB
最終ジャッジ日時 2025-01-07 21:40:14
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 28
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:35:13: warning: #pragma once in main file
   35 | #    pragma once
      |             ^~~~

ソースコード

diff #
プレゼンテーションモードにする

// https://yukicoder.me/problems/no/906
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
# include "Template.hpp"
# include "num/ModInt.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto includes */
/* #region stl */
/*<stl>*/
# include <bits/stdc++.h>
# include <sys/types.h>
# include <unistd.h>
using namespace std;
/*</stl>*/
/* #endregion */
/* #region template/IncludeSTL.hpp*/
/**
* @file IncludeSTL.hpp
* @author btk
* @brief include
* @version 0.1
* @date 2019-07-21
* @todo 2includescript
* @copyright Copyright (c) 2019
*
*/
/*<head>*/
# pragma once
/*</head>*/
/*<stl>*/
# include <bits/stdc++.h>
# include <sys/types.h>
# include <unistd.h>
using namespace std;
/*</stl>*/
/* #endregion */
/* #region template/Macro.hpp*/
/**
* @file Macro.hpp
* @author btk
* @brief LL
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*
*/
//! LL
using LL = long long;
/**
* @def DEBUG
* @brief if if(0)
*/
/*</head>*/
# ifdef BTK
# define DEBUG if (1)
# else
# ifdef CIN_ONLY
# define FAST_IO
# endif
# define DEBUG if (0)
# endif
/**
* @def ALL(v)
* @brief
* ALL
*/
# define ALL(v) (v).begin(), (v).end()
/**
* @def REC(ret, ...)
* @brief
*
*/
# define REC(ret, ...) std::function<ret(__VA_ARGS__)>
/**
* @def VAR_NAME(var)
* @brief
*/
# define VAR_NAME(var) # var
/**
* @brief
* range使
*/
template <typename T>
inline T& unused_var(T& v) {
return v;
}
/* #endregion */
/* #region template/IO.hpp*/
/**
* @file IO.hpp
* @author btk
* @brief cin
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*/
/**
* @brief
*/
struct cww {
/**
* @brief Construct a new cww::cww object
* @details
* CIN_ONLYsubmitcinscanf
* DECIMAL_DIGITSdouble
*/
cww() {
# ifdef FAST_IO
ios::sync_with_stdio(false);
cin.tie(0);
# endif
# ifdef DECIMAL_DIGITS
cout << fixed;
cout << setprecision(DECIMAL_DIGITS);
# endif
}
};
//!
cww star;
/**
* @brief
* vectorcin
* @tparam T
* @param is
* @param v
* @return istream&
*/
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
for (auto& it : v) is >> it;
return is;
}
/* #endregion */
/* #region template/Loop.hpp*/
/**
* @file Loop.hpp
* @author btk
* @brief range
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*
*/
/**
* @brief
* range
* @details
* [bg,ed)
* @see range
*/
class reverse_range {
private:
struct I {
int x;
int operator*() { return x - 1; }
bool operator!=(I& lhs) { return x > lhs.x; }
void operator++() { --x; }
};
I i, n;
public:
/**
* @brief Construct a new reverse range object
*
* @param n
*/
reverse_range(int n) : i({0}), n({n}) {}
/**
* @brief Construct a new reverse range object
*
* @param i
* @param n
*/
reverse_range(int i, int n) : i({i}), n({n}) {}
/**
* @brief
* begin iterator
* @return I&
*/
I& begin() { return n; }
/**
* @brief
* end iterator
* @return I&
*/
I& end() { return i; }
};
/**
* @brief
* python range-based for
* @details
* [bg,ed)
* ! (reverse_range)
* O(1)
* 使unused_var使
*/
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I& lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
/**
* @brief Construct a new range object
*
* @param n
*/
range(int n) : i({0}), n({n}) {}
/**
* @brief Construct a new range object
*
* @param i
* @param n
*/
range(int i, int n) : i({i}), n({n}) {}
/**
* @brief
* begin iterator
* @return I&
*/
I& begin() { return i; }
/**
* @brief
* end iterator
* @return I&
*/
I& end() { return n; }
/**
* @brief
* range(reverse_ranges)
* @return reverse_range
*/
reverse_range operator!() { return reverse_range(*i, *n); }
};
/* #endregion */
/* #region template/MinMaxOperation.hpp*/
/**
* @file MinMaxOperation.hpp
* @author btk
* @brief
* @version 0.1
* @date 2019-07-04
*
* @copyright Copyright (c) 2019
*
*/
/**
* @brief 2
*
* @tparam T
*/
template <typename T>
struct min_op {
/**
* @brief
*
* @param l
* @param r
* @return T
*/
static T exec(const T l, const T r) { return l < r ? l : r; }
};
/**
* @brief 2
*
* @tparam T
*/
template <typename T>
struct max_op {
/**
* @brief
*
* @param l
* @param r
* @return T
*/
static T exec(const T l, const T r) { return l > r ? l : r; }
};
/**
* @brief
*
* @tparam F
* @tparam T
* @param v
* @return T
*/
template <typename F, typename T>
inline T multi_op(T&& v) {
return v;
}
/**
* @brief
*
* @tparam F
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename F, typename T, typename... Ts>
inline T multi_op(const T head, Ts&&... tail) {
return F::exec(head, multi_op<F>(tail...));
}
/**
* @brief
* @see multi_op
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename T, typename... Ts>
inline T multi_min(T&& head, Ts&&... tail) {
return multi_op<min_op<T>>(head, tail...);
}
/**
* @brief
* @see multi_op
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename T, typename... Ts>
inline T multi_max(T&& head, Ts&&... tail) {
return multi_op<max_op<T>>(head, tail...);
}
/**
* @brief
* ·F
* @tparam F
* @tparam T
* @tparam Ts
* @param target
* @param candidates
* @return true
* @return false
*/
template <typename F, typename T, typename... Ts>
inline bool ch_op(T& target, Ts&&... candidates) {
const T old = target;
target = multi_op<F>(target, candidates...);
return old != target;
}
/**
* @brief change min
* @tparam T
* @param target
* @param candidates
* @return true
*/
template <typename T, typename... Ts>
inline bool chmin(T& target, Ts&&... candidates) {
return ch_op<min_op<T>>(target, candidates...);
}
/**
* @brief chminmax
* @see chmin
* @tparam T
* @param target
* @param candidates
* @return true
*/
template <typename T, typename... Ts>
inline bool chmax(T& target, Ts&&... candidates) {
return ch_op<max_op<T>>(target, candidates...);
}
/* #endregion */
/* #region template/Random.hpp*/
/**
* @file Random.hpp
* @author btk
* @brief
* @version 0.1
* @date 2019-07-13
* @copyright Copyright (c) 2019
*/
//! ID
const pid_t pid = getpid();
/**
* @brief XorShift32
*/
class XorShift32 {
private:
//! XorShift
unsigned value;
/**
* @brief XorShift32 value
*/
inline void update() {
value = value ^ (value << 13);
value = value ^ (value >> 17);
value = value ^ (value << 5);
}
/**
* @brief
* @return unsigned value
*/
inline unsigned get() {
unsigned v = value;
update();
return v;
}
public:
/**
* @brief [0, 2^bit)
* @tparam 31
* @return int
*/
template <int bit = 31>
inline int next_int() {
return (int)(get() >> (32 - bit));
}
/**
* @brief [-2^bit,2^bit)
* @tparam 31
* @return int
*/
template <int bit = 31>
inline int next_signed() {
unsigned v = get();
return (int)((v >> (31 - bit)) - (1 << (bit)));
}
/**
* @brief next_int
* @tparam 31
* @return int
*/
template <int bit = 31>
inline int range_max() {
return (int)((1u << bit) - 1);
};
/**
* @brief Construct a new XorShift32 object
* @param seed
* @details valueXorShift32
*/
XorShift32(const unsigned seed) {
value = seed;
update();
}
/**
* @brief Construct a new XorShift 32 object
* @details IDXorShift32
*/
XorShift32() : XorShift32(pid) {}
};
/* #endregion */
/* #region Template.hpp*/
/**
* @file Template.hpp
* @brief
* @author btk15049
* @date 2019/05/02
*/
/* #endregion */
/* #region num/ModInt.hpp*/
# include <utility>
/**
* @file ModInt.hpp
* @brief mod
* @author btk15049
* @date 2019/03/08
* @details
* \todo verify
* verify: CSA12ERUPC day3 F
*/
//! [WARNING!] mod constexpr
# ifdef STATIC_MOD
constexpr int mod = STATIC_MOD;
# else
int mod;
# endif
/**
* @brief mod
* @details
* mod
*/
class ModInt {
private:
//!
int x;
public:
/**
* @brief
* @details "cout << *ret << endl;"
*/
long long operator*() const { return x; }
/**
* @brief 0
*/
ModInt() { x = 0; }
/**
* @brief int
* @param[in] y
* @details
* modmod
*/
ModInt(const int y) { x = y; }
/**
* @brief long long
* @param[in] y
* @details mod
*/
ModInt(const long long y) { x = (int)((mod + y % mod) % mod); }
/**
* @brief ModInt
* @param[in] o
* @details
*/
ModInt(const ModInt& o) { this->x = *o; }
/**
* @brief ModInt使
* @param[in] x
* @details x[0,mod)
*/
static inline ModInt raw(const long long x) {
// assert(x<mod);
return ModInt((int)x);
}
/**
* @brief ModInt使
* @param[in] x
* @details mod2OK
*/
static inline ModInt get(const long long x) { return ModInt(x); }
/**
* @brief int
* @param[in] o
* @details
* modmod
*/
ModInt& operator=(const int o) {
this->x = o >= mod ? o - mod : o;
return *this;
}
/**
* @brief long long
* @param[in] o
* @details mod2OK
*/
ModInt& operator=(const long long o) {
this->x = (int)((mod + o % mod) % mod);
return *this;
}
/**
* @brief ModInt
* @param[in] o
* @details
*/
ModInt& operator=(const ModInt o) {
this->x = *o;
return *this;
}
};
/**
* @param[in] l ModInt
* @param[in] r ModInt
* @details if使
*/
inline ModInt add(const ModInt l, const ModInt r) {
const long long x = *l + *r;
return ModInt::raw(x >= mod ? x - mod : x);
}
/**
* @param[in] l ModInt
* @param[in] r ModInt
*/
inline ModInt mul(const ModInt l, const ModInt r) {
return ModInt::raw(*l * *r % mod);
}
/**
* @brief a^x %mod
* @param[in] a ModInt
* @param[in] x long long
*/
inline ModInt pow(ModInt a, long long x) {
ModInt ret = ModInt::raw(1);
while (x) {
if (x & 1) {
ret = mul(ret, a);
}
a = mul(a, a);
x >>= 1;
}
return ret;
}
/**
* @brief x^-1 %mod
* @param[in] x ModInt
* @details
* 使
* O(log(mod))
*/
inline ModInt inv(const ModInt x) {
long long a = *x, b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return ModInt::get(u);
}
/**
* @brief
* @param[in] x ModInt
*/
inline ModInt operator-(const ModInt x) { return add(mod, -*x); }
/**
* @param[in] l ModInt
* @param[in] r ModInt
*/
inline ModInt operator+(const ModInt l, const ModInt r) { return add(l, r); }
/**
* @param[in] l ModInt
* @param[in] r ModInt
*/
inline ModInt operator*(const ModInt l, const ModInt r) { return mul(l, r); }
/**
* @param[in] l ModInt
* @param[in] r ModInt
*/
inline ModInt operator-(const ModInt l, const ModInt r) { return add(l, -r); }
/**
* @param[in] l ModInt
* @param[in] r int
* @details
* modraw使ModIntmod
*/
inline ModInt operator+(const ModInt l, const int r) {
return add(l, ModInt::raw(r));
}
/**
* @param[in] l ModInt
* @param[in] r int
*/
inline ModInt operator+(const ModInt l, const long long r) {
return add(l, ModInt::get(r));
}
/**
* @param[in] l ModInt
* @param[in] r int
* @details
* modraw使ModIntmod
*/
inline ModInt operator*(const ModInt l, const int r) {
return mul(l, ModInt::raw(r));
}
/**
* @param[in] l ModInt
* @param[in] r int
*/
inline ModInt operator*(const ModInt l, const long long r) {
return mul(l, ModInt::get(r));
}
/**
* @param[in] l ModInt
* @param[in] r int
* @details
* modraw使ModIntmod
*/
inline ModInt operator-(const ModInt l, const int r) {
return add(l, ModInt::raw(mod - r));
}
/**
* @param[in] l ModInt
* @param[in] r int
*/
inline ModInt operator-(const ModInt l, const long long r) {
return add(l, -ModInt::get(r));
}
/**
* @param[in] l ModInt
* @param[in] r int
* @details
* modraw使ModIntmod
*/
inline ModInt operator/(const ModInt l, const int r) {
return mul(l, inv(ModInt::raw(r)));
}
/**
* @param[in] l ModInt
* @param[in] r int
*/
inline ModInt operator/(const ModInt l, const long long r) {
return mul(l, inv(ModInt::get(r)));
}
/**
* @param[in] l ModInt
* @param[in] r long long
* @details
* pow(l,r)pow
O(log mod)
*/
inline ModInt operator^(const ModInt l, const long long r) { return pow(l, r); }
/**
* @brief
* +=operator+
* @tparam T
* @param l ModInt
* @param r
* @return ModInt&
*/
template <typename T>
ModInt& operator+=(ModInt& l, T r) {
l = l + r;
return l;
}
/**
* @brief
* -=operator-
* @tparam T
* @param l ModInt
* @param r
* @return ModInt&
*/
template <typename T>
ModInt& operator-=(ModInt& l, T r) {
l = l - r;
return l;
}
/**
* @brief
* *=operator*
* @tparam T
* @param l ModInt
* @param r
* @return ModInt&
*/
template <typename T>
ModInt& operator*=(ModInt& l, T r) {
l = l * r;
return l;
}
/**
* @namespace factorial
* @brief
* @details
* - combination
* - permutation
* - multiChoose
*/
namespace factorial {
//!
constexpr int size =
# ifdef FACTORIAL_SIZE
FACTORIAL_SIZE;
# else
3123456;
# endif
//!
bool is_build = false;
//!
ModInt factorial[size];
//! ()^-1
ModInt inverse_factorial[size];
/**
* @brief
* @details
* [0,size).
* O(size + log(mod))
*/
void build() {
is_build = true;
factorial[0] = 1;
for (int i = 1; i < size; i++) {
factorial[i] = factorial[i - 1] * i;
}
inverse_factorial[size - 1] = inv(factorial[size - 1]);
for (int i = size - 1; i >= 1; i--) {
inverse_factorial[i - 1] = inverse_factorial[i] * i;
}
}
/**
* @brief nPk
* @details
* O(1) is_build
*
*/
inline ModInt permutation(int n, int k) {
if (k < 0 || k > n) return ModInt::raw(0);
if (!is_build) build();
return factorial[n] * inverse_factorial[n - k];
}
/**
* @brief nCk
* @details
* O(1) is_build
*
*/
inline ModInt combination(int n, int k) {
if (k < 0 || k > n) return ModInt::raw(0);
if (!is_build) build();
return factorial[n] * inverse_factorial[k] * inverse_factorial[n - k];
}
/**
* @brief
* @param n
* @param r
* @return ModInt nHr
*/
ModInt multiChoose(int n, int r) {
if (n == 0 && r == 0) return ModInt::raw(1);
return combination(n + r - 1, r);
}
/**
* @brief
* @details
* lim1,2,...,i
* O(min(n, r / lim))
* @param n
* @param r
* @param lim 1
* @return ModInt
*/
ModInt multiChoose(int n, int r, int lim) {
ModInt ret = 0;
for (int i = 0; i <= n; i++) {
if (i * (lim + 1) > r) break;
ret += ((i & 1) ? mod - 1 : 1) * combination(n, i)
* multiChoose(n, r - i * (lim + 1));
}
return ret;
}
} // namespace factorial
/* #endregion */
/* #endregion */
/*</body>*/
#endif
int main() {
/* write here */
LL N;
cin >> N;
N--;
ModInt n = N;
// (n+2)! / (2! * n!)
ModInt all = ((n + 2) * (n + 1)) / 2;
all -= 3; // 20
all -= (n - 1) * 3; // 10
ModInt one = 0, two = 0, tri = 0;
if (N % 3 == 0) {
tri = 1;
}
cerr << *all << endl;
all -= tri;
two = (N - 1) / 2;
if (*tri == 1) two = two - 1;
all -= two * 3;
one = all / 6;
cerr << *one << " " << *two << " " << *tri << endl;
cout << *(one + two + tri) << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0