提出 #64074676

---

ソースコード 拡げる

#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((x).size())
typedef long long ll;
using namespace std;
mt19937 rnd(348502);
const ll N = 5000010;
ll mod = 1e9 + 7;
ll mod1 = 998244353;

string s;
int p = 432;

ll dig[N], h[N];
ll dig1[N], h1[N];
void init()
{
    int n = s.size();
    dig[0] = 1; h[0] = 0;
    dig1[0] = 1; h1[0] = 0;
    for (int i = 0; i < n; i++)
    {
        dig[i + 1] = (dig[i] * p) % mod;
        dig1[i + 1] = (dig1[i] * p) % mod1;
        h[i + 1] = (h[i] * p + s[i]) % mod;
        h1[i + 1] = (h1[i] * p + s[i]) % mod1;
    }
}
pair<int, int> get_hash(int l, int r)
{
    int aa = (h[r + 1] - h[l] * dig[r - l + 1]) % mod;
    int bb = (h1[r + 1] - h1[l] * dig1[r - l + 1]) % mod1;
    if (aa < 0)aa += mod;
    if (bb < 0)bb += mod1;
    return { aa, bb };
}

string s1;

ll hhak[N];
ll h1hak[N];
void init1()
{
    int n = s1.size();
    hhak[0] = 0;
    h1hak[0] = 0;
    for (int i = 0; i < n; i++)
    {
        hhak[i + 1] = (hhak[i] * p + s1[i]) % mod;
        h1hak[i + 1] = (h1hak[i] * p + s1[i]) % mod1;
    }
}
pair<int, int> get_hash1(int l, int r)
{
    int aa = (hhak[r + 1] - hhak[l] * dig[r - l + 1]) % mod;
    int bb = (h1hak[r + 1] - h1hak[l] * dig1[r - l + 1]) % mod1;
    if (aa < 0)aa += mod;
    if (bb < 0)bb += mod1;
    return { aa, bb };
}

void solve()
{
    int i, j;
    cin >> s;
    s1 = s;
    reverse(all(s1));
    init();
    init1();
    int ind = 0;
    for (i = 0; i < s.size(); i++)
    {
        if (get_hash(i, s.size() - 1) == get_hash1(0, s.size() - 1 - i))
        {
            ind = i;
            break;
        }
    }
    for ( i = 0; i < s.size(); i++)
    {
        cout << s[i];
    }
    for (i = s.size() - 1 - (s.size() - ind); i >= 0; i--)
    {
        cout << s[i];
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘void solve()’:
Main.cpp:90:19: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   90 |     for (i = 0; i < s.size(); i++)
      |                 ~~^~~~~~~~~~
Main.cpp:98:20: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   98 |     for ( i = 0; i < s.size(); i++)
      |                  ~~^~~~~~~~~~
Main.cpp:83:12: warning: unused variable ‘j’ [-Wunused-variable]
   83 |     int i, j;
      |            ^

ジャッジ結果