Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
Hint | joaopfg | 1410. Трещина | 23 сен 2021 05:48 | 2 |
Hint joaopfg 29 июл 2018 07:18 Take care in the cases of multiple lines. I was thinking it wasn't possible and it was giving me WA5. When I took care of it I got AC. |
To admins | 👑OmegaLuL230👑 | 1410. Трещина | 25 фев 2020 22:51 | 1 |
My O(N^2) solution works for 0.187s but 10000 * 10000 = 1e8, it means that O(N^2) solution should work only for 1 second (not less), but in this task there is 0.5 sec and O(N^2) solution gets AC |
Nice TEST | Mescheryakov_Kirill [SESC17]💻 | 1410. Трещина | 3 ноя 2016 21:14 | 3 |
Nice TEST Mescheryakov_Kirill [SESC17]💻 3 ноя 2016 19:28 Input doesn't contain two equal words Sorry... It test is incorrect. |
TLE 12 (solved) | MishaRash | 1410. Трещина | 8 авг 2015 14:46 | 1 |
I had TLE on test 12 and realized that I used only simple recursion. Once I fixed it I got AC. Edited by author 08.08.2015 14:46 |
If you have problems with #31 | Vladislav | 1410. Трещина | 25 мар 2014 01:59 | 1 |
If you have problems with test #31, you must know that in test #31 there are now words)) only delimiter characters! |
Hint about Input | A.06 | 1410. Трещина | 19 сен 2013 18:49 | 2 |
Some of these are not mentioned in the problem statement - The input can have other separators than spaces, eg: 'Re ad' is two words and so is 'Re*ad' - There is no word with length 0, so there can be two separators, eg: 'Re**ad' is two words not three (if you have WA#6 check this) - Inputs are of multiple lines, so you can use EOF to check for end of input. Edited by author 09.04.2013 17:18 Edited by author 09.04.2013 17:18 |
WA on test 16 | xXx | 1410. Трещина | 23 апр 2013 14:28 | 6 |
[AC CODE] Edited by author 24.01.2006 19:33 Why? Edited by author 23.01.2006 22:29 thanx a lot , i got AC too!!! |
WA#5 Could not find mistake with my code | Nguyen Khac Tung | 1410. Трещина | 6 фев 2013 20:53 | 3 |
Var ch:Char; S:Array[-1..200000] of Longint; tmp:String; n,i,j,p,q,k,maxx:Longint; Function max(x,y:Longint):Longint; Begin If x>y then max:=x else max:=y; End; Begin tmp:=''; s[0]:=0; While not eof do Begin Read(ch); If ((ch in ['a'..'z']) or (ch in ['A'..'Z'])) then tmp:=tmp+ch Else If length(tmp)>0 then Begin inc(n); p:=length(tmp); If (n<3) then s[n]:=p Else s[n]:=max(s[n-2],s[n-3])+p; If s[n]>maxx then maxx:=s[n]; tmp:=''; End; End; If n=0 then Writeln(length(tmp)) Else Writeln(maxx); End. Please help. Tks HI!!! In 5 test ENTER))) Try to paste '$' between two lines))) Good day))) Edited by author 19.06.2012 00:36 Thanks a lot,I got AC after looking your hint! |
Problem 1410 "Crack". New limitations in the problem statement. Read site news. (-) | Sandro (USU) | 1410. Трещина | 4 окт 2012 12:17 | 1 |
|
Tests | Hanzbrow (TNU) KCC | 1410. Трещина | 9 фев 2012 19:20 | 4 |
Tests Hanzbrow (TNU) KCC 6 фев 2010 02:04 sdfa__Sdfa___fdsa__sdfaasdfa__asdfadsf____sdfa___adsfadsfa_sdaf_sdf_df__dsf__adsf__sadf_Sdf-_as answer 37 asd=asasd==aiii answer 7 asd=asasd==aiii answer 7 Answer 7 or 5 ??? In the word "aiii" sound "i" will be longer than a second... I understand the conditions? Re: Tests olpetOdessaONU [1 2/3] 14 июл 2011 13:32 I don't understand why the answer on the first test is 37. I can find only 30. And my program too. Re: Tests IgorKoval(from Pskov) 9 фев 2012 19:20 I don't understand why the answer on the first test is 37. I can find only 30. And my program too. dp[1]=4 dp[2]=4 dp[3]=8 dp[4]=13 dp[5]=16 dp[6]=17 dp[7]=25 dp[8]=21 dp[9]=28 dp[10]=27 dp[11]=31 dp[12]=32 dp[13]=35 dp[14]=35 dp[15]=37 ans = 37 |
Is the tests contain same word twice?(Answer included) | Ibragim Atadjanov (Tashkent U of IT) | 1410. Трещина | 9 ноя 2010 13:02 | 1 |
No. No test have the same word twice by the condition of the problem. Following tests are not correct(It's fact I got AC) 1.abc f abc 2.a a a a a .... |
Why WA ? | sgn | 1410. Трещина | 15 окт 2009 03:05 | 2 |
[code deleted] My program give right answers on all tests in this forum, but I have WA on test #2 :) Why ? :) Edited by moderator 22.02.2006 22:12 Re: Why WA ? Oleg Strekalovsky aka OSt [Vologda SPU] 15 окт 2009 03:05 check moment in reading words, when stream is over. You may not add last word to your dictionary... And Don't pay attention to 'miamlia'.(don't find same sounds) P.S. : It's strange, that in that language lowercase letters and Uppercase letters creates different sounds (A!=a) Edited by author 16.10.2009 01:19 |
WA on 12 too. I can't find why. Please HELP! | Strebkov_VI_SSAU | 1410. Трещина | 3 мар 2009 10:37 | 5 |
I surrender. What can be wrong with this code? [code deleted] Sorry for posting code. Please help! Edited by author 05.11.2005 20:58 Edited by moderator 22.02.2006 22:12 try this: abc ab ac def The answer is: 6 Other test (my program failed it): 2 3 4 The answer is: 0 One more test: a b c de f g hi The answer is: 5 Thank you for tests. My program outputs '6' in the last one and right answers in others. I fixed it, but it still WA #12 :-((( I can't understand what test can it be. What does the problem mean.How to know the answer? try this: abc ab ac def The answer is: 6 Other test (my program failed it): 2 3 4 The answer is: 0 One more test: a b c de f g hi The answer is: 5 |
Why WA on 8 test? What test is it? | Kolobov_Oleg | 1410. Трещина | 3 фев 2009 16:43 | 1 |
this is my program: program Tresh; const SIZE = 1000; var a : array[1..SIZE] of Byte; max : array[1..SIZE] of Longint; n : Longint; function MaxFrase (i, cur : Longint) : Longint; var j, curmax, curn : Longint; begin curmax := 0; if i+2 > n then begin MaxFrase := cur+a[i]; Exit; end; if max[i] <> 0 then MaxFrase := max[i] else begin for j := i+2 to n do begin curn := MaxFrase(j, cur+a[i]); if curn > curmax then curmax := curn; end; max[i] := curmax; MaxFrase := curmax; end; end; var ch, chpred : Char; cur : Byte; i : Longint; begin i := 1; FillChar(max, SizeOf(Longint)*SIZE, 0); while not Eof do begin Read(ch); if not (ch in ['a'..'z', 'A'..'Z']) then begin if cur <> 0 then begin a[i] := cur; Inc (i); end; cur := 0; end else begin { if ch <> chpred then} Inc (cur); chpred := ch end; end; if cur <> 0 then begin a[i] := cur; Inc (i); cur := 0; end; n := i-1; Writeln (MaxFrase(1, 0)) end. |
WA on 12 test. What's wrong with this solution? | Alexandrov Sergey | 1410. Трещина | 17 апр 2008 21:59 | 7 |
Edited by author 02.11.2005 19:30 Try this test: aaa a a aaa Right answer is 6 but your program outputs 4. Thanx)) this problem was a bit harder than I thought)) According to the rules: valiant warriors don't use the same word twice in one phrase. Is it possible to answer "aaa aaa"? Please write the correct phrase with the length of 6. Edited by author 22.11.2005 12:28 aaa b c ddd To me Lenght(aaa)=1 because it is one sound and right answer is 2 correspondind to aaa ddd for example. If it is wrong then what is sense of notion "mjamlja". |
Test 5 | 1 | 1410. Трещина | 5 дек 2007 19:00 | 1 |
|
No subject | Ignatyev_Oleg | 1410. Трещина | 6 июл 2007 20:27 | 1 |
Edited by author 06.07.2007 20:56 |
What about question. What our problem must to do??? Please, help me!!! | alisher | 1410. Трещина | 16 фев 2007 22:11 | 1 |
I didn't understand the question. What must our program to do??? Please answer to my question!!!!!!!1 |
C++ and Java. | dimozzz | 1410. Трещина | 7 фев 2007 00:46 | 1 |
I send same solution on Java and C++. Outcome was TLE#15 (I didn't use standart Java class and didn't realloc memory) and AC (with time 0.078). Please, make double time limit for Java. |
Help not to miss the problem(Crack 1410) | svr | 1410. Трещина | 25 янв 2007 08:27 | 3 |
I advice you not to skip problems for your pleasure and scill. So help me now in crack-problem. I have Wa2 because missunderstanding. Example: S=aAbb cc bq hhd qss. What cost(S), where cost(S)is a functional of optimization. I think that: 1. We compress repeating letters to one sound because man onle hearing- S=ab c bd qs; 2. Form 3 possible subsequences S1=ab bd =abbd=abd; cost(S1)=cost(abd)=3; S2=ab qs=abqs;cost(S2)=cost(abqs)=4; S3=c qs=cqs;cost(cqs)=3; 3. Take max result cost(S)=max(4,3,3)=4. What wrong in my analysis? 1. We compress repeating letters to one sound it's wrong, u don't need to do this Thank you! Your short message is absolute true. Now I solved this pretty problem without any using notion 'miamlia'. Had 100 submits due to cout<<data[0] where char data[100000] but should output cout<<(int) data[0]. This bug is shown in specific case N=1 where N- number of words. After all troubles have pleasant impression from fine contest-type problem from Top coders team. |