0_0_39680518_18042.cpp:1:10: fatal error: gcc-13.1.0/lib/gcc/x86_64-w64-mingw32/13.1.0/include/c++/bits/stdc++.h>usin: Invalid argument
1 | #include <bits/stdc++.h>using namespace std;#define int long longconst int N=4105;const int mod=998244353;int n;short ma[8008][8008];int C[2005][2005];struct node{ int a,b,c,d;}p[N];int a[N*8],b[N*8],aid[N*8],bid[N*8];int t1,t2;int ans[N],sum[N];int qpow(int x,int y){ int ans=1; while(y){ if(y&1) ans=ans*x%mod; x=x*x%mod; y>>=1; } return ans;}signed main(){ cin>>n; C[0][0]=1; for (int i = 1; i <= n; ++ i) { C[i][0]=1; C[i][i]=1; for (int j=1;j<=i-1;++j) C[i][j] = (C[i-1][j] + C[i-1][j-1]) % mod; } for(int i=1;i<=n;++i){ cin>>p[i].a>>p[i].b>>p[i].c>>p[i].d; p[i].a+=5; p[i].b+=5; p[i].c+=5; p[i].d+=5; p[i].c--,p[i].d--; a[++t1]=p[i].a,a[++t1]=p[i].c; a[++t1]=p[i].a-1,a[++t1]=p[i].c+1; b[++t2]=p[i].b,b[++t2]=p[i].d; b[++t2]=p[i].b-1,b[++t2]=p[i].d+1; } sort(a+1,a+1+t1); sort(b+1,b+1+t2); int l1=unique(a+1,a+1+t1)-(a+1); int l2=unique(b+1,b+1+t2)-(b+1); for(int i=1;i<=n;++i){ p[i].a=lower_bound(a+1,a+l1+1,p[i].a)-a; p[i].c=lower_bound(a+1,a+l1+1,p[i].c)-a; p[i].b=lower_bound(b+1,b+l2+1,p[i].b)-b; p[i].d=lower_bound(b+1,b+l2+1,p[i].d)-b; ma[p[i].a][p[i].b]++; ma[p[i].a][p[i].d+1]--; ma[p[i].c+1][p[i].b]--; ma[p[i].c+1][p[i].d+1]++; } for(int i=1;i<=l1;++i){ for(int j=1;j<=l2;++j){ ma[i][j]+=ma[i-1][j]+ma[i][j-1]-ma[i-1][j-1]; if(ma[i][j]>=1) { sum[ma[i][j]]+=(a[i+1]-a[i])*(b[j+1]-b[j])%mod,sum[ma[i][j]]%=mod; } } } for(int i=1;i<=n;++i){ for(int j=1;j<=n;++j){ if(n-j>=i) ans[i]+=sum[j]*((C[n][i]-C[n-j][i]+mod)%mod)%mod; else ans[i]+=sum[j]*(C[n][i])%mod; ans[i]%=mod; } cout<<ans[i]*qpow(C[n][i],mod-2)%mod<<'\n'; } return 0;}/*31 1 2 23 3 4 41 1 4 4*/
| ^~~~~~~~~~~~~~~~~~~~
compilation terminated.
|
