Submission #1300460

#TimeUsernameProblemLanguageResultExecution timeMemory
1300460uranhishigPalindromic Partitions (CEOI17_palindromic)C++20
60 / 100
10083 ms3948 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define all(a) (a).begin(),(a).end() #define rep(i, n) for(int i = 0; i < (n); i++) const int mod = 1000000007; signed main(){ int t; cin >> t; while(t--){ string s; cin >> s; int n = s.size(); string l, r; int ans = 0; for (int i = 0; i < n/2; i++) { l = l + char(s[i]); r = s[n-1-i]+r; if(l == r){ ans+=2; l=""; r=""; } } if((l!="" and r!="")||n%2 ){ ans++; } cout << ans << endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...