QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#622002#8141. DigitsWrongAnswer_90WA 2ms8648kbC++176.0kb2024-10-08 19:21:042024-10-08 19:21:06

Judging History

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

  • [2024-10-08 19:21:06]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:8648kb
  • [2024-10-08 19:21:04]
  • 提交

answer

#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vp vector<pii>
#define vt vector<tup>
#define all(x) x.begin(),x.end()
#define mp make_pair

#define FastI
#define FastO
#define int ll
bool ST;
static const ll MOD=998244353,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,Inf=4294967296,INF=4557430888798830399;
static const ld eps=1e-9,pi=3.1415926535;
char in[1<<20],*p1=in,*p2=in;
char out[1<<20],*p3=out;
using namespace std;
struct tup
{
	int x,y,z;
	tup(int X=0,int Y=0,int Z=0)
	{x=X,y=Y,z=Z;}
};
#ifdef FastI
#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#endif
#ifdef FastO
#define putchar(x) (p3-out==1<<20?fwrite(out,1,1<<20,stdout),p3=out,0:0,*p3++=x)
#define puts(x) write(x,'\n')
#endif
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[25];
			int top=0;
			do st[top++]=x%10+'0',x/=10;while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' ')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		char ch=getchar();s=0;
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-'&&(ch=getchar()));
		while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=tf?-s:s;
	}
	inline void edl(){putchar('\n');}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
	#ifdef FastO
	struct Writer{~Writer(){fwrite(out,1,p3-out,stdout);}}Writ;
	#endif
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	inline int Cmod(int x){return (x%MOD+MOD)%MOD;}
	inline void Mmod(int&x){x=(x%MOD+MOD)%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
	int n,a[160],s[160],pw[15],g[160][160];
	unordered_map<int,int> f[160][160][2];
	//0:left 1:right
	inline int rev(int x)
	{
		int tmp=0;
		while(x)tmp=tmp*10+x%10,x/=10;
		return tmp;
	}
	inline int get(int x)
	{
		int d=0;
		while(x)++d,x/=10;
		return max(d,1ll);
	}
	inline bool chk(int x){return x==rev(x);}
	inline void mian()
	{
		pw[0]=1;
		for(int i=1;i<=10;++i)pw[i]=pw[i-1]*10;
		read(n);
		for(int i=1;i<=n;++i)read(a[i]),s[i]=s[i-1]+a[i];
		for(int i=1;i<=n;++i)for(int j=i;j<=n;++j)
		f[i][j][0].clear(),f[i][j][1].clear(),g[i][j]=0;
		for(int l=n;l>=1;--l)for(int r=l;r<=n;++r)
		{
			int S=s[r]-s[l-1];
			int d=get(S);
			for(int j=1;j<=d;++j)f[l][r][0][S/pw[d-j]]+=chk(S%pw[d-j]);
			for(int j=1;j<d;++j)f[l][r][1][S%pw[j]]+=chk(S/pw[j]);
			
			g[l][r]+=chk(S);
			
			for(int k=r+1;k<=n;++k)
			Madd(f[l][k][1][s[k]-s[r]],g[l][r]);
			for(auto [x,y]:f[l][r][0])
			{
				int d=get(x),ix=rev(x);
				for(int k=r+1;k<=n;++k)
				{
					int val=s[k]-s[r],dd=get(val);
					if(val==ix&&d==dd){Madd(g[l][k],y);continue;}
					if(dd<d&&ix%pw[dd]==val)Madd(f[l][k][0][x/pw[dd]],y);
					if(dd>d&&val/pw[dd-d]==ix)Madd(f[l][k][1][val%pw[dd-d]],y);
				}
			}
			for(auto [x,y]:f[l][r][1])
			{
				int d=get(x),ix=rev(x);
				for(int k=1;k<l;++k)
				{
					int val=s[l-1]-s[k-1],dd=get(val);
					if(val==ix&&d==dd){Madd(g[k][r],y);continue;}
					if(dd<d&&ix%pw[dd]==val)Madd(f[k][r][1][x%pw[d-dd]],y);
					if(dd>d&&val%pw[d]==ix)Madd(f[k][r][0][val/pw[d]],y);
				}
			}
		}
//		cerr<<g[2][6];exit(0);
//		cerr<<f[1][6][0][1]<<endl;exit(0);
		write(g[1][n],'\n');
	}
	inline void Mian()
	{
		int T=1;
		read(T);
		while(T--)mian();
	}
}
bool ED;
signed main()
{
//	ios::sync_with_stdio(0); 
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	double st=clock();
	WrongAnswer_90::Mian();
	double ed=clock();
 	cerr<<endl;
 	cerr<<"Time: "<<ed-st<<" ms\n";
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 8648kb

input:

5
2
123456 654321
5
0 0 0 0 0
6
1 1 1 1 1 1
7
1 1 4 5 1 4 1
9
1 2 3 1 1 1 2 1 1

output:

2
16
8
4
6

result:

ok 5 number(s): "2 16 8 4 6"

Test #2:

score: -100
Wrong Answer
time: 2ms
memory: 7240kb

input:

13
7
0 0 4 2 3 3 0
12
3 2 1 0 1 4 3 1 4 4 1 1
12
1 1 2 4 2 4 4 4 4 2 4 1
11
2 0 3 3 3 2 4 1 4 2 4
8
2 3 3 3 3 3 1 4
13
1 2 3 1 1 4 4 0 2 2 1 3 0
6
3 2 1 0 3 4
13
4 0 0 2 4 2 0 2 3 4 1 0 2
12
0 4 0 3 1 1 1 2 2 1 4 0
9
4 1 0 2 4 2 0 0 0
11
0 3 2 0 4 3 1 0 0 3 2
12
0 1 0 1 3 1 2 1 1 0 2 1
12
4 2 2 1 4 ...

output:

3
6
3
1
7
27
0
2
26
0
19
9
6

result:

wrong answer 8th numbers differ - expected: '4', found: '2'