QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#135784#5460. Sum of NumberslinninsTL 0ms2032kbC++142.4kb2023-08-06 00:24:552023-08-06 00:24:55

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-06 00:24:55]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:2032kb
  • [2023-08-06 00:24:55]
  • 提交

answer

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

char Mid[200500];
int Map[200500];

int Ans[200500];
int Sum[200500];

int MM =0;

int Anspoint = 2147483647;
int Sumpoint = 0;

void ADD(int p,int n)
{
	for(int i=1;i<=n;i++)
	{
		Sum[i] += Map[p+i];
	}
	Sumpoint = max(Sumpoint,n);
}

void clearSum()
{
	int flag = Sumpoint;
	for(int i=1;i<Sumpoint;i++)
	{
		Sum[i+1] += Sum[i]/10;
		Sum[i] %= 10; 
	}
	while(Sum[flag]>10)
	{
		Sum[flag+1] = Sum[flag]/10;
		Sum[flag]%=10;
		flag+=1;
		Sumpoint = flag;
	}

}

void change()
{
	Anspoint = Sumpoint;
	for(int i=1;i<=Sumpoint;i++)
	{
		Ans[i] = Sum[i];
	}
}

void updateAns()
{
	if(Anspoint>Sumpoint)
	{
		change();
	}
	else if(Anspoint==Sumpoint)
	{
		for(int i=Anspoint;i>=1;i--)
		{
			if(Ans[i]>Sum[i])
			{
				change();
				break;
			}
			else if(Ans[i] < Sum[i])
				break;
		}
	}
}

int main()
{
	int T;
	scanf("%d",&T);
	for(int L=1;L<=T;L++)
	{
		int n,k;
		Anspoint = 2147483647;
		scanf("%d%d",&n,&k);
		k+=1;
		scanf("%s",Mid);
		int len = strlen(Mid);
		for(int i=len;i>=1;i--)
		{
			Map[i] = Mid[len-i] - '0';
		}
		int avg = n/k;
		int type = pow(4,k+1);
		type -= 1;
		
		for(int i = type;i>=0;i--)
		{
			if(i == 278)
			{
				int c=1;
				c+=1;
			}
			int MID = i;
			int Sumn = 0;
			Sumpoint = 0;
			for(int i=1;i<=avg+10;i++)
			{
				Sum[i] = 0;
			}
			for(int j=1;j<=k;j++)
			{
				if(MID%4 == 3)
				{
					ADD(Sumn,avg+2);
					Sumn+=avg+2;
				}
				else if(MID%4 == 2)
				{
					ADD(Sumn,avg-1);
					Sumn+=avg-1;
				}
				else if(MID%4 == 1)
				{
					ADD(Sumn,avg+1);
					Sumn+=avg+1;
				}
				else
				{
					ADD(Sumn,avg);
					Sumn+=avg;
				}
				MID/=4;
			}
			if(Sumn == n)
			{
				clearSum();
				updateAns();
			}

		}
		for(int i=Anspoint;i>=1;i--)
		{
			printf("%d",Ans[i]);
		}
		printf("\n");
		
	}
}

/*
20
10 2
2156345972

20
14 3
32154512561264

20
14 6
12345678910354

10
10 3
1111111111

73745151612994128663659691951

100
119 4
74557467972773121782538891362827481768912897991754711869314352623359371753878285451828757473745151612994128663659691951



119 4
745574679727731217825388913628
274817689128979917547118693143
526233593717538782854518287574
73745151612994128663659691951

2411812927269438997564718


*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 2032kb

input:

2
8 1
45455151
2 1
42

output:

9696
6

result:

ok 2 lines

Test #2:

score: -100
Time Limit Exceeded

input:

10
1301 6
56328399613959594774559774218276494124991536454496431869449134772679831477279356599352619469813771742358572734317965823527349354276551857226632977613336815474383422853946661428822284645652423563864641261338984158269966469425994769486371736593879954275146732544891889693921182364554588732946...

output:

2861837555106640794797067737879913860686764066159587941287350938727749577629356630565034353414526438507603808735990935008225192080065174423508575377930722196909797866802717925250679901255
1330897896655974774035586406544907434842835048336411271110427836483063457950873824562288934364096546537492367401...

result: