oj.uz

답안 #710256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710256 2023-03-15T06:11:30 Z ktkerem Palindromic Partitions (CEOI17_palindromic) C++17
0 / 100
 1 ms 328 KB 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define llll std::pair<ll , ll>
#define pb push_back
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
#define debug std::cout << "!!ALERT ALERT!!" << std::endl;
const ll limit = 1e18+7;
const ll sus = 1e5 + 5;
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll a , ll b){
    return (rng() % (b-a+1)) + a;
}
/*global variables*/
ll n;std::string h;
/**/
/*functions*/
ll binpow(ll x , ll y){
    ll g = 1;
    while(y){
        if(y & 1){
            g*=x;
            g%=limit;
        }
        x*=x;
        x%=limit;y/=2;
    }
    return g;
}
/**/
void solve(){
    std::cin >> h;
    n = h.size();
    ll fo = 0 ,so = 0;
    ll l = 0 , r = n-1;
    ll ls = 1;
    ll ans = 1;
    while(r > l){
        fo = ((fo * 31) + (h[l] - 'a' + 1))%limit;
        so = (so + (binpow(31 , ls - 1) * (h[r] - 'a' + 1)))%limit;
        //std::cout << fo << " " << so << "\n";
        if(fo == so){
            if(r-1 == l){
                ans--;
            }
            ans+=2;
            fo = 0;so = 0;
            ls = 0;
        }
        r--;l++;
        ls++;
    }
    std::cout << ans << "\n";
    return;/**/
}
int main(){
    std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
    /*#ifndef ONLINE_JUDGE
        freopen("in.txt" , "r" , stdin);
        freopen("out.txt" , "w" , stdout);
    #endif*/
    ll t = 1;
    std::cin >> t;
    while(t--){
        solve();
    }
}

Compilation message

palindromic.cpp:5:78: warning: "/*" within comment [-Wcomment]
    5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
      |

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -