QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#66708#5169. 夹娃娃aoui0 42ms13060kbC++142.3kb2022-12-09 11:08:492022-12-09 11:08:50

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-12-09 11:08:50]
  • 评测
  • 测评结果:0
  • 用时:42ms
  • 内存:13060kb
  • [2022-12-09 11:08:49]
  • 提交

answer

#include<cstdio>
#include<algorithm>
using namespace std;
#include<cstring>
#define ll long long
#define ull unsigned long long
#include<vector>
#define Poly vector<int>
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
#define clr(a,n) memset(a,0,sizeof(int)*(n))
const int mo=998244353,_G=3,maxn=1<<18|500;
ll fpow(ll x,ll y=mo-2)
{
	ll res=1;
	for(;y;y>>=1,x=x*x%mo)if(y&1)res=res*x%mo;
	return res;
}
const int invG=fpow(_G);
int re[maxn<<1],rfl=0,lim=521,_inv[maxn],nn=1024;
void Rev(int n)
{
	if(rfl==n)return;
	rfl=n;
	for(int i=0;i<n;i++)re[i]=(re[i>>1]>>1)|((i&1)?n>>1:0);
}
void NTT(int *g,bool op,int n)
{
	Rev(n);
	static ull f[maxn<<1],_w[maxn<<1];
	_w[0]=1;
	for(int i=0;i<n;i++)f[i]=(((ll)mo<<5)+g[re[i]])%mo;
	for(int l=1;l<n;l<<=1)
	{
		ull _g=fpow(op?_G:invG,(mo-1)/(l+l));
		for(int i=1;i<l;i++)_w[i]=_w[i-1]*_g%mo;
		for(int k=0;k<n;k+=l+l)
			for(int j=0;j<l;j++)
			{
				int _t=_w[j]*f[l|k|j]%mo;
				f[l|k|j]=f[k|j]+mo-_t;
				f[k|j]+=_t;
			}
		if(l==(1<<10))for(int i=0;i<n;i++)f[i]%=mo;
	}
	if(!op)
	{
		ull invn=fpow(n);
		for(int i=0;i<n;i++)g[i]=f[i]%mo*invn%mo;
	}
	else for(int i=0;i<n;i++)g[i]=f[i]%mo;
}
const int N=20,M=2.5e3+5;;
int n,Q,s[N][525][M],t[M],f[M],g[M];
char ch[N];
int main()
{
	int id;
	scanf("%d%d%d",&n,&Q,&id);
	for(int i=1;i<=n;i++)
	{
		int k;
		scanf("%d",&k);
		for(int j=0;j<nn;j++)f[j]=1;
		for(;k;k--)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			for(int j=0;j<nn;j++)g[j]=0;
			for(int j=0;j<=b&&a*j<nn/2;j++)g[j*a]=1;
			NTT(g,1,nn);
			for(int j=0;j<nn;j++)f[j]=1ll*f[j]*g[j]%mo;
			NTT(f,0,nn);
			for(int j=nn/2;j<nn;j++)f[j]=0;
			NTT(f,1,nn);
		}
		NTT(f,0,nn);
		for(int j=nn/2;j<nn;j++)f[j]=0;
		for(int j=0;j<=520;j++)
		{
			for(int l=0;l<nn/2;l++)s[i][j][l]=f[l];
			NTT(s[i][j],1,nn);
			f[j]=0;
		}
	}
	for(;Q;Q--)
	{
		for(int i=0;i<nn;i++)t[i]=1;
		char cc=getchar();
		scanf("%s",ch+1);
		int m,k;
		scanf("%d%d",&m,&k);
		for(int i=1;i<=n;i++)
		{
			if(ch[i]=='1')
				for(int j=0;j<nn;j++)t[j]=1ll*t[j]*s[i][k][j]%mo;
			else
				for(int j=0;j<nn;j++)t[j]=1ll*t[j]*s[i][0][j]%mo;
			NTT(t,0,nn);
			for(int j=nn/2;j<nn;j++)t[j]=0;
			NTT(t,1,nn);
		}
		NTT(t,0,nn);
		int ans=0;
		for(int i=0;i<=m;i++)ans=(ans+t[i])%mo;
		printf("%d\n",ans);
	}
	return 0;
}

详细

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 42ms
memory: 13060kb

input:

1 521 998244353
39 520 520 11 22 414 8 95 18 229 356 26 407 316 10 24 26 19 61 11 130 482 476 420 15 192 193 208 24 19 233 494 217 275 294 26 28 439 20 272 277 28 198 5 335 22 8 28 17 154 78 6 13 175 17 2 5 477 256 200 4 1 36 427 371 439 23 10 65 426 25 24 27 121 29 28 13 12 453
0 520 1
1 519 1
1 51...

output:

909712491
909712490
909712489
909712487
909712485
909712482
909712478
909712472
909712465
909712456
909712446
909712432
909712414
909712391
909712364
909712332
909712294
909712247
909712191
909712125
909712048
909711958
909711851
909711723
909711575
909711401
909711202
909710968
909710699
909710384
...

result:

wrong answer 1st lines differ - expected: '38813347', found: '909712491'

Subtask #2:

score: 0
Skipped

Dependency #1:

0%

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Time Limit Exceeded

Test #9:

score: 0
Time Limit Exceeded

input:

15 52099 998244353
1 9 3
1 9 4
1 9 2
1 8 10
1 4 4
1 3 1
1 2 5
1 4 9
1 1 4
1 9 4
1 7 6
1 1 6
1 2 5
1 5 2
1 3 5
101000000001010 516 1
010001001010101 520 2
000000101000001 519 2
101011111100011 518 1
010110001000111 520 2
000110111100111 516 1
000100101001011 519 3
000111001010011 518 1
00001110010111...

output:

993379058
496689529
866368587
797687294
481245176
481245176
39022588
269889529
552778235
769822588
331666941
99789529
903956470
112750588
756797435
519045176
870912000
361582588
594280447
494747647
597778941
178845176
435456000
493445999
461733882
308912117
271186941
496689529
919511294
85533882
894...

result:


Subtask #5:

score: 0
Skipped

Dependency #3:

0%

Subtask #6:

score: 0
Skipped

Dependency #4:

0%

Subtask #7:

score: 0
Skipped

Dependency #6:

0%