結果

問題 No.584 赤、緑、青の色塗り
ユーザー koyumeishikoyumeishi
提出日時 2017-10-28 02:10:31
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 116 ms / 2,000 ms
コード長 4,854 bytes
コンパイル時間 949 ms
コンパイル使用メモリ 106,004 KB
実行使用メモリ 143,960 KB
最終ジャッジ日時 2024-05-01 18:27:04
合計ジャッジ時間 3,839 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 103 ms
143,828 KB
testcase_01 AC 104 ms
143,960 KB
testcase_02 AC 104 ms
143,700 KB
testcase_03 AC 103 ms
143,700 KB
testcase_04 AC 104 ms
143,828 KB
testcase_05 AC 103 ms
143,704 KB
testcase_06 AC 105 ms
143,828 KB
testcase_07 AC 105 ms
143,952 KB
testcase_08 AC 103 ms
143,828 KB
testcase_09 AC 103 ms
143,956 KB
testcase_10 AC 103 ms
143,828 KB
testcase_11 AC 103 ms
143,828 KB
testcase_12 AC 102 ms
143,956 KB
testcase_13 AC 103 ms
143,572 KB
testcase_14 AC 103 ms
143,828 KB
testcase_15 AC 105 ms
143,956 KB
testcase_16 AC 104 ms
143,832 KB
testcase_17 AC 103 ms
143,956 KB
testcase_18 AC 106 ms
143,832 KB
testcase_19 AC 116 ms
143,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

long long cmb[3003][3003];
long long cmb_sum[3003][3003];

int main(){
  int n;
  cin >> n;
  vector<int> a(3);
  cin >> a;

  cmb[0][0] = 1;
  for(int i=1; i<=3000; i++){
    for(int j=0; j<=i; j++){
      cmb[i][j] = cmb[i-1][j];
      if(j) cmb[i][j] += cmb[i-1][j-1];
      if(cmb[i][j] >= mod) cmb[i][j] %= mod;
    }
  }
  for(int i=0; i<=3000; i++){
    for(int j=0; j<=3000; j++){
      cmb_sum[i][j] = cmb[i][j];
      if(j) cmb_sum[i][j] += cmb_sum[i][j-1];
      if(cmb_sum[i][j] >= mod) cmb_sum[i][j] %= mod;
    }
  }

  long long ans = 0;
  for(int two=0; two*3-1 <= n; two++){
    for(int r_=0; r_<=a[0]; r_++){
      int gb = two - r_;
      if( gb < 0) continue;
      if( gb > a[1] || gb > a[2] ) continue;
      int gb_solo = a[1]+a[2] - gb*2 - r_;
      if(gb_solo < 0) continue;
      int r_solo = a[0] - r_;

      int len = two * 3 + (gb_solo+r_solo) * 2;
      if(len-1 > n) continue;
      int emp = n+1 - len;

      long long k = r_+gb + gb_solo + r_solo + emp;

      int g_ = a[1] - gb;
      int b_ = a[2] - gb;

      long long low = max(0, g_-gb_solo);
      long long high= min(r_, g_);
      long long tmp = cmb[k][r_];
      k -= r_;
      (tmp *= cmb[k][gb]) %= mod;
      k -= gb;
      (tmp *= cmb[k][gb_solo]) %= mod;
      k -= gb_solo;
      (tmp *= cmb[k][r_solo]) %= mod;
      k -= r_solo;

      tmp *= my_pow_mod(2, two, mod);
      tmp %= mod;
      tmp *= cmb[gb_solo+r_][g_];
      tmp %= mod;
      (ans += tmp) %= mod;
    }
  }

  println(ans);
  return 0;
}
0