Submission #3621215

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (a * b) % mod
#define rollcall cout << "I'm Sucu." << endl;
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define fi first
#define se second
// debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
  os << "(" << p.first << "," << p.second << ")";return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for (auto it = v.begin();it != v.end();++it){
    if(it != v.begin())os << " ";os << *it;
      }return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp){
  for(auto x: mp)os << "(" << x.first << "," << x.second << ")" << endl;
  return os;
}
template<typename T, int SIZE>
int array_length(const T (&)[SIZE]){return SIZE;}
template<typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){
	if(t == -1){rep(i,s){if(i)cout << " ";cout << a[i];}}
	else repi(i,s,t){if(i!=s)cout << " ";cout << a[i];}
	if(f)cout << "\n";
}
template<typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){
	rep(i,h){rep(j,w){cout << a[i][j] << " \n"[j==w-1];}}
}
// typedef
typedef complex<double> Point;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;


const int mod = 1e9+7, MAX = 3000;
int q[MAX][MAX], p[MAX];

// 前処理
void init(){
	repi(i,1,MAX)q[i][1] = 1;
	p[0] = p[1] = 1;
	repi(i,2,MAX){
		p[i] = 1;
		repi(j,2,MAX){
			if(i < j)break;
			q[i][j] = (q[i-1][j-1]+q[i-j][j])%mod;
			p[i] = (p[i]+q[i][j])%mod;
		}	
	}
}

int dp[200][2000];
int solve(vector<int> a, vector<int> b){
  vector<int> c;c.pb(1);
  repi(i,1,a.size()){
    if(a[i] == a[i-1])c[c.size()-1]++;
    else c.pb(1);
  }
  int n = c.size(), m = b.size();
  fill((int*)dp, (int*)(dp+200), 0);
  int sum = 0;
  rep(i,m)sum += b[i];
  
  rep(j,sum+1)ADD(dp[0][j], q[j+c[0]][c[0]]);
  repi(i,1,n)rep(j,sum+1){
    rep(k,j+1){
      ADD(dp[i][j], dp[i-1][j-k]*q[k+c[i]][c[i]]);
    }
  }
  return dp[n-1][sum];
}

signed main(){
  int n, m;
  init();
  scanf("%lld%lld", &n, &m);
  vector<int> a(n), b(m);
  rep(i,n)cin >> a[i];
  rep(i,m)cin >> b[i];
  cout << solve(a, b)*solve(b, a) % mod << endl;
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:104:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &n, &m);
                            ^

Judge Result