OJ Board

I don't know the O() runtime, but I'm using Aho-Corasick for serching words which should have linear complexity and reserving memory for strings (so concatenations are done without any reallocation). I have second code with char[] and printf instead of string and cout but it gets about 15s on my com...

Can anyone tell me why do I get TLE? On the big input from this topic my program runs faster than accepted one (times: 0.9s and 1.1s). #include <iostream> #include <cstdio> #include <string> #include <cstring> #include <set> #include <queue> using namespace std; int counter[15000]; string dict[15000...

It's obvious but I'm interested why UVa Toolkit said "Yes".
What's more - this error is for every input like: is it because of bad algorithm? [don't need the answer]

Can someone tell me why the output for: is ? O_o

I've already wrote another code - AC
now my old code got AC too, after one little change, thanks to your input
thank you very much

first of all - it 's incorrect input but if this is AC output there is no option this input could be in tests, because UVa's anwser is: Test Case 1. Vladimir needs 0 litre(s) of blood. Test Case 2. Vladimir needs 0 litre(s) of blood. Test Case 3. Vladimir needs 0 litre(s) of blood. Test Case 4. Vlad...

can anyone help?
my code works fine for every input I found and I created, but still WA