oj.uz

Submission #1096987

# Submission time Handle Problem Language Result Execution time Memory
1096987 2024-10-05T15:43:07 Z vjudge1 Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 152 ms 24420 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353,moi=1e6+111,base=311,mod1=1e9+7,base1=331;
string s,t;
int n;
bool check;
ll Pow[moi],Hash[moi];
int gethash(int i,int j)
{
    return (Hash[j]-Hash[i-1]*Pow[j-i+1]%mod+mod)%mod;
}
void Input()
{
 int x;
 cin>>x;
 while(x--)
 {
 int res=0;
 cin>>s;
 n=s.size();
 s=" "+s;
 Pow[0]=1;
 Hash[0]=0;
 for(int i=1;i<=n;i++)
 {
    Pow[i]=Pow[i-1]*base%mod;
    Hash[i]=(Hash[i-1]*base%mod+s[i]-'a')%mod;
 }
 int l=1,r=n;
 for(int i=1,j=n;i<j;i++,j--)
 {
   ll hash1=gethash(l,i);
   ll hash2=gethash(j,r);
   if(hash1==hash2)
   {
     res+=2;
     l=i+1;
     r=j-1;
   }
 }
 if(l<=r)res++;
 cout<<res<<'\n';
 }
}
int main()
{
 ios_base::sync_with_stdio(false);
 cin.tie(NULL);
 cout.tie(NULL);
 if(fopen("a.inp","r"))
 {
 freopen("a.inp","r",stdin);
 freopen("a.out","w",stdout);
 }
 Input();
}

Compilation message

palindromic.cpp: In function 'int main()':
palindromic.cpp:53:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |  freopen("a.inp","r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~
palindromic.cpp:54:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |  freopen("a.out","w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 152 ms 23092 KB Output is correct
15 Correct 86 ms 20856 KB Output is correct
16 Correct 137 ms 24420 KB Output is correct
17 Correct 72 ms 12248 KB Output is correct