Submission #70607546
Source Code Expand
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
#include <vector>
// MP
template<typename T>
class MP {
public:
MP(const T& t) : t(t) {
build();
}
std::vector<int> findAll(const T& s) {
std::vector<int> res;
int j = 0;
for (int i = 0; i < s.size(); ++i) {
while (j != -1 && t[j] != s[i]) j = a[j];
j++;
if (j == n) {
res.push_back(i - j + 1);
j = a[j];
}
}
return res;
}
void dump() {
for (auto e : a)std::cout << e << " ";
std::cout << std::endl;
}
private:
int n;
T t;
std::vector<int> a;
void build() {
n = t.size();
a = std::vector<int>(n + 1);
a[0] = -1;
int j = -1;
for (int i = 0; i < n; ++i) {
while (j != -1 && t[j] != t[i]) j = a[j];
j++;
a[i + 1] = j;
}
}
};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t; cin >> t;
while (t--) {
string a, b;
cin >> a >> b;
a += a;
MP mp(b);
auto v = mp.findAll(a);
if (v.empty()) {
cout << -1 << endl;
}
else {
cout << v[0] << endl;
}
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | E - Shift String |
| User | kwm_t |
| Language | C++23 (GCC 15.2.0) |
| Score | 450 |
| Code Size | 1875 Byte |
| Status | AC |
| Exec Time | 21 ms |
| Memory | 16300 KiB |
Compile Error
./Main.cpp: In instantiation of 'std::vector<int> MP<T>::findAll(const T&) [with T = std::__cxx11::basic_string<char>]':
./Main.cpp:70:22: required from here
70 | auto v = mp.findAll(a);
| ~~~~~~~~~~^~~
./Main.cpp:31:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | for (int i = 0; i < s.size(); ++i) {
| ~~^~~~~~~~~~
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 450 / 450 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt |
| All | killer_01.txt, sample_01.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| killer_01.txt | AC | 14 ms | 3592 KiB |
| sample_01.txt | AC | 1 ms | 3496 KiB |
| test_01.txt | AC | 1 ms | 3456 KiB |
| test_02.txt | AC | 1 ms | 3624 KiB |
| test_03.txt | AC | 1 ms | 3524 KiB |
| test_04.txt | AC | 1 ms | 3524 KiB |
| test_05.txt | AC | 1 ms | 3596 KiB |
| test_06.txt | AC | 3 ms | 3588 KiB |
| test_07.txt | AC | 3 ms | 3640 KiB |
| test_08.txt | AC | 18 ms | 3524 KiB |
| test_09.txt | AC | 18 ms | 3468 KiB |
| test_10.txt | AC | 13 ms | 3608 KiB |
| test_11.txt | AC | 13 ms | 3624 KiB |
| test_12.txt | AC | 13 ms | 3652 KiB |
| test_13.txt | AC | 12 ms | 3588 KiB |
| test_14.txt | AC | 14 ms | 4388 KiB |
| test_15.txt | AC | 15 ms | 4392 KiB |
| test_16.txt | AC | 15 ms | 11248 KiB |
| test_17.txt | AC | 14 ms | 11204 KiB |
| test_18.txt | AC | 11 ms | 16300 KiB |
| test_19.txt | AC | 10 ms | 16220 KiB |
| test_20.txt | AC | 9 ms | 14180 KiB |
| test_21.txt | AC | 9 ms | 14340 KiB |
| test_22.txt | AC | 8 ms | 13056 KiB |
| test_23.txt | AC | 7 ms | 11364 KiB |
| test_24.txt | AC | 8 ms | 11256 KiB |
| test_25.txt | AC | 8 ms | 11212 KiB |
| test_26.txt | AC | 8 ms | 11200 KiB |
| test_27.txt | AC | 11 ms | 11264 KiB |
| test_28.txt | AC | 10 ms | 11228 KiB |
| test_29.txt | AC | 10 ms | 11080 KiB |
| test_30.txt | AC | 11 ms | 11208 KiB |
| test_31.txt | AC | 9 ms | 11184 KiB |
| test_32.txt | AC | 11 ms | 11140 KiB |
| test_33.txt | AC | 11 ms | 11144 KiB |
| test_34.txt | AC | 10 ms | 11196 KiB |
| test_35.txt | AC | 9 ms | 11196 KiB |
| test_36.txt | AC | 10 ms | 11140 KiB |
| test_37.txt | AC | 10 ms | 11216 KiB |
| test_38.txt | AC | 10 ms | 11140 KiB |
| test_39.txt | AC | 9 ms | 11184 KiB |
| test_40.txt | AC | 11 ms | 11196 KiB |
| test_41.txt | AC | 11 ms | 11256 KiB |
| test_42.txt | AC | 10 ms | 11192 KiB |
| test_43.txt | AC | 9 ms | 11260 KiB |
| test_44.txt | AC | 16 ms | 11196 KiB |
| test_45.txt | AC | 16 ms | 11184 KiB |
| test_46.txt | AC | 16 ms | 11216 KiB |
| test_47.txt | AC | 7 ms | 3632 KiB |
| test_48.txt | AC | 7 ms | 3604 KiB |
| test_49.txt | AC | 21 ms | 11196 KiB |
| test_50.txt | AC | 21 ms | 11204 KiB |