結果

問題 No.906 Y字グラフ
ユーザー a
提出日時 2019-10-11 22:07:51
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,086 bytes
コンパイル時間 1,580 ms
コンパイル使用メモリ 169,252 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-25 07:35:27
合計ジャッジ時間 2,271 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

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

#include "bits/stdc++.h"
using namespace std;
//------------------------------- Libraries --------------------------------//
template <int p>
struct Modint
{
int value;
Modint() : value(0) {}
Modint(long x) : value(x >= 0 ? x % p : (p + x % p) % p) {}
inline Modint &operator+=(const Modint &b)
{
if ((this->value += b.value) >= p)
this->value -= p;
return (*this);
}
inline Modint &operator-=(const Modint &b)
{
if ((this->value += p - b.value) >= p)
this->value -= p;
return (*this);
}
inline Modint &operator*=(const Modint &b)
{
this->value = (int)((1LL * this->value * b.value) % p);
return (*this);
}
inline Modint &operator/=(const Modint &b)
{
(*this) *= b.inverse();
return (*this);
}
Modint operator+(const Modint &b) const { return Modint(*this) += b; }
Modint operator-(const Modint &b) const { return Modint(*this) -= b; }
Modint operator*(const Modint &b) const { return Modint(*this) *= b; }
Modint operator/(const Modint &b) const { return Modint(*this) /= b; }
inline Modint &operator++(int) { return (*this) += 1; }
inline Modint &operator--(int) { return (*this) -= 1; }
inline bool operator==(const Modint &b) const
{
return this->value == b.value;
}
inline bool operator!=(const Modint &b) const
{
return this->value != b.value;
}
inline bool operator<(const Modint &b) const
{
return this->value < b.value;
}
inline bool operator<=(const Modint &b) const
{
return this->value <= b.value;
}
inline bool operator>(const Modint &b) const
{
return this->value > b.value;
}
inline bool operator>=(const Modint &b) const
{
return this->value >= b.value;
}
// requires that "this->value and p are co-prime"
// a_i * v + a_(i+1) * p = r_i
// r_i = r_(i+1) * q_(i+1) * r_(i+2)
// q == 1 (i > 1)
// reference: https://atcoder.jp/contests/agc026/submissions/2845729
// (line:93)
inline Modint inverse() const
{
assert(this->value != 0);
int r0 = p, r1 = this->value, a0 = 0, a1 = 1;
while (r1)
{
int q = r0 / r1;
r0 -= q * r1;
swap(r0, r1);
a0 -= q * a1;
swap(a0, a1);
}
return Modint(a0);
}
friend istream &operator>>(istream &is, Modint<p> &a)
{
long t;
is >> t;
a = Modint<p>(t);
return is;
}
friend ostream &operator<<(ostream &os, const Modint<p> &a)
{
return os << a.value;
}
};
/*
verified @ https://atcoder.jp/contests/abc034/submissions/4316971
*/
const int MOD = 1e9 + 7;
using Int = Modint<MOD>;
//------------------------------- Type Names -------------------------------//
using i64 = int_fast64_t;
using seika = string;
//akari : 1D, yukari : 2D, maki : 3D vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//akane : ascending order, aoi : decending order
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;
//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
cout << first << ' ';
print(rest...);
}
//------------------------------- Solver ------------------------------------//
void solve()
{
i64 n;
cin >> n;
Int tmp = Int(n - 2) * Int(n - 3) / Int(2), ans;
ans += Int((n - 2) / 2) - Int((n - 1) % 3 == 0);
tmp -= ans * 3;
if ((n - 1) % 3 == 0)
{
ans++;
tmp--;
}
tmp /= 6;
ans += tmp;
cout << ans << endl;
}
int main()
{
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0