Submission #1277048

#TimeUsernameProblemLanguageResultExecution timeMemory
1277048PlayVoltzPalindromic Partitions (CEOI17_palindromic)C++20
0 / 100
0 ms336 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> #include <random> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second const int A = 696967; const int B = 1000000007; int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin>>t; while (t--){ string s; cin>>s; int i=0, ans=0; while (i<s.size()/2){ int l=0, r=0; for (int e=1; i<s.size()/2; ++i, e=(e*A)%B){ l=(l*A+s[i])%B; r=(r+s[s.size()-i-1]*e)%B; if (l==r)break; } if (i==s.size()/2)break; ++i; ans+=2; } cout<<ans+1<<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...