| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| some tests for wa7 | 🦄Imosk72🦄∭GTGU∭ | 1532. Трудности перевода | 23 мар 2019 20:29 | 1 |
2
jsesi
jesfi
2
tvtx
vtix
2
qfqejjfhrhono
fqwejjfhrhono
2
mciqibekphze
mcqibmekphze
2
affjoromdta
affjromjdta
all answers should contain both strings |
| first test is sample? WA1 | kaifonaft | 1532. Трудности перевода | 18 янв 2018 21:23 | 2 |
Yes. First test is sample. I check it!)
//WA 2: ))
Console.WriteLine(@"5
moina
morna
palpa
papa
pella");
Just wrong sort in my program. |
| Judges, does solution exist for JAVA? | Smog | 1532. Трудности перевода | 22 ноя 2008 00:24 | 6 |
I've got TLE on 7st test.
I use Ukkonen algorithm for comparing pairs of strings (it does O(2*m) time) and O(n*(n+1)/2) for excess all pairs.
So, it must be O((5000+1)*2500*15*2) time.
Isn't it enough? There is a much simplier solution with the same complexity, and with less constant To [SPbSU ITMO] WiNGeR :
Do you use any input filters before an algorithm of O(n^2)?
(For example
The difference in the length of compared words mustn't be more than 2.
Sets of symbols of two words cann't consist of more than 4 different symbols.
Or anything else?
) Mine solution is almost same... get's TLE on 6th test.
I've tried that "dirty" tricks (as length checking) before difference calcultion beetwen words.
It seems that it's unsolvable on JAVA (noone has got AC in JAVA, i watched :) )
Mb will write same on CPP... There is much faster O(n) check.
Just one for and some if.
However i write in CPP :) |
| WA#5 | EarthShaker | 1532. Трудности перевода | 14 ноя 2008 07:44 | 1 |
WA#5 EarthShaker 14 ноя 2008 07:44 |
| WA#7 | AlexF [USTU Frogs] | 1532. Трудности перевода | 7 окт 2008 23:01 | 4 |
WA#7 AlexF [USTU Frogs] 20 авг 2007 11:27 Please, give me a hint about this test Re: WA#7 Loky_Yuri [USTU] 20 авг 2007 19:54 This test helped me passed 7 test. Hope, it will help you too:
2
combo
cobra
Answer is 0.
And this is just good test:
2
cooa
combo
The answer is 0.
GOOD LUCK! Re: WA#7 AlexF [USTU Frogs] 21 авг 2007 10:58 Thanks, my friend) AC at last)) I should be more attentive)
Edited by author 21.08.2007 17:06 2
aaa
cabaa
One more test. answer is 2.
But it didn't helped me :( |
| you have WA #7? hope, it help you =) (+) | Dart MirzMan C++ Edition (Mirzoyan Alexey, Rybinsk SAAT) | 1532. Трудности перевода | 24 авг 2007 21:35 | 1 |
Test 1:
2
aaabaaaaabaaaaa
aaaabaaaaabaaaa
ans:
2
aaaabaaaaabaaaa
aaabaaaaabaaaaa
Test 2:
2
abcdef
absdf
ans:
2
abcdef
absdf
At least at helped me =) |
| Texnical Problem - Compilation error? | awpris | 1532. Трудности перевода | 10 мар 2007 22:09 | 1 |
My Pascal code in Free Pascal compiling - not error.
ID = 1569544
Help my, please...
===
Answer in FAQ.
Thank.
Edited by author 11.03.2007 10:13 |
| Problem 1532 "Lost in Translation". New tests have been added (+) | Vladimir Yakovlev (USU) | 1532. Трудности перевода | 10 мар 2007 00:52 | 1 |
New tests have been added, AC submissions have been rejudged, 7 authors lost AC. |
| What is the answer? (+) | Samsonov Alex [USU] | 1532. Трудности перевода | 8 мар 2007 16:30 | 3 |
What is the correct answer for this test:
4
aaaaaa
bbaaaa
bbccaa
bbccdd
Does it contain 3 or 4 words? 4 (-) Ivankov Dmitry 8 мар 2007 15:22 |
| 1532 some test | svr | 1532. Трудности перевода | 5 мар 2007 03:12 | 2 |
What an answer for the test:
2
abcde
bcdeh
I think:
2
abcde
bcdeh |
| answer 1 | ExPerT | 1532. Трудности перевода | 4 мар 2007 22:19 | 2 |
When the answer will be 1? |
| What is test 4? | ExPerT | 1532. Трудности перевода | 4 мар 2007 21:45 | 1 |
My prog has WA#4
But I do not understend why. Help me!
Give some test
GL ;) |
| 1532 specifics | svr | 1532. Трудности перевода | 4 мар 2007 17:01 | 1 |
I thihk that the problem has interesting feature.
Relation in it is tolerance and not an order , therefore
ordered structures:trees,sets,dictionaries unapplicable. |
| what about this test | Todor Tsonkov | 1532. Трудности перевода | 3 мар 2007 19:29 | 4 |
3
aaab
acaa
bcba
What is the answer? I think the right answer is
3
aaab
acaa
bcba I think it could bi 2 or 1 because
2
aaab
bcba
and one if we choose
1
acaa
there are exactly 2 diferences My AC-program says
3
aaab
acaa
bcba
GL! |
| Can't pass the second test | Kai Wang | 1532. Трудности перевода | 3 мар 2007 16:55 | 1 |
what's the containt of the second test
Edited by author 03.03.2007 17:00 |
| Timelimit for Java | Jedi Knight | 1532. Трудности перевода | 3 мар 2007 16:27 | 1 |
Timelimit for java is 4 seconds like c++, but java is slower than c++. Can you increase TL for java? |
| pella | Mykola [Lviv NU] | 1532. Трудности перевода | 3 мар 2007 13:11 | 3 |
pella Mykola [Lviv NU] 3 мар 2007 13:04 why did "pella" is included? |
