Edited by author 04.10.2021 02:11

   abc  a
 abc    a

ans
   abc  a

Add test.
My solution O(n^2) on python AC

wordd
wo dd
ans??

please post it (read chunk) here or give some piece of code, many sanx!

For example solution number 4974296 time is 0.75. This solution does not use either Z-function or KMP, just std::string::find.

Admins, is it intended solution complexity for this problem or time limit should be decreased to for example 0.5 s?

I use KMP algorithm but i've got TLE at #9
my code is:
[code deleted]

what can I improve? How did you solve-it?

Edited by author 09.04.2011 20:54

#include <cstdio>

#define forn(i, n) for (int i = 0; i < (int)(n); i++)

int main()
{
  int n = (int)1e5;
  forn(i, n)
    putchar('a');
  puts("");
  forn(i, n / 2)
    putchar('a' + (i == n / 4));
  puts("");
  return 0;
}

Submission 3766657 should get TLE.

My algorithm is greed.

Why?!

What does really mean Crash(Access violation)?

KISS! There is no TA even if you use:
from.find(to.substr(to_position, length), from_position)

program ministerstvo;
var a,n,i,b,j,k,p,l:longint;
    s,w,q,r:string;
begin
readln(s);
readln(w);
n:=length(s);
k:=length(w);
i:=1;
j:=1;
l:=1;
p:=1;
while i<n do begin
if s[i]<>w[j] then begin
while s[p]<>w[l] do begin
if s[p]=' ' then
s[p]:=' ' else
s[p]:='_';
p:=p+1;
i:=i+1;
end;
end;
if s[i]=w[j] then begin
i:=i+1;
j:=j+1;
l:=j;
p:=i;
end;
end;
k:=0;
for i:=1 to n do
if s[i]<>'_' then k:=k+1;
if k<length(w) then
writeln('I HAVE FAILED!!!')
else
begin
if w[length(w)]=s[n] then
write(s[i])
else
begin
for i:=1 to n-1 do
write(s[i]);
end;
end;
end.

Is string comparing case-sensitive?

f.e. if word WORD
for WD W__D is right?

Edited by author 01.11.2009 16:44