Submission #1687487
Source Code Expand
#include <bits/stdc++.h> #define fr first #define sc second #define OK puts("OK"); #define pb push_back #define mk make_pair using namespace std; typedef long long ll; const ll mod = (ll)1e9 + 7; const ll N = (ll)1e5 + 7; ll n; ll d; ll a[N],u[N]; ll fac[N]; ll bp (ll b,ll l) { ll res = 1; while (l) { if (l & 1) res = (res * b) % mod; b = (b * b) % mod; l >>= 1; } return res; } ll cnk (ll nn,ll kk) { if (nn < kk) return 0; return fac[nn] * (bp(fac[kk] * fac[nn - kk] % mod,mod - 2) % mod) % mod; } main () { cin >> n; fac[0] = 1; for (int i = 1; i < N; i ++) { fac[i] = (fac[i - 1] * i) % mod; } for (ll i = 1; i <= n + 1; i ++) { cin >> a[i]; if (u[a[i]] > 0) { d = i - u[a[i]]; } u[a[i]] = i; } for (ll i = 1; i <= n; i ++) { cout << cnk(n + 1,i) - cnk(n - d,i - 1) % mod << endl; } cout << 1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 11 |
User | Talant |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1216 Byte |
Status | WA |
Exec Time | 217 ms |
Memory | 3584 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 | 217 ms | 3584 KB |
mx.txt | AC | 195 ms | 3584 KB |
rnd_0.txt | WA | 168 ms | 3072 KB |
rnd_1.txt | WA | 141 ms | 2816 KB |
rnd_2.txt | WA | 43 ms | 1536 KB |
rnd_3.txt | WA | 37 ms | 1408 KB |
rnd_4.txt | WA | 61 ms | 1792 KB |
sample1.txt | AC | 2 ms | 1024 KB |
sample2.txt | AC | 2 ms | 1024 KB |
sample3.txt | AC | 2 ms | 1024 KB |