Is codeforces down? Please let me know guys, my solutions aren't getting submitted.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Is codeforces down? Please let me know guys, my solutions aren't getting submitted.
Trying to implement the system design of Uber where I am allowed to add new locations and new routes to those locations anywhere in the map. How can I optimize my Dijkstra algorithm so that I don't have to run it for all the nodes everytime I add a new edge or node to my graph (map).
Submissions to some old problems (without clear editorials or solutions) are greyed out. How can I know the solution to such problems in Codeforces?
The problem I am trying to learn: https://mirror.codeforces.com/gym/102760/problem/F
Words on Editorial: "There is another, more difficult solution. If you know how to find the largest rectangle in the histogram inO(N) using a stack, then you may realize that you can actually apply the exact same strategy to find the largest square. The proof is left to the reader for exercise."
And my solution
n = int(input())
arr = list(map(int, input().split()))
def solve(heights):
maxside = 0
pstack, hstack = [], []
currarea, maxside = 0, 0
heights.append(0)
for i in range(len(heights)):
prevwidth = int(1e9)
while hstack != [] and hstack[-1] > heights[i]: # -_
prevwidth = pstack[-1]
width = i - pstack.pop()
height = hstack.pop()
if width == height:
maxside = max(maxside, width)
if maxside < heights[i] or not hstack or hstack[-1] < heights[i]: # _-
hstack.append(heights[i])
pstack.append(min(prevwidth, i))
return maxside
ans = solve(arr)
print(ans)
CP gives me both happiness and stress. So I am interested in knowing what people in this community do when they are in anxiety or down in life or when they have tried hard to solve a problem, but never succeeded. Should I make friends to do CP or solving problems alone is enough?
Should you be stuck with a problem for long hours and try to come up with a solution or should you spend a hour or so for a problem and then give up and get hints from editorial and try again? I feel guilty for seeing the editorial. (^_^)!
| Name |
|---|


