oj.uz

답안 #939121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939121 2024-03-06T05:55:56 Z vjudge1 Palindromic Partitions (CEOI17_palindromic) C++17
0 / 100
 9 ms 3164 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fr first
#define sc second
const long long INF=1e17,N=2e5+6,mod=1e9+7;
int p=31;
int h[N],hsh[N];
int hesh(int l, int r){
	return (((hsh[r]-hsh[l-1]+mod)%mod)*h[N-r])%mod;
}
deque<int> c[29];
void solve(){
	string s;cin>>s;int n=s.size();
	h[0]=1;
	for(int i=1;i<N;i++){
		h[i]=(h[i-1]*p)%mod;
	}
	for(int i=1;i<=(int)s.size();i++){
		hsh[i]=(hsh[i-1]+((s[i-1]-'a'+1)*h[i-1])%mod)%mod;
	}
	int ans=0;
	for(int i=0;i<(n)/2;i++){
		int j=i;
		int l=n-i-1;
		bool ok=0;
		for(;j<(n)/2;j++,l--){
			//cout<<i<<' '<<j<<':'<<l<<' '<<n-i-1<<endl;
			//cout<<hesh(i+1,j+1)<<' '<<hesh(l+1,n-i)<<endl;
			//
			if(hesh(i+1,j+1)==(hesh(l+1,n-i))){
				ok=1;
				ans+=2;
				break;
			}
			//if(j==n/2) ans++;
		}
		
		//if(!ok) ans++;
		i=j;
	}
	cout<<ans+1<<endl;
}
main(){
	int T=1;
	cin>>T;
	while(T--){
		solve();
	}
}
/*
11
7958 4722 9704 6995 1052 5269 7479 8238 6423 7918 866
7659 2498 8486 1196 7462 6633 2158 2022 1146 8392 3037
*/

Compilation message

palindromic.cpp: In function 'void solve()':
palindromic.cpp:27:8: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   27 |   bool ok=0;
      |        ^~
palindromic.cpp: At global scope:
palindromic.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main(){
      | ^~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 3164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 3164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 3164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 3164 KB Output isn't correct
2 Halted 0 ms 0 KB -