Submission #1518169
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll C(ll n, ll r){ ll p=1; for(ll i=1;i<=r;i++){ p=p*(n-i+1)/i; } return p; } int main(){ ll a[100010]; ll N; ll dabu=100000000; cin>>N; ll cnt=0, cnt2=0; for(ll i=0;i<N+1;i++){ cin>>a[i]; if(dabu<=100010) cnt++; for(ll j=0;j<i;j++){ if(a[j]==a[i]){ dabu=a[i]; } } } for(ll i=0;i<N+1;i++){ if(dabu==a[i]) break; cnt2++; } //cout<<cnt2<<":"<<cnt<<endl; cout<<N<<endl; for(ll i=2;i<=N+1;i++){ ll res=C(N+1, i); if(i-1<=cnt+cnt2) res-=C(cnt+cnt2, i-1); /*if(cnt>=1){ res-=C(cnt+1, i); } if(cnt2>=1){ res-=C(cnt2+1, i); }*/ cout<<res%1000000007<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 11 |
User | agony |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1251 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 896 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 | TLE | 2103 ms | 896 KB |
mx.txt | TLE | 2103 ms | 896 KB |
rnd_0.txt | TLE | 2103 ms | 896 KB |
rnd_1.txt | TLE | 2103 ms | 896 KB |
rnd_2.txt | TLE | 2103 ms | 512 KB |
rnd_3.txt | TLE | 2103 ms | 512 KB |
rnd_4.txt | TLE | 2103 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |