QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#827852#9898. Strings in the PocketN_z_AC ✓209ms33872kbC++237.1kb2024-12-23 10:40:052024-12-23 10:40:06

Judging History

This is the latest submission verdict.

  • [2024-12-23 10:40:06]
  • Judged
  • Verdict: AC
  • Time: 209ms
  • Memory: 33872kb
  • [2024-12-23 10:40:05]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
struct time_helper{
#ifdef LOCAL
clock_t time_last;time_helper(){time_last=clock();}void test(){auto time_now=clock();std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;time_last=time_now;}~time_helper(){test();}
#else
void test(){}
#endif
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
int print_precision=10;bool print_T_endl=1;char print_between=' ';
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader;struct Writer;template<size_t id>struct read_tuple{template<typename...T>static void read(Reader&stream,std::tuple<T...>&x){read_tuple<id-1>::read(stream,x);stream>>get<id-1>(x);}};template<>struct read_tuple<0>{template<typename...T>static void read([[maybe_unused]]Reader&stream,[[maybe_unused]]std::tuple<T...>&x){}};template<size_t id>struct print_tuple{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){print_tuple<id-1>::print(stream,x);putchar(print_between);stream<<get<id-1>(x);}};template<>struct print_tuple<1>{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){stream<<get<0>(x);}};template<>struct print_tuple<0>{template<typename...T>static void print([[maybe_unused]]Writer&stream,[[maybe_unused]]const std::tuple<T...>&x){}};
struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename...T>Reader&operator>>(std::tuple<T...>&x){read_tuple<sizeof...(T)>::read(*this,x);return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}template<typename T1,typename T2>Reader&operator>>(std::pair<T1,T2>&x){*this>>x.first>>x.second;return *this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';
struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(const T&x){for(auto q:x){*this<<q;if(!is_class<decltype(q)>::value)*this<<print_between;}if(!is_class<typename T::value_type>::value&&print_T_endl)*this<<'\n';return *this;}template<typename...T>Writer&operator<<(const std::tuple<T...>&x){print_tuple<sizeof...(T)>::print(*this,x);if(print_T_endl)*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-print_precision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<print_precision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<print_precision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(const T&c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}template<typename T1,typename T2>Writer&operator<<(const std::pair<T1,T2>&x){*this<<x.first<<print_between<<x.second;if(print_T_endl)*this<<'\n';return *this;}Writer&operator<<(const std::string&str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

void init();void solve(int tc);
signed main()
{
    init();int t=1;
    cin>>t;
    for(int tc=1;tc<=t;tc++)solve(tc);
}
void init()
{
}
void solve([[maybe_unused]]int tc)
{
    string s,t;
    cin>>s>>t;
    if(s==t)
    {
        s="#";
        for(auto q:t)s+=q,s+='#';
        int cent=-1,r=-1;
        long long ans=0;
        vector<int>len(s.size());
        for(int x=0;x<s.size();x++)
        {
            if(x>r)cent=r=x,len[x]=1;
            else len[x]=min(len[2*cent-x],r-x+1);
            while(x-len[x]>=0&&x+len[x]<s.size()&&s[x-len[x]]==s[x+len[x]])len[x]++;
            if(x+len[x]-1>r)r=x+len[x]-1,cent=x;
            ans+=len[x]/2;
        }
        cout<<ans<<endl;
        return;
    }
    else
    {
        int fit=-1,lit=-1;
        for(int x=0;x<s.size();x++)
        if(s[x]!=t[x]){fit=x;break;}
        for(int x=s.size()-1;x>=0;x--)
        if(s[x]!=t[x]){lit=x;break;}
        reverse(s.begin()+fit,s.begin()+lit+1);
        if(s!=t){cout<<0<<endl;return;}
        int ans=1;
        while(fit>0&&lit+1<s.size()&&s[fit-1]==s[lit+1])ans++,fit--,lit++;
        cout<<ans<<endl;
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
abcbcdcbd
abcdcbcbd
abc
abc

output:

3
3

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 209ms
memory: 33872kb

input:

11120
xnjunkvq
xqvknujn
cdeervunkjryqazekhumqvhxyrtaxkezaqukd
cdeervunkjryqazekxatryxhvqmuhkezaqukd
epjwxrpckpnpgpmqradexxjqjmkkgrfqbhnbbahziqhizlftbbmpztuqcdfhrgkkmjqjxxedarqmpgpnpkcprxwjpe
epjwxrpckpnpgpmqradexxjqjmkkgrhfdcqutzpmbbtflzihqizhabbnhbqfrgkkmjqjxxedarqmpgpnpkcprxwjpe
oqsujohmjhshhssggo...

output:

1
6
31
10
1
5
3
2
1
8
4
7
1
16
6
3
7
7
2
0
25
6
2
4
7
1
7
12
2
23
8
3
3
3
24
3
18
5
7
2
21
21
3
10
6
3
2
7
7
1
9
1
8
123
4
2
6
1
16
19
3
14
1
16
4
7
35
3
20
4
6
1
1
2
4
4
6
1
56
5
53
14
7
4
1
9
28
2
2
28
2
16
1
6
30
1
38
1
6
7
9
11
22
3
1
13
45
6
4
23
21
10
1
29
4
4
3
1
2
4
6
1
2
1
8
6
1
9
10
13
0
2...

result:

ok 11120 lines

Test #3:

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

input:

4
abcbcdcbd
abcdcbcbd
abcdefghijk
kjihgfedcba
ababcbab
ababcbab
abcbababcbababcbababcbab
abcbababcbababcbababcbab

output:

3
1
14
75

result:

ok 4 lines

Extra Test:

score: 0
Extra Test Passed