# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14192 | paulsohn | 백신 (KOI13_vaccine) | C++98 | 41 ms | 5192 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int N,K;
vector<int> code[100], T[2000], cpy;
void mkt(int* p, int o){
int i=1,j=0;
T[o].push_back(-1);
while(i<K){
if(p[i]==p[j]){
T[o].push_back(j);
++i; ++j;
}
else if(j>0) j=T[o][j];
else{
T[o].push_back(0);
++i;
}
}
}
bool KMP(int r, int m){
int i=0,j=0,s=0;
while(i+j<code[r].size()){
if(code[r][i+j]==code[0][m+j]){
++j;
++s;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |