|
|
I tried the following: For every recognized language find the minimum and the maximum possible lines. Then find the maximum and minimum possible lines for all. For minimum to maximum test if it divides N. This solves the first four tests. Is this the right way? Try to form k languages (or k groups) where k is divider of N. Mine is N^2 solution. I go through the divisors of the number N and check if the array can be split into I phrases by the condition Sorry for my English .....и что объявление произнесли на каждом языке не более одного раза. третий вариант 3 zulu zulu zulu ответ 1 язык Try this test: 10 e e f f unknown g unknown g d d Answer: Igor is wrong. But my programm gave me "5", because i forgot check v[j] when last="unknown". if (last == "unknown" && v[j] != "unknown") { last = v[j]; if (m[last] == true) f = false; } Кто может объяснить второй тест, почему нет решений? потому что в условии сказано: "объявление произнесли на каждом языке не более одного раза" а во втором случае дважды проскакивает english. Значит Игорь ошибся. can you say which alhoritm it is? topologial sort? I spent so much time to figure out my mistakes(You can see it from my attempts :) ). You can save your time by checking theese tests. Hope they are helpful. 4 unknown unknown unknown unknown Answer: 1 2 4 2 unknown unknown Answer: 1 2 12 A B unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown Answer: 12 4 A B C D Answer: 4 8 A A B B unknown unknown unknown unknown Answer: 4 6 A A B B unknown unknown Answer: 3 6 unknown A A B unknown B Answer: 2 6 A unknown unknown A unknown unknown Answer: 1 6 A unknown A unknown unknown unknown Answer: 1 2 4 A A A B Answer: Igor is wrong. First and second tests are not correct. "It is guaranteed that Igor could recognize the language of at least one of the phrases." Some Others: 8 A unknown B unknown unknown unknown unknown unknown Answer: 4 8 10 unknown unknown unknown A unknown unknown unknown unknown B unknown Answer: 2 5 10 12 unknown A unknown unknown unknown B unknown unknown unknown C unknown unknown Answer: 3 4 6 12 12 unknown A unknown unknown unknown B unknown D unknown C unknown unknown Answer: 4 6 12 12 unknown A unknown unknown unknown B unknown D D C unknown unknown Answer: 4 Could anyone suggest any test cases. Out of ideas about what could wrong to get WA#14 As I see it, Igor heard english unknown unknown unknown german unknown and the groups should match. How do the first and the last one match? Because announcement contains three phrases:
english english english german german german Why WA5? In my case, it was because I reserved only 20 chars for the language name (no space for the terminating zero). Try this test: 4 12345678901234567891 12345678901234567890 12345678901234567891 unknown answer: Igor is wrong. anybody can tell me why input test are correct??????????? скинте ответ если не жалко плиз... hi to everybody! i don't understand the second test! i think that igor could hear english phrase two times and french phrase too! unknown = french! am i right? can anyone help? No two languages can only go consecutive. :) Why in 3 test answer 1? Igor should hear 3 phrases on different language Edited by author 29.10.2011 14:18 Edited by author 29.10.2011 14:18 |
|
|