結果
問題 | No.906 Y字グラフ |
ユーザー | maroon_kuri |
提出日時 | 2019-10-11 21:37:07 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 10 ms / 2,000 ms |
コード長 | 5,050 bytes |
コンパイル時間 | 1,842 ms |
コンパイル使用メモリ | 173,840 KB |
実行使用メモリ | 28,232 KB |
最終ジャッジ日時 | 2024-11-25 06:57:41 |
合計ジャッジ時間 | 3,076 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
27,972 KB |
testcase_01 | AC | 9 ms
28,228 KB |
testcase_02 | AC | 9 ms
28,104 KB |
testcase_03 | AC | 9 ms
28,100 KB |
testcase_04 | AC | 9 ms
28,104 KB |
testcase_05 | AC | 9 ms
27,972 KB |
testcase_06 | AC | 8 ms
27,972 KB |
testcase_07 | AC | 9 ms
28,096 KB |
testcase_08 | AC | 8 ms
28,096 KB |
testcase_09 | AC | 10 ms
27,968 KB |
testcase_10 | AC | 9 ms
28,096 KB |
testcase_11 | AC | 9 ms
28,104 KB |
testcase_12 | AC | 9 ms
28,100 KB |
testcase_13 | AC | 9 ms
27,972 KB |
testcase_14 | AC | 9 ms
27,976 KB |
testcase_15 | AC | 9 ms
27,976 KB |
testcase_16 | AC | 9 ms
28,096 KB |
testcase_17 | AC | 9 ms
27,972 KB |
testcase_18 | AC | 10 ms
27,976 KB |
testcase_19 | AC | 10 ms
27,968 KB |
testcase_20 | AC | 9 ms
27,976 KB |
testcase_21 | AC | 10 ms
27,972 KB |
testcase_22 | AC | 9 ms
27,972 KB |
testcase_23 | AC | 9 ms
27,972 KB |
testcase_24 | AC | 10 ms
28,100 KB |
testcase_25 | AC | 9 ms
27,972 KB |
testcase_26 | AC | 9 ms
27,968 KB |
testcase_27 | AC | 9 ms
28,232 KB |
testcase_28 | AC | 9 ms
27,972 KB |
testcase_29 | AC | 9 ms
28,100 KB |
testcase_30 | AC | 9 ms
27,968 KB |
testcase_31 | AC | 9 ms
27,972 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll=long long;#define int ll#define rng(i,a,b) for(int i=int(a);i<int(b);i++)#define rep(i,b) rng(i,0,b)#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)#define per(i,b) gnr(i,0,b)#define pb push_back#define eb emplace_back#define a first#define b second#define bg begin()#define ed end()#define all(x) x.bg,x.ed#ifdef LOCAL#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl#else#define dmp(x) void(0)#endiftemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}template<class t> using vc=vector<t>;template<class t> using vvc=vc<vc<t>>;using pi=pair<int,int>;using vi=vc<int>;template<class t,class u>ostream& operator<<(ostream& os,const pair<t,u>& p){return os<<"{"<<p.a<<","<<p.b<<"}";}template<class t> ostream& operator<<(ostream& os,const vc<t>& v){os<<"{";for(auto e:v)os<<e<<",";return os<<"}";}#define mp make_pair#define mt make_tuple#define one(x) memset(x,-1,sizeof(x))#define zero(x) memset(x,0,sizeof(x))using uint=unsigned;using ull=unsigned long long;template<int i,class T>void print_tuple(ostream&,const T&){}template<int i,class T,class H,class ...Args>void print_tuple(ostream&os,const T&t){if(i)os<<",";os<<get<i>(t);print_tuple<i+1,T,Args...>(os,t);}template<class ...Args>ostream& operator<<(ostream&os,const tuple<Args...>&t){os<<"{";print_tuple<0,tuple<Args...>,Args...>(os,t);return os<<"}";}void print(ll x,int suc=1){cout<<x;if(suc==1)cout<<"\n";if(suc==2)cout<<" ";}ll read(){ll i;cin>>i;return i;}vi readvi(int n,int off=0){vi v(n);rep(i,n)v[i]=read()+off;return v;}template<class T>void print(const vector<T>&v,int suc=1){rep(i,v.size())print(v[i],i==int(v.size())-1?suc:2);}string readString(){string s;cin>>s;return s;}template<class T>T sq(const T& t){return t*t;}//#define CAPITALvoid yes(bool ex=true){#ifdef CAPITALcout<<"YES"<<endl;#elsecout<<"Yes"<<endl;#endifif(ex)exit(0);}void no(bool ex=true){#ifdef CAPITALcout<<"NO"<<endl;#elsecout<<"No"<<endl;#endifif(ex)exit(0);}constexpr ll ten(int n){return n==0?1:ten(n-1)*10;}const ll infLL=LLONG_MAX/3;#ifdef intconst int inf=infLL;#elseconst int inf=INT_MAX/2-100;#endifint topbit(signed t){return t==0?-1:31-__builtin_clz(t);}int topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}int botbit(signed a){return a==0?32:__builtin_ctz(a);}int botbit(ll a){return a==0?64:__builtin_ctzll(a);}int popcount(signed t){return __builtin_popcount(t);}int popcount(ll t){return __builtin_popcountll(t);}bool ispow2(int i){return i&&(i&-i)==i;}int mask(int i){return (int(1)<<i)-1;}bool inc(int a,int b,int c){return a<=b&&b<=c;}template<class t> void mkuni(vc<t>&v){sort(all(v));v.erase(unique(all(v)),v.ed);}ll rand_int(ll l, ll r) { //[l, r]#ifdef LOCALstatic mt19937_64 gen;#elsestatic random_device rd;static mt19937_64 gen(rd());#endifreturn uniform_int_distribution<ll>(l, r)(gen);}using uint=unsigned;using ull=unsigned long long;//const uint mod=998244353;const uint mod=1000000007;//uint mod=1;struct mint{uint v;mint(ll vv=0){s(vv%mod+mod);}mint& s(uint vv){v=vv<mod?vv:vv-mod;return *this;}mint operator-()const{return mint()-*this;}mint& operator+=(const mint&rhs){return s(v+rhs.v);}mint&operator-=(const mint&rhs){return s(v+mod-rhs.v);}mint&operator*=(const mint&rhs){v=ull(v)*rhs.v%mod;return *this;}mint&operator/=(const mint&rhs){return *this*=rhs.inv();}mint operator+(const mint&rhs)const{return mint(*this)+=rhs;}mint operator-(const mint&rhs)const{return mint(*this)-=rhs;}mint operator*(const mint&rhs)const{return mint(*this)*=rhs;}mint operator/(const mint&rhs)const{return mint(*this)/=rhs;}mint pow(int n)const{mint res(1),x(*this);while(n){if(n&1)res*=x;x*=x;n>>=1;}return res;}mint inv()const{return pow(mod-2);}/*mint inv()const{int x,y;int g=extgcd(v,mod,x,y);assert(g==1);if(x<0)x+=mod;return mint(x);}*/friend ostream& operator<<(ostream&os,const mint&m){return os<<m.v;}bool operator<(const mint&r)const{return v<r.v;}bool operator==(const mint&r)const{return v==r.v;}};const int vmax=(1<<21)+10;mint fact[vmax],finv[vmax],invs[vmax];void initfact(){fact[0]=1;rng(i,1,vmax){fact[i]=fact[i-1]*i;}finv[vmax-1]=fact[vmax-1].inv();for(int i=vmax-2;i>=0;i--){finv[i]=finv[i+1]*(i+1);}for(int i=vmax-1;i>=1;i--){invs[i]=finv[i]*fact[i-1];}}mint choose(int n,int k){return fact[n]*finv[n-k]*finv[k];}mint binom(int a,int b){return fact[a+b]*finv[a]*finv[b];}mint catalan(int n){return binom(n,n)-(n-1>=0?binom(n-1,n+1):0);}signed main(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);int n;cin>>n;n-=4;mint ans=mint(n+2)*(n+1)/2;ans+=mint(n/2+1)*3;if(n%3==0)ans+=2;cout<<ans/6<<endl;}