제출 #1225442

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225442		Malix	Palindromic Partitions (CEOI17_palindromic)	C++20	60 / 100	10091 ms	10148 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;cin>>t;
    while(t--){
        string s;cin>>s;
        int n=s.size();
        int ans=n%2,pos=0;
        while(pos<n/2){cerr<<pos<<" ";
            deque<char> a,b;
            while(pos<n/2&&(a!=b||a.empty())){
                a.push_back(s[pos]);
                b.push_front(s[n-pos-1]);
                pos++;
            }
            if(a!=b){
                if(n%2==0)ans++;
                else continue;
            }
            else ans+=2;
        }
        cout<<ans<<"\n";
    }
}

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