Submission #64092764

Source Code Expand

#include <bits/stdc++.h>
#define _F(x,y,z) for(int x=y;x<=z;x++)
#define F_(x,z,y) for(int x=z;x>=y;x--)
#define TF(x,y,z) for(int x=head[y],z;x;x=nex[x])

using namespace std;

typedef long long ll;
typedef double dou;
typedef const int ci;
typedef pair<int,int> pii;

ci maxn=2e6+10;

int n;
char s[maxn],t[maxn];
int nex[maxn];
void build(char *s)
{
	int m=2*n+2,j=0;
	_F(i,2,m)
	{
		while(j&&s[j+1]!=s[i]) j=nex[j];
		if(s[j+1]==s[i])
			j++;
		nex[i]=j;
	}
}
int main()
{
	scanf("%s",s+1);
	n=strlen(s+1);
	F_(i,n,1)
	{
		t[n-i+1]=s[i];
	}
	t[n+1]='#';
	_F(i,n+2,2*n+1)
	{
		t[i]=s[i-n-1];
	}
	build(t);
//	printf("%s ",t+1);
//	_F(i,1,2*n+2)
//	{
//		printf("%d ",nex[i]);
//	}
	int x=nex[2*n+1];
//	printf("%d",x);
//	if(x>=n)
//	{
//		_F(i,1,n)
//		{
//			printf("%c",s[i]);
//		}
//		return 0;
//	}
	_F(i,1,n)
		printf("%c",s[i]);
	F_(i,n-x,1)
		printf("%c",s[i]);
	return 0;
}

Submission Info

Submission Time
Task F - ABCBA
User adolphshi
Language C++ 20 (gcc 12.2)
Score 500
Code Size 948 Byte
Status AC
Exec Time 22 ms
Memory 9192 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:31:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   31 |         scanf("%s",s+1);
      |         ~~~~~^~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 36
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3640 KiB
sample_02.txt AC 1 ms 3624 KiB
sample_03.txt AC 1 ms 3632 KiB
test_01.txt AC 1 ms 3704 KiB
test_02.txt AC 1 ms 3632 KiB
test_03.txt AC 1 ms 3652 KiB
test_04.txt AC 1 ms 3828 KiB
test_05.txt AC 1 ms 3700 KiB
test_06.txt AC 1 ms 3648 KiB
test_07.txt AC 1 ms 3628 KiB
test_08.txt AC 1 ms 3648 KiB
test_09.txt AC 1 ms 3580 KiB
test_10.txt AC 22 ms 9008 KiB
test_11.txt AC 22 ms 9132 KiB
test_12.txt AC 22 ms 8992 KiB
test_13.txt AC 22 ms 8988 KiB
test_14.txt AC 17 ms 9008 KiB
test_15.txt AC 13 ms 9000 KiB
test_16.txt AC 22 ms 9140 KiB
test_17.txt AC 15 ms 9068 KiB
test_18.txt AC 16 ms 9084 KiB
test_19.txt AC 14 ms 8952 KiB
test_20.txt AC 13 ms 8860 KiB
test_21.txt AC 22 ms 9080 KiB
test_22.txt AC 18 ms 9068 KiB
test_23.txt AC 19 ms 8884 KiB
test_24.txt AC 18 ms 9000 KiB
test_25.txt AC 14 ms 9020 KiB
test_26.txt AC 22 ms 8996 KiB
test_27.txt AC 21 ms 9136 KiB
test_28.txt AC 18 ms 9072 KiB
test_29.txt AC 20 ms 8988 KiB
test_30.txt AC 13 ms 8880 KiB
test_31.txt AC 22 ms 9064 KiB
test_32.txt AC 20 ms 9000 KiB
test_33.txt AC 21 ms 9192 KiB