Submission #492970

#	Time	Username	Problem	Language	Result	Execution time	Memory
492970		MilosMilutinovic	Palindromic Partitions (CEOI17_palindromic)	C++14	15 / 100	10030 ms	67904 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int n,_;
char s[105];

bool check(int l,int r,int len) {
	rep(i,0,len) if (s[l+i]!=s[r-(len-i)+1]) return false;
	return 1;
}

void solve() {
	scanf("%s",s);
	n=strlen(s);
	int l=0,r=n-1;
	int ans=0;
	while (l<=r) {
		if (l==r) {
			ans++;
			break;
		}
		if (l+1==r) {
			if (s[l]==s[r]) ans++;
			ans++;
			break;
		}
		int suc=1;
		rep(i,1,n) {
			if (l+i-1>=r-i+1) {
				suc=0;
				break;
			}
			if (check(l,r,i)) {
				ans+=2;
				l+=i,r-=i;
				break;
			}
		}
		if (!suc) {
			ans++;
			break;
		}
	}
	printf("%d\n",ans);
}

int main() {
	for (scanf("%d",&_);_;_--) {
		solve();
	}
}

Compilation message (stderr)

palindromic.cpp: In function 'void solve()':
palindromic.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  scanf("%s",s);
      |  ~~~~~^~~~~~~~
palindromic.cpp: In function 'int main()':
palindromic.cpp:66:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  for (scanf("%d",&_);_;_--) {
      |       ~~~~~^~~~~~~~~

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