# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1133539 | 79brue | Joyful KMP (KRIII5_JK) | C++20 | 12 ms | 24132 KiB |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int n;
string str;
int fail[1010101];
int cnt;
int grp[1010101];
vector<int> adj[1010101];
void kmp() {
int i = 1;
int j = 0;
cnt = 1;
vector<int> v;
while (i < n) {
if (str[i] == str[j]) {
grp[i] = grp[j];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |