Contest Duration: ~ (local time) (120 minutes)

Submission #1986767

Source Code Expand

Copy
```#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;

#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double;  using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }

inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; } // これを使うならば、tieとかを消して！！
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U, typename V>  ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size())  rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << "    " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl;  } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40)

#define EPS (double)1e-14
#define INF (ll)1e18
#define mo  (ll)(1e9+7)

ll e[1010][110] = {};
ll solve(vll& a, ll bmax) {
ll n = a.size();

vll x;
map<ll, ll> freq;
rep(i, n) {
freq[a[i]]++;
}
for (auto y : freq) {
x.pb(y.se);
}

ll s = x.size();
//    cout << x << endl;
ll d[110][1010] = {};
d[0][0] = 1;
repi(i, 1, s+1) {
rep(j, bmax+1) {
rep(k, j+1) {
if (j-k>=0)
d[i][j] += d[i-1][j-k] * e[k][x[i-1]];
d[i][j] %= mo;
}
}
}
return d[s][bmax];
}
int main(void) {
ll n, m; cin >> n >> m;
vll a(n), b(m); cin >> a >> b;

e[0][0] = 1;
rep(i, 1010) rep(j, 110) if (i || j) {
if (j-1>=0) {
e[i][j] += e[i][j-1];
}
if (i-j>=0) {
e[i][j] += e[i-j][j];
}
e[i][j] %= mo;
}
/*
rep(i, 12) repi(j, i, 12) repi(h, j, 12) {
if (i + j + h == 9) cout << mt(i,j,h) << endl;
}
rep(i, 10) {
rep(j, 10) {
cout << mt(i,j) << e[i][j]<<endl;
}
}
*/

cout << solve(a, accumulate(all(b), 0ll)) * solve(b, accumulate(all(a), 0ll)) % mo << endl;

return 0;
}
```

#### Submission Info

Submission Time 2018-01-17 11:25:12+0900 C - Kill/Death hamko C++14 (GCC 5.4.1) 500 6658 Byte AC 127 ms 2044 KB

#### Compile Error

```./Main.cpp: In function ‘void vizGraph(vvll&, int, std::string)’:
./Main.cpp:41:478: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size())  rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << "    " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl;  } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
...```

#### Judge Result

Set Name Score / Max Score Test Cases
All 500 / 500 01_sample00, 01_sample01, 01_sample02, 01_sample03, 01_sample04, 02_minimal00, 02_minimal01, 02_minimal02, 02_minimal03, 03_maximal00, 03_maximal01, 04_random-easy00, 04_random-easy01, 04_random-easy02, 04_random-easy03, 04_random-easy04, 04_random-easy05, 04_random-easy06, 04_random-easy07, 04_random-easy08, 04_random-easy09, 04_random-easy10, 04_random-easy11, 04_random-easy12, 04_random-easy13, 04_random-easy14, 04_random-easy15, 04_random-easy16, 04_random-easy17, 04_random-easy18, 04_random-easy19, 05_random-large00, 05_random-large01, 05_random-large02, 05_random-large03, 05_random-large04, 05_random-large05, 05_random-large06, 05_random-large07, 05_random-large08, 05_random-large09, 05_random-large10, 05_random-large11, 05_random-large12, 05_random-large13, 05_random-large14, 05_random-large15, 05_random-large16, 05_random-large17, 05_random-large18, 05_random-large19, 06_random00, 06_random01, 06_random02, 06_random03, 06_random04, 06_random05, 06_random06, 06_random07, 06_random08, 06_random09, 06_random10, 06_random11, 06_random12, 06_random13, 06_random14, 06_random15, 06_random16, 06_random17, 06_random18, 06_random19
Case Name Status Exec Time Memory
01_sample00 3 ms 2044 KB
01_sample01 3 ms 2044 KB
01_sample02 3 ms 2044 KB
01_sample03 3 ms 2044 KB
01_sample04 4 ms 2044 KB
02_minimal00 3 ms 2044 KB
02_minimal01 5 ms 2044 KB
02_minimal02 5 ms 2044 KB
02_minimal03 7 ms 2044 KB
03_maximal00 11 ms 2044 KB
03_maximal01 7 ms 2044 KB
04_random-easy00 3 ms 2044 KB
04_random-easy01 3 ms 2044 KB
04_random-easy02 3 ms 2044 KB
04_random-easy03 3 ms 2044 KB
04_random-easy04 3 ms 2044 KB
04_random-easy05 3 ms 2044 KB
04_random-easy06 3 ms 2044 KB
04_random-easy07 3 ms 2044 KB
04_random-easy08 3 ms 2044 KB
04_random-easy09 3 ms 2044 KB
04_random-easy10 3 ms 2044 KB
04_random-easy11 3 ms 2044 KB
04_random-easy12 3 ms 2044 KB
04_random-easy13 3 ms 2044 KB
04_random-easy14 3 ms 2044 KB
04_random-easy15 3 ms 2044 KB
04_random-easy16 3 ms 2044 KB
04_random-easy17 3 ms 2044 KB
04_random-easy18 3 ms 2044 KB
04_random-easy19 3 ms 2044 KB
05_random-large00 105 ms 2044 KB
05_random-large01 127 ms 2044 KB
05_random-large02 115 ms 2044 KB
05_random-large03 106 ms 2044 KB
05_random-large04 109 ms 2044 KB
05_random-large05 116 ms 2044 KB
05_random-large06 115 ms 2044 KB
05_random-large07 113 ms 2044 KB
05_random-large08 109 ms 2044 KB
05_random-large09 106 ms 2044 KB
05_random-large10 108 ms 2044 KB
05_random-large11 110 ms 2044 KB
05_random-large12 114 ms 2044 KB
05_random-large13 117 ms 2044 KB
05_random-large14 114 ms 2044 KB
05_random-large15 98 ms 2044 KB
05_random-large16 113 ms 2044 KB
05_random-large17 118 ms 2044 KB
05_random-large18 114 ms 2044 KB
05_random-large19 106 ms 2044 KB
06_random00 52 ms 2044 KB
06_random01 4 ms 2044 KB
06_random02 6 ms 2044 KB
06_random03 65 ms 2044 KB
06_random04 24 ms 2044 KB
06_random05 30 ms 2044 KB
06_random06 11 ms 2044 KB
06_random07 21 ms 2044 KB
06_random08 12 ms 2044 KB
06_random09 62 ms 2044 KB
06_random10 6 ms 2044 KB
06_random11 20 ms 2044 KB
06_random12 63 ms 2044 KB
06_random13 17 ms 2044 KB
06_random14 20 ms 2044 KB
06_random15 3 ms 2044 KB
06_random16 35 ms 2044 KB
06_random17 23 ms 2044 KB
06_random18 11 ms 2044 KB
06_random19 15 ms 2044 KB