제출 #447492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
447492		Khizri	Palindromic Partitions (CEOI17_palindromic)	C++17	60 / 100	10087 ms	4688 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=n;
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
int t=1,ans;
void solve(){
	map<string,int>mp;
	string s;
	cin>>s;
	int l=0,r=s.size()-1;
	string a="",b="";
	ans=0;
	while(l<r){
		a+=s[l];
		b=s[r]+b;
		mp[a]++;
		mp[b]++;
		if(mp[a]==2){
			ans+=2;
			a="";
			b="";
		}
		mp.clear();
		l++,r--;
	}
	if(a.size()||b.size()||l==r){
		ans++;
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

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