提出 #70606968

---

ソースコード 拡げる

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#ifdef jlocal
#include<jdebug/debug.hpp>
#else
#define debug(...) 0;
#endif

using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef vector<pii> vii;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#if defined(__LP64__) || defined(_WIN64)
typedef __int128 lll;
#else
typedef long long lll;
#endif

#define pcount(x) __builtin_popcount(x)
#define pcountll(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()

const ld pi = 3.14159265358979323846L;
const ld sqrt2 = 1.41421356237309504880L;

template<class T>
istream& operator>>(istream& in, vector<T> &a){
	for (int i = 0; i < a.size(); i ++)
		in >> a[i];
	return in;
}

template<class T>
ostream& operator<<(ostream& out, vector<T> &a){
	for (int i = 0; i < a.size(); i ++){
		if (i > 0) out << ' ';
		out << a[i];
	}
	return out;
}

#if defined(__LP64__) || defined(_WIN64)

istream& operator>>(istream& in, __int128 &x){
	string S;
	in >> S;
	for (char &y : S){
		x *= 10;
		x += (y - '0');
	}
	return in;
}

ostream& operator<<(ostream& out, __int128 &x){
	string s;
	while(x > 0){
		s.push_back((x % 10) + '0');
		x /= 10;
	}
	if (s.size() == 0)
		s.push_back('0');
	reverse(all(s));
	return out << s;
}

#endif

mt19937_64 MT64;
void pre_init() {
	MT64 = mt19937_64(chrono::system_clock::now().
	time_since_epoch().count());
}

template<class T>
vector<int> prefix(T &S) {
  vector<int> P(S.size());
  P[0] = 0;
  for(int i = 1; i < S.size(); ++ i) {
    P[i] = P[i - 1];
    while(P[i] > 0 && S[P[i]] != S[i]) 
      P[i] = P[P[i] - 1];
    if(S[P[i]] == S[i]) 
      ++ P[i];
  }
  return P;
}

void solve(int caso){
	string a, b;
	cin >> a >> b;
	b = b + "2" + a + a;
	vector<int> p = prefix(b);
	for (int i = (int)a.size() + a.size(); i < b.size(); i ++){
		if (p[i] == a.size()){
			cout << i - (int)a.size() - (int)a.size() << '\n';
			return;
		}
	}
	cout << "-1\n";
}

int main(){
#ifndef jlocal
	ios::sync_with_stdio(0); cin.tie(0);
#endif
	pre_init();

	int t;
	cin >> t;
	for (int i = 1; i <= t; i ++){
		solve(i);
	}
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function 'void solve(int)':
./Main.cpp:101:50: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for (int i = (int)a.size() + a.size(); i < b.size(); i ++){
      |                                                ~~^~~~~~~~~~
./Main.cpp:102:26: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |                 if (p[i] == a.size()){
./Main.cpp:96:16: warning: unused parameter 'caso' [-Wunused-parameter]
   96 | void solve(int caso){
      |            ~~~~^~~~
./Main.cpp: In instantiation of 'std::vector<int> prefix(T&) [with T = std::__cxx11::basic_string<char>]':
./Main.cpp:100:24:   required from here
  100 |         vector<int> p = prefix(b);
      |                         ~~~~~~^~~
./Main.cpp:86:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |   for(int i = 1; i < S.size(); ++ i) {
      |                  ~~^~~~~~~~~~

ジャッジ結果