結果

問題 No.520 プロジェクトオイラーへの招待
ユーザー しらっ亭しらっ亭
提出日時 2017-05-29 01:32:52
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 125 ms / 4,000 ms
コード長 7,079 bytes
コンパイル時間 1,669 ms
コンパイル使用メモリ 170,148 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-21 16:07:56
合計ジャッジ時間 2,266 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 39 ms
5,376 KB
testcase_04 AC 44 ms
5,376 KB
testcase_05 AC 125 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second

#define _TMPL_OVERLOAD(_1,_2,name,...) name
#define _TMPL1(T) template<class T>
#define _TMPL2(T,U) template<class T,class U>
#define TMPL(...) _TMPL_OVERLOAD(__VA_ARGS__,_TMPL2,_TMPL1)(__VA_ARGS__)
string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
TMPL(T)ostream&operator<<(ostream&os,vector<T>v);
TMPL(T)ostream&operator<<(ostream&os,set<T>v);
TMPL(T)ostream&operator<<(ostream&os,queue<T>q);
TMPL(T)ostream&operator<<(ostream&os,priority_queue<T>q);
TMPL(T,K)ostream&operator<<(ostream&os,pair<T,K>p);
TMPL(T,K)ostream&operator<<(ostream&os,map<T,K>mp);
TMPL(T,K)ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
TMPL(T,K)void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
TMPL(...Ts)ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
TMPL(T,K)ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
TMPL(T)ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
TMPL(T)ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
TMPL(T)ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
TMPL(T)ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
TMPL(T,K)ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
TMPL(T,K)ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

TMPL(T,K)istream&operator>>(istream&is,pair<T,K>&p){is>>p.fst;is>>p.snd;return is;}
TMPL(T)istream&operator>>(istream&is,vector<T>&v){forr(e,v)is>>e;return is;}
#define rea(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
TMPL(T)void MACRO_VAR_Scan(T&t){cin>>t;}
TMPL(H,...Ts)void MACRO_VAR_Scan(H&h,Ts&...ts) {cin>>h;MACRO_VAR_Scan(ts...);}
#define rea_vecs(type,n,...)vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n,__VA_ARGS__);rep(i,n)MACRO_VEC_ROW_Scan(i,__VA_ARGS__);
TMPL(T)void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
TMPL(H,...Ts)void MACRO_VEC_ROW_Init(int n,H&h,Ts&...ts){h.resize(n);MACRO_VEC_ROW_Init(n,ts...);}
TMPL(T)void MACRO_VEC_ROW_Scan(int p,T&t){cin>>t[p];}
TMPL(H,...Ts)void MACRO_VEC_ROW_Scan(int p,H&h,Ts&...ts){cin>>h[p];MACRO_VEC_ROW_Scan(p,ts...);}
#define rea_vec(type,n,c) vector<type>c(n);cin>>c;

//#define int long long  // consider risk of MLE
using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class T>bool amax(T&a,T&b){return a<b?a=b,1:0;}
template<class T>bool amin(T&a,T&b){return a>b?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}
template<class T>T read(){T t;cin>>t;return t;}

const int mod = 1e9+7;

template<int MOD>
struct Mint {
  int x;
  Mint() : x(0) {}
  Mint(int y) : x(y >= 0 ? y % MOD : MOD - (-y) % MOD) {}
  Mint(signed long long sll) : x(sll % MOD) { if (x < 0) x += MOD; }
  Mint &operator+=(const Mint &rhs){ if((x += rhs.x) >= MOD) x -= MOD; return *this; }
  Mint &operator-=(const Mint &rhs){ if((x += MOD - rhs.x) >= MOD) x -= MOD; return *this; }
  Mint &operator*=(const Mint &rhs){ x = 1LL*x*rhs.x % MOD; return *this; }
  Mint &operator/=(const Mint &rhs){ x = (1LL*x*rhs.inv().x) % MOD; return *this; }
  Mint operator-() const { return Mint(-x); }
  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; }
  bool operator<(const Mint &rhs) const { return x < rhs.x; }
  Mint inv() const {
    signed a = x, b = MOD, u = 1, v = 0, t;
    while(b){ t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); }
    return Mint(u);
  }
  Mint operator^(unsigned long long t) const {
    Mint e = *this, res = 1;
    for(; t; e *= e, t>>=1) if (t & 1) res *= e;
    return res;
  }
};
template<int MOD> ostream &operator<<(ostream &os, const Mint<MOD> &rhs) { return os << rhs.x; }
template<int MOD> istream &operator>>(istream &is, Mint<MOD> &rhs) { long long s; is >> s; rhs = Mint<MOD>(s); return is; };

using mint = Mint<mod>;
using vm=vector<mint>;using vvm=vector<vm>;using vvvm=vector<vvm>;

bool dped[222][222];
mint dp[222][222];

mint calc(int a, int b) {
  if (a==1 || b==1) return 1;

  if (dped[a][b]) return dp[a][b];

  dped[a][b] = 1;
  // ここ、なんでこうなるのか理解してない
  return dp[a][b] = calc(a-1, b) + calc(a, b-1);
}

mint solve() {
  rea(int, a, b, c);

  mint ret = 0;

  // ここも、なんでこうなるのか理解してない
  ret += calc(a, b + c + 1);
  ret += calc(b, c + a + 1);
  ret += calc(c, a + b + 1);

  rep(i, a) rep(j, b) rep(k, c) {
    ret += calc(i+1, c-k) * calc(j+1, a-i) * calc(k+1, b-j);
  }

  return ret;
}

void Main() {
  cout << solve() << endl;
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int T;cin>>T;
  while (T--) Main();
  return 0;
}
0