QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#474020#4890. 这是一道集训队胡策题yqh2025100 ✓140ms199876kbC++142.1kb2024-07-12 15:34:332024-07-12 15:34:34

Judging History

This is the latest submission verdict.

  • [2024-07-12 15:34:34]
  • Judged
  • Verdict: 100
  • Time: 140ms
  • Memory: 199876kb
  • [2024-07-12 15:34:33]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5010,mod=998244353;
int n,c[N][N],a[N],b[N];
int ed1[N],ed2[N];
int jc[N],invjc[N];
int ksm(int x,int y){int ans=1;while(y){if(y&1)ans=ans*x%mod;x=x*x%mod;y>>=1;}return ans;}
int inv(int x){return ksm(x,mod-2);}
void init(){
	jc[0]=1;for(int i=1;i<=n;i++)jc[i]=jc[i-1]*i%mod;
	invjc[n]=inv(jc[n]);
	for(int i=n-1;i>=0;i--)invjc[i]=invjc[i+1]*(i+1)%mod;
}
int C(int n,int m){
	if(n<m)return 0;
	return jc[n]*invjc[m]%mod*invjc[n-m]%mod;
}
char ch[N];
int sum1[N],sum2[N];
int ans=0;
signed main(){
	scanf("%lld",&n);init();
	ans=1;
	for(int i=1;i<=n;i++){
		scanf("%s",ch+1);
		for(int j=1;j<=n;j++){
			c[i][j]=ch[j]-'0';
			if(c[i][j])ans=0;
			a[i]+=c[i][j];
			b[j]+=c[i][j];
		}
	}
	sort(a+1,a+n+1);reverse(a+1,a+n+1);
	sort(b+1,b+n+1);reverse(b+1,b+n+1);
	for(int i=n;i>=1;i--)sum1[i]=sum1[i+1]+n-a[i];
	for(int i=n;i>=1;i--)sum2[i]=sum2[i+1]+n-b[i];
	int s1=0,s2=0,l1=1,l2=1;
	for(int i=1;i<=n;i++){
		if(a[i]!=a[l1]){
			ed1[l1]=i-1-l1+1;l1=i;
		}
	}ed1[l1]=n-l1+1;
	for(int i=1;i<=n;i++){
		if(b[i]!=b[l2]){
			ed2[l2]=i-1-l2+1;l2=i;
		}
	}ed2[l2]=n-l2+1;
	// for(int i=1;i<=n;i++)cout<<ed1[i]<<" ";cout<<endl;
	// for(int i=1;i<=n;i++)cout<<ed2[i]<<" ";cout<<endl;cout<<endl;
	l1=l2=1;
	for(int i=1;i<=n;i++){
		s2=0;s1+=a[i];if(a[i]!=a[l1])l1=i;
		l2=1;
		for(int j=1;j<=n;j++){
			s2+=b[j];if(b[j]!=b[l2])l2=j;
			int s=s1+s2+sum1[i+1]+sum2[j+1]-(i*j+(n-i)*(n-j));
			// cout<<i<<" "<<j<<"  "<<s1<<" "<<s2<<" "<<sum1[i+1]<<" "<<sum2[j+1]<<" "<<s<<endl;
			if(s==n*n){
				// cout<<i<<" "<<j<<" "<<C(ed1[l1],i-l1+1)*C(ed2[l2],j-l2+1)%mod<<" "<<l1<<" "<<l2<<endl;
				ans+=C(ed1[l1],i-l1+1)*C(ed2[l2],j-l2+1)%mod;ans%=mod;
			}
		}
	}
	s2=0;l2=1;
	for(int j=1;j<=n;j++){
		s2+=b[j];if(b[j]!=b[l2])l2=j;
		int s=s2+sum1[1]+sum2[j+1]-n*(n-j);
		if(s==n*n){
			ans+=C(ed2[l2],j-l2+1)%mod;ans%=mod;
		}
	}
	s1=0,l1=1;
	for(int i=1;i<=n;i++){
		s1+=a[i];if(a[i]!=a[l1])l1=i;
		int s=s1+sum1[i+1]+sum2[1]-(n-i)*n;
		if(s==n*n){
			ans+=C(ed1[l1],i-l1+1)%mod;ans%=mod;
		}
	}
	cout<<ans;
	return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 5
Accepted

Test #1:

score: 5
Accepted
time: 0ms
memory: 3716kb

input:

10
0000000000
0101111001
0101111001
0101111001
0101111001
0101111001
0101111001
0101111001
0101111001
0101111001

output:

591

result:

ok 1 number(s): "591"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3712kb

input:

10
0000000000
0001100000
0001111111
0001111111
0001100000
0001111111
0001110100
0001110100
0001110100
0001110100

output:

47

result:

ok 1 number(s): "47"

Test #3:

score: 0
Accepted
time: 1ms
memory: 5952kb

input:

10
1000000000
1010000000
1010000000
1010111111
1010100111
1010100111
1010100111
1010100100
1010100100
1010100110

output:

30

result:

ok 1 number(s): "30"

Test #4:

score: 0
Accepted
time: 1ms
memory: 5748kb

input:

10
0000110001
0101100000
0100001111
1011000001
0011010000
1010011111
1000111100
1110111101
1000101100
1000110100

output:

2

result:

ok 1 number(s): "2"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

10
1000010100
1100001111
1111010111
1010000001
1000110111
0100001001
1000111110
0110100010
1010100010
1010110111

output:

2

result:

ok 1 number(s): "2"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3936kb

input:

10
1011001000
1011111011
0111010011
0011110000
0000011100
0101000000
1001100000
1111010011
1110111101
1100010101

output:

2

result:

ok 1 number(s): "2"

Subtask #2:

score: 15
Accepted

Test #7:

score: 15
Accepted
time: 0ms
memory: 3828kb

input:

20
11110010101111111000
01000101111110100000
10110001010110111101
10111111011011110101
10110101011010111101
00010100011011001011
01111111001000101001
10101101011101011100
11011010110101011110
00010100101000001011
00001010100111101100
00100111010010101001
00000010010110110110
11011111100110111100
010...

output:

2

result:

ok 1 number(s): "2"

Test #8:

score: 0
Accepted
time: 0ms
memory: 3956kb

input:

20
01000110110000100100
00010110001100011000
11111000101101101010
10010001100000010100
01101101000000111100
10010111110101011101
00000101010000000110
00001100101111111110
11111110111001101001
00010000001000101011
00010010110110110011
01011011110010011110
01000101111111011101
00010111001101001110
101...

output:

2

result:

ok 1 number(s): "2"

Test #9:

score: 0
Accepted
time: 0ms
memory: 3904kb

input:

20
00000000000000000000
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
10011101011010000010
100...

output:

526847

result:

ok 1 number(s): "526847"

Test #10:

score: 0
Accepted
time: 1ms
memory: 5800kb

input:

20
00000000000000000000
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
11101100001001010011
111...

output:

526335

result:

ok 1 number(s): "526335"

Test #11:

score: 0
Accepted
time: 0ms
memory: 5796kb

input:

20
10000000000000000000
11111000110000000000
11111000110000000000
11111000111111111111
11111000111111111111
11111000111111111111
11111000110000000000
11111000111111111111
11111000110000000000
11111000111111111111
11111000111111111111
11111000111010011011
11111000111010011011
11111000111010011011
111...

output:

740

result:

ok 1 number(s): "740"

Test #12:

score: 0
Accepted
time: 0ms
memory: 3984kb

input:

20
10000000000000000000
11110100100000000000
11110100101111111111
11110100100000000000
11110100100000000000
11110100100000000000
11110100101111111111
11110100100000000000
11110100101111111111
11110100101111111111
11110100100000000000
11110100100010000000
11110100100010000000
11110100100010000000
111...

output:

1150

result:

ok 1 number(s): "1150"

Test #13:

score: 0
Accepted
time: 0ms
memory: 3852kb

input:

20
11111111111111111111
10100111111111111111
10100100000000000000
10100100000000000000
10100111111111111111
10100100000000000000
10100100000000000000
10100111001100101111
10100111001100101111
10100111001100100000
10100111001100101111
10100111001100100000
10100111001100100000
10100111001100101111
101...

output:

189

result:

ok 1 number(s): "189"

Subtask #3:

score: 40
Accepted

Test #14:

score: 40
Accepted
time: 3ms
memory: 16204kb

input:

300
01110011110110110011100111010000101110110001000111111011100101101101101011110101110100110110001110111010101011111010010101001000100011001110110100110000111001011011100000011100000000000001101000010110110000110001110000010110100010110110111000110000100101110011111010001100110111001010000100110110...

output:

2

result:

ok 1 number(s): "2"

Test #15:

score: 0
Accepted
time: 3ms
memory: 14396kb

input:

300
00101101101001110001110111101010000101010101100001110010001101001011011110111000110110101101111100010010011111010011101011110001011011111110001110100110101010100111001110001100111011010110010010111101001001101000000000011101011000111100101000101110111011001111111000111000100111100110101001011101...

output:

2

result:

ok 1 number(s): "2"

Test #16:

score: 0
Accepted
time: 2ms
memory: 14376kb

input:

300
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

936335109

result:

ok 1 number(s): "936335109"

Test #17:

score: 0
Accepted
time: 2ms
memory: 14436kb

input:

300
10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

124904823

result:

ok 1 number(s): "124904823"

Test #18:

score: 0
Accepted
time: 0ms
memory: 14264kb

input:

300
11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

923149686

result:

ok 1 number(s): "923149686"

Test #19:

score: 0
Accepted
time: 0ms
memory: 16296kb

input:

300
01111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

254929271

result:

ok 1 number(s): "254929271"

Test #20:

score: 0
Accepted
time: 0ms
memory: 16184kb

input:

300
11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

12177

result:

ok 1 number(s): "12177"

Subtask #4:

score: 5
Accepted

Test #21:

score: 5
Accepted
time: 140ms
memory: 199660kb

input:

5000
0000111111000001000100111100110001110111011000101000110111100011111110110011101001111001111101010001111101110011110101010011010010000000001111000111101111010010110100000110111101100000010111111110001001010100101110100010100000011100000101011011101010011111101011000110001001011010000010000101111...

output:

2

result:

ok 1 number(s): "2"

Test #22:

score: 0
Accepted
time: 123ms
memory: 199812kb

input:

5000
0010011001001111110110000001101010000101010111000001101101011100001001011101010000001111010001101001111000101001011011001000111110010001111011011101010000110000010100010110011010000110111110111100110100001010110010001011010010001001101110000000111110111111000110000011010011100001110011111010001...

output:

2

result:

ok 1 number(s): "2"

Test #23:

score: 0
Accepted
time: 97ms
memory: 199668kb

input:

5000
1100111111010100100110101001011111001111000111111010110110010101011010010001111010101001101110111111100100101111010111001111100001100101111111000010100011000110100010010110111111100001100010000111101011110111100010010000001110011110001110110001000101111010110011111001111001011011110010101000000...

output:

2

result:

ok 1 number(s): "2"

Subtask #5:

score: 35
Accepted

Test #24:

score: 35
Accepted
time: 111ms
memory: 199676kb

input:

5000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

828414647

result:

ok 1 number(s): "828414647"

Test #25:

score: 0
Accepted
time: 129ms
memory: 199824kb

input:

5000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

16621460

result:

ok 1 number(s): "16621460"

Test #26:

score: 0
Accepted
time: 120ms
memory: 199680kb

input:

5000
1010110111100100001010010010100011000101011011111111101001100001101101011001001110101011110101001110010011110111101001011010010001100100111010100100000011101101000100010001011001101100000000000000011001100101111101110010111101000000010001000101110111100011100110101001001000001101111010001111010...

output:

2

result:

ok 1 number(s): "2"

Test #27:

score: 0
Accepted
time: 106ms
memory: 199752kb

input:

5000
1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

541497915

result:

ok 1 number(s): "541497915"

Test #28:

score: 0
Accepted
time: 113ms
memory: 199784kb

input:

5000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

288388087

result:

ok 1 number(s): "288388087"

Test #29:

score: 0
Accepted
time: 114ms
memory: 199868kb

input:

5000
0111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

352199570

result:

ok 1 number(s): "352199570"

Test #30:

score: 0
Accepted
time: 117ms
memory: 199876kb

input:

5000
1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

410201481

result:

ok 1 number(s): "410201481"

Extra Test:

score: 0
Extra Test Passed