Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
different c++ implementations - completely different results | imaginary friend | 1915. Руины титанов: воссоздание былого | 9 май 2020 10:45 | 2 |
Clang++ 4.0.1 - 0.39s - Accepted G++ 7.1 - 0.421 - Accepted Visual C++ 2017 - 1.029 - Time limit exceeded rofl in general i noticed that for the most problems clang is usually faster then g++ or ms c++ Edited by author 21.08.2018 03:53 I got it the other way - TLE #42 using G++ and Clang++, but AC 0.687 Visual C++ |
WA3 and WA12 | Levon Oganesyan | 1651. Кратчайшая подцепь | 8 май 2020 21:50 | 3 |
For WA3 try this: 3 1 2 1 Ans: 1 For WA12 try this: 5 1 2 3 1 5 Ans: 1 5 We have correct answers but on test 7 we have wrong answer Edited by author 08.05.2020 21:50 |
My mistake for WA #6 | ajay jadhav | 1930. Машина инженера Ивана | 8 май 2020 20:33 | 1 |
I had maintained dis[n+1][2] for distance. But visited array was vis[n+1], changed it to vis[n+1][2] and simple bfs. |
WA 9 help please | Ivan | 1139. Городские кварталы | 8 май 2020 18:17 | 1 |
|
give some tests | {AESC MSU}Vadim Kaushanskiy | 1628. Белые полосы | 8 май 2020 10:58 | 4 |
Input #1: 1 1 0 Output #1: 1 Input #2: 1 1 1 1 1 Output #2: 0 Input #3: 30000 1 0 Output #3: 1 Input #4: 30000 30000 0 Output #4: 60000 Input #5: 3 3 1 2 2 Output #5: 4 Input #6: 3 3 4 1 2 2 1 2 3 3 2 Output #6: 5 Input #7: 3 3 2 2 1 2 2 Output #7: 3 Input #4: 30000 30000 0 Output #4: 60000 why? I think the answer should be 2 |
Test | insi | 1756. Полтора землекопа | 7 май 2020 22:35 | 11 |
Test insi 13 мар 2010 14:44 I have WA #2 .. Can somebody give me some tests, please ?:) Edited by author 13.03.2010 14:57 5 2 3 Ans: 3 3 4 5 6 4 Ans: 7 7 8 8 My program: 5 2 3 -> 1 1 8 5 6 4 -> 1 1 1 27 Are these answers correct ? find less diggers solution insi your answers are not correct. You need to keep an even distribution. Edited by author 27.09.2014 11:20 Edited by author 27.09.2014 11:21 Re: Test Yashar Abbasov 13 апр 2010 02:03 for test 5 6 4 is answer 7 7 7 9 correct? Edited by author 13.04.2010 02:05 Edited by author 13.04.2010 02:05 Re: Test dAFTc0d3r [Yaroslavl SU] 13 апр 2010 22:23 No. 8 8 7 7 id correct. Because max(7,7,7,9) = 9 > 8 = max(8,8,7,7) and we need to minimize that max. Also acceptable answer: 8 8 8 6 |
AC one LINE | matvey22122 | 1243. Развод семи гномов | 7 май 2020 20:05 | 1 |
|
WA#25 | petr | 1444. Накормить элефпотама | 7 май 2020 02:41 | 2 |
WA#25 petr 12 май 2014 01:53 I can not make tests for which the program gives an incorrect result. Help please My program failed at WA#25 because my 'getAngle' function returned negative results instead of [0; 360), so try to check your sorting code |
Key hint | ajay jadhav | 1494. Монобильярд | 5 май 2020 23:55 | 1 |
Inspector can come at any point. after 1 ball pocketed after 2 ball pocketed or even at the end when n balls are pocketed Inspector can collect any number of available balls e.g if he comes after ball 3 is pocketed he can take just 3, or 3 2 or all 3 2 1 |
0.031s 312KB C++ sulotion | panhantao | 1028. Звёзды | 5 май 2020 19:56 | 7 |
I've been stuck in this problem for a very long time, but today I got the idea of Binary Indexed Tree from wikipedia and finally solved this problem :) Binary Indexed Tree,or BIT, can be viewed as a simplified version of Segment Tree,easier to code and less function to perform. But It's enough to solve this problem #include<iostream> #include<cstdio> using namespace std; const int Max = 32005; int n; int c[Max] = {0}; int level[Max] = {0}; int lowbit(int x) { return x&(-x); } int sum(int i) { int s = 0; while(i > 0) { s += c[i]; i -= lowbit(i); } return s; } void update(int pos,int val) { while(pos <= Max) { c[pos] += val; pos += lowbit(pos); } } int main() { scanf("%d",&n); for(int i = 0; i < n; i ++) { int x,y; scanf("%d%d",&x,&y); x ++; level[ sum(x) ] ++; update(x,1); }
for(int i = 0; i < n; i ++) printf("%d\n",level[i]); } How can this even be correct if you don't use the y-coordinates at all? Because in statement there was written that y-coordinates are already sorted in function main,why you use "x ++"? cose in problem x in [0,32000 ] so 0 is bad value for binary :) so we just shift all x on some const ( just 1) so all value between 1 and power(2,someN) Why do you use 32005 as a size of an array? Because it is given in constraint. That x and y values will be less than 32000. |
Doubt about my AC. | ajay jadhav | 1586. Трипростые числа | 5 май 2020 00:31 | 1 |
I have two loops which calls recursive function for 1 to 9 for 0 to 9 ans+=f(n-2,j,i) // f(rem,prev,prev_prev) function f(i,j,k) has dp[1001][10][10] memoized solution.why doesnt it timeout. I'm having hard time understanding my own solution although it is ACd in one trial. |
What is test 6? | Keiby | 2035. Очередной пробный тур | 4 май 2020 18:52 | 3 |
may be anybody know? Edited by author 13.09.2016 16:35 Edited by author 13.09.2016 16:35 Edited by author 04.05.2020 18:52 |
mayus are very important my guys | lRider | 2012. Про Гришу Н. | 3 май 2020 22:20 | 1 |
|
Hint and tutorial | blunder woman | 1039. Юбилейная вечеринка | 3 май 2020 13:34 | 2 |
I did not write this tutorial btw |
Some Test | TestT | 1043. Закрыть дугу | 3 май 2020 07:17 | 6 |
Test 01: 10 15 15 10 13 14 Ans 01: 25 Test 02: 0 5 5 0 1 1 Ans 02: 36 Test 03: 10 15 13 14 15 10 Ans 03: 100 Test 04: 10 15 13 14 15 10 Ans 04: 100 Test 05: 10 15 13 14 15 10 Ans 05: 100 Test 06: 2 1 1 2 1 1 Ans 06: 4 Test 07: 200 200 200 300 300 200 Ans 07: 17182 Test 08: 300 300 301 301 500 101 Ans 08: 80089 Test 09: 400 400 400 410 700 405 Ans 09: 90600 Test 10: 11 16 14 11 13 14 Ans 10: 15 Test 11: 4 1 1 6 2 2 Ans 11: 20 Test 12: 11 13 14 19 12 16 Ans 12: 18 Test 13: 11 14 14 20 12 18 Ans 13: 24 Test 14: 100 110 110 100 108 106 Ans 14: 100 Test 15: 100 110 90 100 94 108 Ans 15: 100 Test 16: Ans 16: Test 17: Ans 17: Test 18: Ans 18: Test 19: Ans 19: Test 20: Ans 20: Test 21: Ans 21: Test 22: Ans 22: Test 23: Ans 23: Test 24: Ans 24: Test 25: Ans 25: Test 26: Ans 26: Test 27: Ans 27: Test 28: Ans 28: Test 29: Ans 29: Test 30: Ans 30: Test 31: Ans 31: Test 32: Ans 32: Test 33: 1 -1000 -1 -1000 999 0 Ans 33: 3998000 Test 34: Ans 34: Test 35: 1 1 11 -1 2 0 Ans 35: 30 Test 36: -200 100 -300 -200 -195 -2 Ans 36: 32400 Test 37: -10 -5 -5 -10 -5 -100 Ans 37: 18496 Where the people find these tests? Edited by author 27.07.2007 01:01 Edited by author 27.07.2007 01:01 khmm. I don't know, what kind of cheat did you use, but it was very useful help. After some manipulations with precision, finally AC! Thank you Edited by author 17.08.2008 01:05 Thanks a lot! I didn't think about tests where some parts of circumstance could lie beyond the sqare[-1000, 1000]. Why test2 has answer 36? it seems that correct answer is 25. Yes, answer is correct. Center - 3.83333 3.83333 radius - 4.00694 x_min ~ -0.173605 < 0 y_min ~-0.173605 < 0 S = 36 |
WA#39 Can you help me? | SergeyGlazkov | 1854. Переговоры с Парфией | 3 май 2020 00:06 | 1 |
I understood my problem. It is about calculating sqrt, import math in python doing it wrong with very big numbers. Edited by author 03.05.2020 00:55 |
WA25 | Ulugbek#& | 1346. Интервалы монотонности | 2 май 2020 20:37 | 2 |
WA25 Ulugbek#& 30 апр 2020 09:32 does anybody have idea what it can be? Just retype your code in other language. For ex. C++, and you'll get AC. The reason is this site hates python and java coders :( Don't stop reading while not EOF Edited by author 02.05.2020 20:40 |
Memory Limit Exceeded with 70KB memory usage. | Samarendra Dash | 1439. Поединок с И-Так-Понятно-Кем | 2 май 2020 18:25 | 1 |
I am using a solution, where I store all the doors in a BST, and if door k is to be deleted then I delete the kth smallest element in the BST. Same for lookup, I search the kth smallest and print the number. In test case 2 it is showing memory limit exceeded with only some 66-69KB memory usages. But the question says 64MB memory is allocated. Then why is this happening? (I am using C++ to code this.) |
ENDLINE | texa_hero | 1149. Танцы синуса | 2 май 2020 00:53 | 1 |
Don't forget to make an endline in your pretty code.... |
БОЯН | Toshpulatov (MSU Tashkent) | 2080. Карточки | 1 май 2020 23:54 | 1 |
БОЯН Toshpulatov (MSU Tashkent) 1 май 2020 23:54 Ровно этаже задача на региональном этапе для школьников 2018-2019 год |