Submission #203622

#	Time	Username	Problem	Language	Result	Execution time	Memory
203622		thebes	Palindromic Partitions (CEOI17_palindromic)	C++14	100 / 100	629 ms	19048 KiB

palindromic

#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

namespace output{
    void __(short x){cout<<x;}
    void __(unsigned x){cout<<x;}
    void __(int x){cout<<x;}
    void __(long long x){cout<<x;}
    void __(unsigned long long x){cout<<x;}
    void __(double x){cout<<x;}
    void __(long double x){cout<<x;}
    void __(char x){cout<<x;}
    void __(const char*x){cout<<x;}
    void __(const string&x){cout<<x;}
    void __(bool x){cout<<(x?"true":"false");}
    template<class S,class T>
    void __(const pair<S,T>&x){__(DEBUG?"(":""),__(x.first),__(DEBUG?", ":" "),__(x.second),__(DEBUG?")":"");}
    template<class T>
    void __(const vector<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const set<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const multiset<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class S,class T>
    void __(const map<S,T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    void pr(){cout<<"\n";}
    template<class S,class... T>
    void pr(const S&a,const T&...b){__(a);if(sizeof...(b))__(' ');pr(b...);}
}

using namespace output;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef pair<ld,ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;

#define pb push_back
#define fox(i,x,y) for(int i=(x);i<=(y);i++)
#define foxr(i,x,y) for(int i=(y);i>=(x);i--)

const int MN = 1e6+6, mod = 1e9+3;
int t, n, i, j, k, hsh[MN], pw[MN]={1}, ans;
string s;

int get(int x,int y){
    int res = (hsh[y]-1LL*hsh[x-1]*pw[y-x+1]%mod)%mod;
    while(res>=mod) res-=mod;
    while(res<0) res+=mod;
    return res;
}

int main(){
    for(i=1;i<MN;i++) pw[i]=pw[i-1]*133LL%mod;
    scanf("%d",&t);
    for(;t;t--){
        cin >> s; n = s.size();
        for(i=1;i<=n;i++){
            hsh[i]=(hsh[i-1]*133LL+s[i-1]-'a'+1)%mod;
        }
        ans = 0;
        for(i=1;i<=n-i+1;i=j+1){
            for(j=i;j<=n;j++){
                if(get(i,j)==get(n-j+1,n-i+1)) break;
            }
            if(i==n-j+1) ans++;
            else ans+=2;
        }
        printf("%d\n",ans);
    }
    return 0;
}

Compilation message (stderr)

palindromic.cpp: In function 'int main()':
palindromic.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&t);
     ~~~~~^~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 40 / 40