Submission #1687627
Source Code Expand
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<tuple>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define tii tuple<int,int>
#define tiii tuple<int,int,int>
#define mt make_tuple
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
#define DIV int(1e9+7)
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
class FermatCombination{
public:
vector<ll> factrial; // 階乗
vector<ll> inverse; // 逆元
FermatCombination(int size){
factrial.resize(size+1);
inverse.resize(size+1);
factrial[0] = 1;
inverse[0] = 1;
for(int i = 1; i < size+1; i++){
factrial[i] = factrial[i-1] * i % DIV;
inverse[i] = pow(factrial[i],DIV-2,DIV);
}
}
ll combination(int n, int k){
if(n < k) return 0;
return factrial[n]* inverse[k] % DIV * inverse[n - k] % DIV;
}
ll permutation(int n, int k){
if(n < k) return 0;
return factrial[n] * inverse[n-k] % DIV;
}
// 1-nまでの整数から重複を許しn個選ぶパターンの数
ll multi_choose(int n, int k){
if(n == 0 && k == 0) return 1;
else return combination(n+k-1,k);
}
};
int main(){
FermatCombination fc(1000);
int n; cin >> n;
int l = 0,r = 0;
map<int,int> m;
rep(i,n+1){
int in; cin >> in;
if(!r && m[in] != 0){
r = i+1;
l = m[in];
continue;
}else{
m[in] = i+1;
}
}
for(int k = 1; k <= n+1; k++){
ll ans = DIV+fc.combination(n+1,k);
int c = n-r+l;
ans -= fc.combination(c,k-1);
cout << ans%DIV << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
D - 11 |
User |
cashisu1 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2289 Byte |
Status |
WA |
Exec Time |
222 ms |
Memory |
5888 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample1.txt, sample2.txt, sample3.txt |
All |
1.txt, mx.txt, rnd_0.txt, rnd_1.txt, rnd_2.txt, rnd_3.txt, rnd_4.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name |
Status |
Exec Time |
Memory |
1.txt |
WA |
211 ms |
5888 KB |
mx.txt |
WA |
222 ms |
5632 KB |
rnd_0.txt |
WA |
179 ms |
4736 KB |
rnd_1.txt |
WA |
152 ms |
4096 KB |
rnd_2.txt |
WA |
42 ms |
1408 KB |
rnd_3.txt |
WA |
36 ms |
1152 KB |
rnd_4.txt |
WA |
65 ms |
1920 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |