Queue is stuck. Both new solutions and the ones with ongoing testing aren't progressing at the moment → Reply PTqwq_ 7 months ago, # | ← Rev. 2 -6 You are right, but we can't get verdicts as fast as before now. So, can codeforces allocate only 10% to other submissions?
4 months ago,#| 0 Yeah for the Arcade Game problem the solution is stuck in Queue →Reply sanghanijay08 3 months ago,#^| 0 It's happening right now with me from last night. →Reply kid-ye 5 days ago,#| +16 its back again →Reply...
Golang doesn't have a built-in multiset. I tried to use a priority queue, but couldn't find a version that supports removing some element by index. → Reply » » renebaebae 16 months ago, # ^ | 0 In problem D, I only use vector. You could consider to see my solution ...
1-Initialy you only have 1 and you propagate the edges you have and push them into priority queue 2- once you find a new friend at time T you push the old string and the time that string is going to played is just T — last, after that you make this friend '1' on your string...
1#include<iostream>2#include<cstdio>3#include<cmath>4#include<cstring>5#include<algorithm>6#include7#include<queue>8#include<stack>9#include<vector>10usingnamespacestd;11intn;12chara[15];13inthh,mm;14intmain()15{16scanf("%s",a);17hh=(a[0]-'0')*10+(a[1]-'0');18mm=(a[3]...
Your task is that for each of monster's initial positions and who plays first determine if the starter wins, loses, or the game will stuck in an infinite loop. In case when player can lose or make game infinity, it more profitable to choose infinity game. ...
Stuck in queue for more than 15 minutes now :( →Reply spookywooky 3 years ago,#| +3 After last contest I participated on codechef I was so pissed that I canceled my account. Fairly happy now that I did not participate this time. ...
Anyway it is much better than stuck in queue during a contest.Hope it will be fixed soon. → Reply erekle 4 years ago, # | +5 I want my money back ;) Jokes aside, MikeMirzayanov thank you so much for your work, and for all the joy it brings to so many people. → Reply ...
While there exists a corner which is not part of a city in the original grid, we remove that corner and add any new corners created to the queue. Repeat until no removable corners are left. I claim this is the minimum connected convex cover of the cities (convexity is the property ...
To win the level, after all the moves, the number in the cell at thei-th row andj-th column should be equal togi, j. Karen is stuck on one level, and wants to know a way to beat this level using the minimum number of moves. Please, help her with this task!