| ENG RUS | Timus Online Judge |
Common BoardВладислав why its wrong? [2] // Problem 1409. Two Gangsters 2 Aug 2023 19:29 a, b = map(int, input().split()) print(10-a, 10-b) AndU Re: why its wrong? // Problem 1409. Two Gangsters 24 Aug 2023 21:51 Их не обязательно 10! то есть всего банок a + b - 1 Anindya Chakraborty Re: why its wrong? // Problem 1409. Two Gangsters 19 Apr 2024 16:22 Total_Cans = a+b-1 then, print(Total_Cans-a, Total_Cans-b) bsu.mmf.team What algo? [5] // Problem 1842. Local Roots 25 Aug 2016 18:13 Finally I've solved this problem using very hard optimised Main & Lorentz's algo, and 0.405s only. But I noticed many people solved this problem very fast and using much less memory. What algo do you use? I doubt it's possible to speed-up Main & Lorentz or Crochemore algos so much. Is it some alternative (like suffix tree) solution, or just some strong idea can be applied to this particular problem? Is it possible to solve it in O(n)? Shen Yang Re: What algo? [3] // Problem 1842. Local Roots 24 Feb 2017 14:56 I use something similar with manacher algorithm with some optimization.. Shen Yang Re: What algo? [2] // Problem 1842. Local Roots 25 Feb 2017 09:59 I use this approach: first for every position find the answer which cover outside the string(using kmp algo) as estimate value, and sort the estimate value in desending order, then use bruteforce(hash+enum) to calc the answer inside the string.when estimate value <=ans break; this program make me 0.2s AC... bsu.mmf.team Re: What algo? [1] // Problem 1842. Local Roots 13 Apr 2017 01:55 Thank you, but your solution is either not very fast :) I believe there's a strict approach exists with a strict algo for this problem. Celebrate Re: What algo? // Problem 1842. Local Roots 27 Oct 2021 16:44 My algorithm is similar to Shen Yang.But I also use exkmp to calc another two situaion. Then the estimate value will become smaller.I got AC in 0.046s. winger Re: What algo? // Problem 1842. Local Roots 18 Apr 2024 22:03 Look up Critical Factorization Theorem Fajnyi Statement clarification // Problem 1677. Monkey at the Keyboard 18 Apr 2024 20:53 So clearly realising (if monkey will follow others then monkey never will create that word because of re-using letters)? andreyDagger`~ Tests // Problem 2139. Experiment with Juice 18 Apr 2024 20:46 4 1 0 3 0 3 2 1 2 3 1 0 Answers: 2.00000000 4 1 0 3 0 3 2 1 2 3 1 1 45 Answers: 2.00000000 2.00000000 4 1 0 3 0 3 2 1 2 3 1 2 45 -90 Answers: 2.00000000 2.00000000 0.50000000 4 1 0 3 0 3 2 1 2 3 1 2 -45 -45 Answers: 2.00000000 0.50000000 0.00000000 3 -2.000 1.000 1.000 -2.000 4.000 1.000 1.000 1.000 1 359 Answers: 9.00000000 0.00000000 8848mzy How to solve it in less one second [2] // Problem 1504. Good Manners 31 Oct 2006 06:07 rt Denis Koshman Re: How to solve it in less one second [1] // Problem 1504. Good Manners 30 Aug 2008 16:31 Voroni diagrams perhaps (O(N*log(N)) gerind Re: How to solve it in less one second // Problem 1504. Good Manners 15 Apr 2024 20:02 I have AC 0.046s, O(K^3) with very simple approach 💮meanlessnessener`~ - // Problem 2045. Richness of words 14 Apr 2024 20:01 Edited by author 14.04.2024 21:19 Rithik Linkon Penaru I don't understand the question. Help !! // Problem 1083. Factorials!!! 13 Apr 2024 17:23 Can Anyone be kind enough to explain this ques to me? I'll be grateful to you.. IntoTheDusk Help!!!! [1] // Problem 1394. Ships. Version 2 3 Apr 2024 14:48 When I tried the brute force algorithm, I TLE at #15 How to solve this problem? Please send the solution to 13588731339@163.com Ramil Re: Help!!!! // Problem 1394. Ships. Version 2 12 Apr 2024 01:08 1) When bruteforcing, random shuffle both m rows and n ships 2) When solving one subset sum problem inside bruteforcing, use bitset (array of bitsets) instead of bool array (2d-array). Instead of max() in subset sum problem, use operator OR and operator "right bit shift". Just search "subset sum problem bitset" and you'll find out. This will speed up your dynamic programming in 32 or 64 times (if you are using both 64-bit compiler and 64-bit processor) It will not totally solve problem, but you will get TLE#67 which is better and giving more hope :) Edited by author 12.04.2024 01:08 Edited by author 12.04.2024 01:09 Edited by author 12.04.2024 01:11 pocochuk Brute Force // Problem 1769. Old Ural Legend 11 Apr 2024 03:49 :V prituladima Did anyone solved this using rolling hash and unordered_map (HashMap)? // Problem 1706. Cipher Message 2 9 Apr 2024 12:02 I tried this approach with Java: Test 5. TL With C++: Test 9. TL And seems like this is not enough, however time complexity is O(αk^2 + α|S|*k) where α is hash map hidden constant. So... did anyone managed to solve it this way? >>> i solved dp[i] - the number of sequences of length i [2] // Problem 1081. Binary Lexicographic Sequence 21 Oct 2021 00:48 Ivan Re: i solved dp[i] - the number of sequences of length i [1] // Problem 1081. Binary Lexicographic Sequence 23 Jan 2022 01:33 dp[i][j] - amount of i-digit numbers ending with j. therefore we form 2d table dp[n][2] then dp[i][0] = dp[i - 1][0] + dp[i - 1][1] dp[i][1] = dp[i - 1][1] It's not hard to see that dp[i][0] + dp[i][1] (i.e. number of all valid sequences) forms a fibonacci sequence. dp[i][0] + dp[i][1] = 2*dp[i - 1][0] + dp[i - 1][1] you can treat as f_n = 2*f_(n - 2) + f_(n - 3) But still, I don't know how to solve this problem :) Edited by author 23.01.2022 01:36 Edited by author 23.01.2022 01:37 So Sui Ming Re: i solved dp[i] - the number of sequences of length i // Problem 1081. Binary Lexicographic Sequence 6 Apr 2024 22:41 dp[i][1] = dp[i - 1][1] is wrong, should be: dp[i][1] = dp[i - 1][0] tima20072007 WA 4 // Problem 1881. Long problem statement 4 Apr 2024 21:45 Не вздумайте решать задачу, оно того не стоит. Daniil Hint - Illustration [1] // Problem 1893. A380 30 May 2022 16:37 ( window | A | aisle |B C| aisle | D | window )-- Premium (1-2) ( window | A B| aisle |C D| aisle |E F | window )-- Business (3-20) ( window | A B C| aisle |D E F G| aisle |H G K | window )-- Economy (21-64) Edited by author 30.05.2022 16:38 Newaz Re: Hint - Illustration // Problem 1893. A380 3 Apr 2024 19:41 Thanks! SquidBoy Slight Clarification [2] // Problem 2056. Scholarship 24 Sep 2015 07:55 It took me a while to get this one correct, and it's because I found part of the descritpion to be ambiguous/unclear - so I'm posting this clarification which hopefully will help anyone else who has the same misunderstanding. "if a student has got satisfactory marks, the scholarship is not given, " I read this to mean "got ONLY satisfactory marks" but my solutions were rejected. Once I modified my solution to treat it as "got ANY satisfactory marks", the solution was accepted. adityarev Re: Slight Clarification // Problem 2056. Scholarship 4 Mar 2020 01:20 dang. thanks for it Newaz Re: Slight Clarification // Problem 2056. Scholarship 1 Apr 2024 13:02 Thanks! Newaz Check this test case to avoid WA #4 // Problem 1581. Teamwork 1 Apr 2024 11:04 First time I've got WA #4 because of this test case: Input: 6 1 1 2 1 1 1 Correct answer: 2 1 1 2 3 1 Newaz Solution idea in C++ // Problem 1585. Penguins 1 Apr 2024 10:04 Instead of using getline(cin, str), use two different string such as string s1, s2. Then compare s1! pocochuk Wrong test cases // Problem 1984. Dummy Guy 29 Mar 2024 08:40 When n > 6 the cases are wrong. Try to do it without placing a circle in the center. BENDER Test 42 [1] // Problem 1014. Product of Digits 29 Mar 2024 02:21 How is it POSSIBLE to find 42 test case? It seems like everything should work fine.. BENDER Re: Test 42 // Problem 1014. Product of Digits 29 Mar 2024 02:32 OK, found my mistake. 777&222 would be very helpful test cases) Jakub Minarik solved // Problem 1000. A+B Problem 28 Mar 2024 16:13 already done. for someone who doesn't know how to do it: a,b = input().split() print(int(a)+int(b)) a = int(1) b = int(5) Edited by author 28.03.2024 16:23 Ade [FDU] Is the segment close or open? [1] // Problem 1469. No Smoking! 21 Dec 2014 22:52 What the output of? 2 0 0 1 1 1 1 2 2 Nabi Re: Is the segment close or open? // Problem 1469. No Smoking! 28 Mar 2024 08:06 yes
|