Сегодня состоится Single Round Match 637 в 19:00 по Московскому времени.
Давайте обсудим задачи после контеста.
Сегодня состоится Single Round Match 637 в 19:00 по Московскому времени.
Давайте обсудим задачи после контеста.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
Спасибо, что ты предупреждаешь когда будет Topcoder.
Кто-нибудь еще сталкивался сегодня с тем, что не получается залогиниться в арену, пишет "Your login request timed out"
тоже самое
И у меня. Причем на arena.topcoder.com то же самое
Пару часов назад все было нормально, сейчас тоже не заходит. ContestAppletProd.jnlp перекачал, не помогло.
У меня ещё кроме "Your login request timed out" появляется "Your JRE does not support AES-128, login not allowed". Обновил JRE, перекачал Applet, обновил профиль на TC, ничего не помогает... :)
Похоже проблему решили, я сейчас смог залогиниться.
Typical Java
On clicking on connect with all variations ranging from direct to Http tunnel A and B my Topcoder arena displays a message saying "A connection could not be established" . How do I fix it ?
А хоть кому-то вообще удалось залогиниться?
тоже не могу залогиниться... вроде несколько SRM-ов назад была возможность логиниться в арену и отправлять решения через сайт?
I can't login to the Applet Arena :( It said "Your JRE does not support AES-128". What should I do? My OS is Ubuntu 14.04
I also have the same problem hope we get a reply soon
I also faced same problem. Then I cleared the java cache and downloaded the arena again. This has worked for me. :)
no this is not the reason it was a common problem but fixed now
Seems like everything is working now. At least for me :). Registered successfully.
Configure Java >> View >> Remove Topcoder arena application >> re-download and run arena
That worked for me.. Thanks :)
i can not run java applet of TC in ubuntu can some one help please?
div2. 1000 — min-cost-flow?
UPD:: Yes, it is.
Just find shortest eight-connected path from left side to right side.
500pointer: 335C - More Reclamation :D
so, round on topcoder will be unrated?))
It seems if replace columns ".." by 0, ".#" by 1 and "#." by 2 then it is:
http://acm.sgu.ru/problem.php?contest=0&problem=328
No, it is not that. In our case 1 and 2 should not be adjacent while in the sgu problem it can happen.
How? :)
But no one passed system tests :(
Yeah, I wonder wth happened.
у xellos'a за первый коммент +60 а за второй -46 *_*
wrong tests?
length of board == 1, :(. System test failed.
Can i use Sprague–Grundy theorem? Isn't it only applicable with normal play convention?? In this case the person who does not have a move wins. Am i wrong?
Yes, you could use it here.
One can reformulate the game as follows: a move is valid iff it does not block the last left-to-right path. So the player who has not a move lose.
Thanks! Now i understood :)
Can anybody please explain me better than O(n^3) solution? I read the editorial of 335C problem which has a O(n^3) approach.
I had an O(n) solution based on Sprague-Grandy Theorem.
We split our rectangle into smaller rectangles as follows: If we have a column with 'x' then we divide rectangle in this column (the edge column is in both left and right rectangle). for example
..x..xx..x.......xis splited into
..x—x..x—xx—x..x..—....—..—..xNow. It's easy to see that our game is equivalent to the sum of games on smaller rectangles. There are three types of rectangles.
Type A:
x.........Type B:
x...x.....Type C:
x........xOne can prove by induction that nimber of A(n) = (n-1), nimber of B(n) = n%2 and nimber of C(n) = 1-n%2. [n is the width of rectangle]. So we just have to xor those numbers and we are done. There is one other case when there is no 'x' on the initial board. But in that case first player wins when n is odd and lose when n is even. (symmetry strategy).
Very nice explanation !! Thank you so much !!
Эммм.. Все 500 упали?
а что значит, цвета, которыми написано passed system test?
Язык, на котором сдали
deleted
I had problems with CodeProcessor plugin during contest. I had to debug by myself. Is there any problem with this plugin or is is a problem with my Java environment?
Instantiation error window says: Could not instantiate the editor CodeProcessor (see the java console for details). Switching to 'Standard' editor instead
I haven't any problems with it
Div1 250 is a perfect problem to demonstrate .NET LINQ:
I don't know Python, but I bet code would be even shorter.
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
lol.
Can someone explain their solution for Div2 1000?
Snuke wins iff there is an 8-connected path of red cells from first column to the last column.
Build an oriented weighted graph, where each vertex correspond to a region from the board and there is an edge U->V with weight W if regions U and V are adjacent and region V has W cells. Add two more vertices source and target, source has edges to all regions having a cell in the first column with corresponding weight and all regions having a cell in the last column have edge to target with zero weight. Answer is the shortest distance from source to target.
ффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффффф
LOL
Are you LOL (=
Why the shortest distance will give the optimal answer ? I am not able to understand. Can you please explain ?
Any simple path in the graph corresponds to a set of 8-connected regions in the grid and length of this path corresponds to the total number of cells in these regions. We want to find a set of connected regions which spans from first column to the last with minimal total number of cells, this is equivalent to finding a shortest distance from source to target in the graph.
Got it. Thnx for the explanation :)