Submission #1123564

#TimeUsernameProblemLanguageResultExecution timeMemory
1123564modwweDiversity (CEOI21_diversity)C++20
0 / 100
1 ms580 KiB
#include<bits/stdc++.h> #define int long long #define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".ans","w",stdout) #define pb push_back #define mask(k) (1<<k) #define mp make_pair #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while (c < '0' || c > '9') { c = getchar_unlocked(); } while (c >= '0' && c <= '9') { x = (x << 1) + (x << 3) + c - '0'; c = getchar_unlocked(); } return x; } void phongbeo(); const int inf = 1e18; const ll mod2 = 1e9+7; const int mod1 = 998244353; const ll base=67; int add(int x,int y) { if(x+y>=mod2) x-=mod2; if(x+y<0)x+=mod2; return x+y; } struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a, b, c; }; struct id { int a, b, c, d; }; struct ie { int a, b, c, d, e; }; int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center; int i, s10, s12,k1,k2,k3,s11,lim,w,l,r ; int kk; int el = 19; main() { if(fopen(task".inp","r")) { fin(task); fou(task); } NHP /// cin>>s1; // modwwe phongbeo(); // checktime } int dp[5001]; int dp2[5001]; int pre[5001][5001]; int sz[5001]; vector<int> v[5001]; int fac[5001]; int invf[5001]; int cost[5001]; int ipow(int n,int m) { if(m==0) return 1; int s=ipow(n,m/2); s=s*s%mod2; if(m%2==1)s=s*n%mod2; return s; } int c(int x,int y) { return (fac[x]*invf[y]%mod2)*invf[x-y]%mod2; } void dfs(int x) { for(auto f:v[x]) dfs(f); sz[x]=0; dp[x]=1; for(auto f:v[x]) { sz[x]+=sz[f]; dp[x]=(dp[x]*dp[f]%mod2)*c(sz[x],sz[f])%mod2; } sz[x]++; } void dfs2(int x) { int t=n-sz[x]+1; int dd=t; int hihi=x; for(int j=dd; j>=1; --j) pre[x][j]=pre[x][j-1]; pre[x][0]=0; for(int j=1; j<=dd; j++) pre[x][j]=add(pre[x][j],pre[x][j-1]); for(auto f:v[x]) { for(int j=1; j<=dd; j++) { if(pre[hihi][j]==0) continue; if(hihi==x) pre[f][j]=pre[hihi][j]; else pre[f][j]=(pre[hihi][j]*c(t-j,sz[hihi])%mod2)*dp[hihi]%mod2; } t+=sz[f]; hihi=f; } reverse(v[x].begin(),v[x].end()); hihi=x; int de=0; for(auto f:v[x]) { de+=sz[f]; if(hihi!=x) { for(int j=1; j<=dd; j++) { if(pre[f][j]==0) continue; pre[f][j]=(pre[f][j]*dp2[hihi]%mod2)*c(n-sz[f]-j,de-sz[f])%mod2; } dp2[f]=(dp2[hihi]*dp[f]%mod2)*c(de,sz[f])%mod2; } else dp2[f]=dp[f]; hihi=f; } for(auto f:v[x]) dfs2(f); } void phongbeo() { cin>>n; invf[0]=1; fac[0]=1; for(int i=1; i<=n; i++) fac[i]=fac[i-1]*i%mod2; invf[n]=ipow(fac[n],mod2-2); for(int i=n-1; i>=0; --i) invf[i]=invf[i+1]*(i+1)%mod2; for(int i=2; i<=n; i++) cin>>l,v[l].pb(i); dfs(1); pre[1][0]=1; dfs2(1); for(int i=1; i<=n; i++) cin>>cost[i]; for(int i=1; i<=n; i++) { s4=0; for(int j=1; j<=n; j++){ s4=add(s4,((pre[i][j]*c(n-j,sz[i]-1)%mod2)*dp[i]%mod2)*cost[j]%mod2); } cout<<s4<<" "; } }

Compilation message (stderr)

diversity.cpp:73:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   73 | main()
      | ^~~~
diversity.cpp: In function 'int main()':
diversity.cpp:11:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
diversity.cpp:77:9: note: in expansion of macro 'fin'
   77 |         fin(task);
      |         ^~~
diversity.cpp:12:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define fou(x) freopen(x".ans","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
diversity.cpp:78:9: note: in expansion of macro 'fou'
   78 |         fou(task);
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...