Submission #1825056


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
#define MOD 924844033
 
using namespace std;
 
typedef long long ll;
 
ll pow_mod(ll x,int k) {
ll ans=1;
while (k) {
if (k&1) ans=ans*x%MOD;
x=x*x%MOD;
k>>=1;
}
return ans;
}
 
ll a[1<<19],b[1<<19];
 
void rev(ll *p,int len) {
int j=len>>1;
for(int i=1;i<len-1;i++) {
if (i<j) swap(p[i],p[j]);
int k=len>>1;
while (j>=k) {
j-=k;
k>>=1;
}
if (j<k) j+=k;
}
}
 
void ntt(ll *p,int len,int check) {
rev(p,len);
for(int i=2;i<=len;i<<=1) {
ll wn=pow_mod(5,(MOD-1)/i);
for(int j=0;j<len;j+=i) {
ll w=1;
for(int k=j;k<j+(i>>1);k++) {
ll u=p[k];
ll v=w*p[k+(i>>1)]%MOD;
p[k]=(u+v)%MOD;
p[k+(i>>1)]=(u-v+MOD)%MOD;
w=w*wn%MOD;
}
}
}
if (check==-1) {
reverse(p+1,p+len);
ll nev=pow_mod(len,MOD-2);
for(int i=0;i<len;i++) p[i]=p[i]*nev%MOD;
}
}
 
struct Edge {
int t,next;
Edge() {}
Edge(int a,int b):t(a),next(b) {}
};
 
Edge e[400005];
int head[200005],num[200005],n;
 
int size[200005];
 
void dfs(int x,int fa) {
size[x]=1;
for(int i=head[x];i;i=e[i].next)
if (e[i].t!=fa) {
int u=e[i].t;
dfs(u,x);
size[x]+=size[u];
num[n-size[u]]++;
num[size[u]]++;
}
}
 
ll facd[200005],facv[200005];
 
void pre(int n) {
facd[0]=1;
for(int i=1;i<=n;i++) facd[i]=facd[i-1]*i%MOD;
facv[n]=pow_mod(facd[n],MOD-2);
for(int i=n-1;i>=0;i--) facv[i]=facv[i+1]*(i+1)%MOD;
}
 
int main() {
scanf("%d",&n);
pre(n);
for(int i=1;i<n;i++) {
int x,y;
scanf("%d%d",&x,&y);
e[2*i-1]=Edge(y,head[x]);
head[x]=2*i-1;
e[2*i]=Edge(x,head[y]);
head[y]=2*i;
}
dfs(1,0);
int len=1;
while (len<((n+1)<<1)) len<<=1;
for(int i=0;i<n;i++) {
a[i]=num[i]*facd[n-i]%MOD;
b[i]=facv[i];
}
ntt(a,len,1);ntt(b,len,1);
for(int i=0;i<len;i++) a[i]=a[i]*b[i]%MOD;
ntt(a,len,-1);
for(int i=1;i<=n;i++) {
ll s1=facd[n]*facv[i]%MOD*facv[n-i]%MOD*n%MOD;
ll s2=a[n-i]*facv[i]%MOD;
printf("%lld\n",(s1-s2+MOD)%MOD);
}
return 0;
}

Submission Info

Submission Time
Task F - Many Easy Problems
User mayaohua
Language C++14 (GCC 5.4.1)
Score 1900
Code Size 1940 Byte
Status AC
Exec Time 191 ms
Memory 26880 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:90:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 scanf("%d",&n);
               ^
./Main.cpp:94:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 scanf("%d%d",&x,&y);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1900 / 1900
Status
AC × 3
AC × 48
Set Name Test Cases
Sample example0, example1, example2
All doublestar0, doublestar1, doublestar2, doublestar3, doublestar4, example0, example1, example2, line0, line1, line2, line3, line4, maxrand0, maxrand1, maxrand10, maxrand11, maxrand12, maxrand13, maxrand14, maxrand15, maxrand16, maxrand17, maxrand18, maxrand19, maxrand2, maxrand3, maxrand4, maxrand5, maxrand6, maxrand7, maxrand8, maxrand9, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9, star0, star1, star2, star3, star4
Case Name Status Exec Time Memory
doublestar0 AC 181 ms 18816 KB
doublestar1 AC 182 ms 18816 KB
doublestar2 AC 182 ms 18816 KB
doublestar3 AC 181 ms 18816 KB
doublestar4 AC 182 ms 18816 KB
example0 AC 2 ms 8320 KB
example1 AC 2 ms 8320 KB
example2 AC 2 ms 8320 KB
line0 AC 188 ms 26752 KB
line1 AC 189 ms 26880 KB
line2 AC 189 ms 26880 KB
line3 AC 189 ms 26752 KB
line4 AC 188 ms 26752 KB
maxrand0 AC 189 ms 18816 KB
maxrand1 AC 189 ms 18816 KB
maxrand10 AC 189 ms 18816 KB
maxrand11 AC 189 ms 18816 KB
maxrand12 AC 189 ms 18816 KB
maxrand13 AC 191 ms 18816 KB
maxrand14 AC 189 ms 18816 KB
maxrand15 AC 189 ms 18816 KB
maxrand16 AC 189 ms 18816 KB
maxrand17 AC 189 ms 18816 KB
maxrand18 AC 189 ms 18816 KB
maxrand19 AC 189 ms 18816 KB
maxrand2 AC 189 ms 18816 KB
maxrand3 AC 189 ms 18816 KB
maxrand4 AC 190 ms 18816 KB
maxrand5 AC 190 ms 18816 KB
maxrand6 AC 190 ms 18816 KB
maxrand7 AC 189 ms 18816 KB
maxrand8 AC 190 ms 18816 KB
maxrand9 AC 190 ms 18816 KB
rand0 AC 4 ms 8448 KB
rand1 AC 2 ms 8320 KB
rand2 AC 3 ms 8448 KB
rand3 AC 4 ms 8448 KB
rand4 AC 3 ms 8320 KB
rand5 AC 4 ms 8448 KB
rand6 AC 3 ms 8448 KB
rand7 AC 4 ms 8448 KB
rand8 AC 2 ms 8320 KB
rand9 AC 3 ms 8320 KB
star0 AC 179 ms 18816 KB
star1 AC 179 ms 18816 KB
star2 AC 184 ms 18816 KB
star3 AC 180 ms 18816 KB
star4 AC 179 ms 18816 KB