oj.uz

답안 #338031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338031 2020-12-22T09:41:58 Z rrrr10000 Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 443 ms 26080 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef vector<ll> vi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<PP> vpp;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
#define dupli(v) {sort(all(v));v.erase(unique(all(v)),v.end());}
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define fi first
#define se second
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
template<class T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T>void out(T a){cout<<a<<endl;}
template<class T>void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<endl;}
template<class T>void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<endl;}
template<class T>void outvp(T v){for(auto a:v)cout<<'('<<a.fi<<','<<a.se<<')';cout<<endl;}
template<class T>void outvv(T v){for(auto x:v)outv(x);}
template<class T>void outvvp(T v){for(auto x:v)outvp(x);}
const ll inf=1001001001001001001;
const int mod=1000000007;
int main(){
    ll t;cin>>t;
    rep(tt,t){
        ll ans=1;
        string s;cin>>s;
        vi fac(s.size()+1);
        vi mp(s.size()+1);
        mp[0]=1;
        rep(i,s.size())mp[i+1]=mp[i]*31%mod;
        rep(i,s.size())fac[i+1]=(fac[i]*31+(s[i]-'a'))%mod;
        ll l=0,r=s.size()-1,k=1;
        while(l<r){
            bool same=true;
            ll a=((fac[l+1]-fac[l-k+1]*mp[k])%mod+mod)%mod;
            ll b=((fac[r+k]-fac[r]*mp[k])%mod+mod)%mod;
            if(a==b){
                ans+=2;k=0;
            }
            l++;r--;k++;
        }
        if(k==1&&s.size()%2==0)ans--;
        out(ans);
    }
}

Compilation message

palindromic.cpp: In function 'int main()':
palindromic.cpp:45:18: warning: unused variable 'same' [-Wunused-variable]
   45 |             bool same=true;
      |                  ^~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 3 ms 532 KB Output is correct
12 Correct 5 ms 584 KB Output is correct
13 Correct 4 ms 580 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 3 ms 532 KB Output is correct
12 Correct 5 ms 584 KB Output is correct
13 Correct 4 ms 580 KB Output is correct
14 Correct 443 ms 24776 KB Output is correct
15 Correct 232 ms 22964 KB Output is correct
16 Correct 425 ms 26080 KB Output is correct
17 Correct 235 ms 15240 KB Output is correct