oj.uz

Submission #164440

# Submission time Handle Problem Language Result Execution time Memory
164440 2019-11-20T15:20:04 Z kungfulon Palindromic Partitions (CEOI17_palindromic) C++14
0 / 100
 4 ms 376 KB 
///Phạm Nguyễn Tuấn Hoàng///
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a);i <= (b);i++)
#define repd(i,a,b) for(int i = (a);i >= (b);i--)
#define F first
#define S second
#define PB push_back
#define Task ""
using namespace std;
//template <class T> inline read(T &a){a = 0;char c;bool nega = 0;while(!isdigit(c = getchar()) && c != '-');if(c == '-') nega = 1,c = getchar();a = c - 48;while(isdigit(c = getchar()))a = a * 10 + c - 48;if(nega) a = -a;}
//template <class T> inline writep(T a){if(a > 9) writep(a / 10);putchar(a % 10 + 48);}
//template <class T> inline write(T a){if(a < 0) putchar('-'),a = -a;writep(a);putchar(' ');}
//template <class T> inline writeln(T a){write(a);putchar('\n');}
const int mod = 1000000007,base = 31;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    freopen(Task".inp","r",stdin);
//    freopen(Task".out","w",stdout);

    int T;
    cin >> T;
    while(T--)
    {
        string s;
        cin >> s;
        int n = s.size();
        s = ' ' + s;
        int End = n,Begin = 1,cnt = 0,lastEnd = n + 1;
        long long h1 = 0,h2 = 0,hh = 1;
        while(End > Begin)
        {
            h1 = (h1 * base + s[Begin]) % mod;
            h2 = (s[End] * hh + h2) % mod;
            hh = hh * base % mod;
            if(h1 == h2)
            {
                cnt += 2;
                lastEnd = End;
                h1 = h2 = 0;
                hh = 1;
            }
            End--,Begin++;
        }
        cout << cnt + (lastEnd != Begin) << '\n';
    }
    return 0;
}

Compilation message

palindromic.cpp: In function 'int main()':
palindromic.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(Task".inp","r",stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -