| ENG RUS | Timus Online Judge |
Discussion of Problem 1941. Scary Martian WordandreyDagger Stupid task (RTE 13) // Problem 1941. Scary Martian Word 28 Nov 2021 11:47 Length of the first string can be bigger than length of the second string. I spent 15 submissions to realise this Mahilewets I was using STL container to store inequal words [1] // Problem 1941. Scary Martian Word 4 Jul 2017 17:49 When I was using STD::SET and STD::MAP, it was TLE #18. When I switched to STD::UNORDERED_SET and STD::UNORDERED_MAP, it was ACCEPTED 0.6 sec 38 MB. I was using reserve (1<<16) and max load factor of 0.25. Mahilewets Re: I was using STL container to store inequal words // Problem 1941. Scary Martian Word 5 Jul 2017 00:16 After replacing everything by STD::VECTOR Accepted 46 ms 15 MB Felix_Mate Format of input [1] // Problem 1941. Scary Martian Word 9 Jul 2016 19:03 Братаны-кодеры в этой задаче нужен особый подход к считыванию Из условия неясно,какой формат,но пока что он следущий(.=пробел): ххх.ххх.ххх и т.д. ууу.ууу.ууу.ууу и т.д. Не используйте на Паскале eof,eoln. Часть моего говнокода: ... s:string[4]; ... len:=1; read(s); inc(c[90*90*(ord(s[1])-33)+90*(ord(s[2])-33)+(ord(s[3])-33)]); f:=length(s)=4; while f do begin inc(len); read(s); inc(c[90*90*(ord(s[1])-33)+90*(ord(s[2])-33)+(ord(s[3])-33)]); f:=length(s)=4; end; ... Mahilewets Re: Format of input // Problem 1941. Scary Martian Word 4 Jul 2017 17:50 Timus is not an image board That is not 2ch or 4ch There is no need to use such words Felix_Mate What is format of input? [1] // Problem 1941. Scary Martian Word 8 Jul 2016 21:26 По условию может быть так(.-пробел):.........aaa.bbb.ссс. .....xxx.aaa.bbb.ccc. или .........aaa.bbb.ссс........ .....xxx.aaa.bbb.ccc........??????? И вообще,как в ЭТОЙ задаче считывать данные(на Паскале)? Edited by author 08.07.2016 21:27 Jane Soboleva (SumNU) Re: What is format of input? // Problem 1941. Scary Martian Word 8 Jul 2016 22:43 Не может. В начале пробелов нет, между каждой группой ровно один пробел. Я делаю так: readln(s); i:=1; while i <= length(s) do begin //process [i], [i + 1], [i + 2] inc(i, 4); end; Felix_Mate WA1! Who can give some tests? [1] // Problem 1941. Scary Martian Word 7 Jul 2016 23:27 I tested my prog but I not found mistake Jane Soboleva (SumNU) Re: WA1! Who can give some tests? // Problem 1941. Scary Martian Word 7 Jul 2016 23:35 Did you receive my email from a month ago? draak_krijger What is test case# 2 ? please help me . // Problem 1941. Scary Martian Word 11 Jan 2016 01:21 lasercat The array should be large, as large as possible // Problem 1941. Scary Martian Word 5 Jul 2014 21:57 if you stuck on WA#17, try enlarging your array size ^_< [TDUweAI] daminus test 2 [1] // Problem 1941. Scary Martian Word 5 Jan 2013 15:08 what can be in test 2///// ASK Re: test 2 // Problem 1941. Scary Martian Word 19 Feb 2014 00:13 I guess it is an anti-hash string <https://en.wikipedia.org/wiki/Thue%E2%80%93Morse_sequence> My additive hash with N=10 uint64_t still works, while N=5 does not: F(i,N) r[i] += ((a<<40) ^ (b<<20) ^ c) * s[i] % q[i] a,b,c are letters; s[i] and q[i] are primes; F(i,n) is for(int i = 0; i < (n); ++i) Vladimir Plyashkun [CSU] What is optimal asymptotic? [1] // Problem 1941. Scary Martian Word 4 Jul 2013 23:06 What is optimal asymptotic for this problem? My algo has O(M*log(N)) where N - length of scary Martian word, and M - length of text of Ovchinnikov's book, but i have TLE on 21th test Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Re: What is optimal asymptotic? // Problem 1941. Scary Martian Word 5 Jul 2013 00:10 O(M + N) is optimal. But maybe you can succed with your asymptotic if use fast I/O tyomitch the limits are so generous [2] // Problem 1941. Scary Martian Word 19 Feb 2013 19:47 that you needn't parse the Martian letters, you can keep them as opaque strings, using them as map keys Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Re: the limits are so generous // Problem 1941. Scary Martian Word 19 Feb 2013 22:34 Why not? The problem is assumed to be warm-up on the contest - so any solutions with comparable asymptotics should pass without a problem aslan7470 Re: the limits are so generous // Problem 1941. Scary Martian Word 20 Mar 2013 21:16 Двигаем по книге "окно" длиной со "страшное слово", проверяем чтобы кол-во каждого символа алфавита в подстроке было строго равно колв-у того же символа в "страшном слове", обновляем на -1/+1 кол-ва для первого и последнего символов соотв-о. Для быстрой проверки каждой позиции по всем символам, входящим в "страшное слово" держать массив номеров символов, причем не удовлетворяющие условию кол-ва перемещать в начало, удовлетворяющие - в конец, тогда будет не больше двух сравнений на позицию Aliaksei About compilator [2] // Problem 1941. Scary Martian Word 5 Jan 2013 17:34 What I have to include for using function getline(cin,S)? Nazarbek Altybay Re: About compilator // Problem 1941. Scary Martian Word 5 Jan 2013 17:37 string Nazarbek Altybay Re: About compilator // Problem 1941. Scary Martian Word 5 Jan 2013 17:37 include <string> Edited by author 05.01.2013 17:37 [TDUweAI] daminus AHMEDE // Problem 1941. Scary Martian Word 5 Jan 2013 17:13 ahmet mende altynjy barlag yalnysh jogap diyya, name bolmagy mumkin? mysal yaz hany shona.... hnustpengtuo How many cases here? [2] // Problem 1941. Scary Martian Word 5 Jan 2013 13:46 How many cases here? Soal Re: How many cases here? [1] // Problem 1941. Scary Martian Word 5 Jan 2013 14:31 1... 我终于过这题了 hnust_tongguang Re: How many cases here? // Problem 1941. Scary Martian Word 5 Jan 2013 15:43 <- Edited by author 05.01.2013 15:44 Anatoly What is the answer to this test? [1] // Problem 1941. Scary Martian Word 5 Jan 2013 15:36 aaa aaa bbb aaa aaa bbb ccc aaa zzz aaa bbb ccc I think that it should be 1. right? [TDUweAI] daminus Re: What is the answer to this test? // Problem 1941. Scary Martian Word 5 Jan 2013 15:40 yes, right [TDUweAI] daminus ANSISTRING [1] // Problem 1941. Scary Martian Word 5 Jan 2013 13:13 Can ansistring (pascal) take 500000*3+const symbols? Edited by author 05.01.2013 14:25 BUPT_Madoka Re: ANSISTRING // Problem 1941. Scary Martian Word 5 Jan 2013 13:33 english please..
|