+94
Traded respect for 2000$ |
+68
I second thia |
+43
Are you implying 300iq sold the access to his codeforces account to someone else? That is a strong claim, do you have any proof of this claim? |
+42
That's why you shouldn't sell your cf account |
+38
Thou hast shattered the streak, disrupting the continuum. Thy transgression shall not find solace in forgiveness. |
+31
The problem from CEOI 2020, Roads, is in fact an easier version of Exercise 2.13 from "Computational Geometry: Algorithms and applications". Instead of connecting disjoint segments, you're asked to connect disjoint triangles. |
+31
the most credible online course |
+29
$100 in cryptocurrency to enroll in this course Didn't know he meant this when he said that he is leaving CP for cryptofinance. |
+27
First they took our rating with their "plag check", now they're taking our money! Stop that! Grey Lives Matter! |
+27
I don't have any real proof, and I'm not sure if I believe it either. But it's sort of an urban legend that has been going around for a while. But there are some pieces of evidence pointing towards that:
|
+25
I'm not aware of many articles on techniques to reduce the number of FFT iterations and specific applications of the transposition principle, not limited to this theme. Are there any prominent references within the CodeForces community? |
+24
A bonus problem: I just remembered that I liked 104848I - 1\%-Euclidean a lot. So consider yourself lucky (or unlucky) with a 13th geometry problem. |
+23
I do not fifth thia |
+22
I love codeforces as well, but I don't think this blog is worth posting... |
+22
despite the common conception that all chn sounding names are the same person, maybe they j have the same code style and templates cuz they go to the same school and were taught the same style? |
+20
I fifth thia |
+20
You are right. But the organization "Anshi Dafu Middle" has many ZhuJianfeng. You can request to ban them. |
+19
There are rumors that Ildar has returned to Russia. This information is also confirmed by a very important person for him in the past (I remembered communicating with this person recently). I do not want to spread this and I am not responsible for this information. |
+16
Yes, I noticed. Before yesterday's bug, had been at 1460 so I got a net +6. You're back to pupil too. GL! |
+16
Registered 5 years ago, Contribution : 55, Divisible by 5. Awesome!! Spoiler |
+15
Basically, the idea is: we want to apply one of the usual solutions to the maximum sum on subarray problem with an additional constraint. The usual solution I'm talking about The additional constraint is the following one: basically, we get $$$k$$$ penalty if the subarray contains at least $$$1$$$ element, additional $$$k$$$ penalty for a subarray containing at least $$$m+1$$$ elements, additional $$$k$$$ for a subarray with at least $$$2m+1$$$ elements, and so on. Suppose we iterate on the left border of the subarray we're interested in. We can reduce some elements by $$$k$$$ to maintain the penalty. So, the first element which we decrease by $$$k$$$ will be the $$$1$$$-st after the left border; the second element will be the $$$(m+1)$$$-th after the left border, and so on. Obviously, iterating on the left border is too slow, if we want to model these decreases and search for the best right border. However, we can instead iterate on the remainder of the left border modulo $$$m$$$, because this leads to similar decreases. If our left border $$$l$$$ has remainder modulo $$$m$$$ equal to $$$x$$$, then we need to decrease the $$$x$$$-th element of the array, the element $$$(x+m)$$$, the element $$$(x+2m)$$$, and so on. And now we need to find the maximum sum on subarray with the remainder of $$$l$$$ modulo $$$m$$$ equal to $$$x$$$. We can modify our prefix sum approach to consider only such subarrays of follows: while we keep track of the minimum value of $$$p_l$$$, we consider only values of $$$l$$$ having $$$l \bmod m = x$$$. So, this is how we get a solution in $$$O(nm)$$$. |
+15
that must be terrible for his mental health |
+14
You are back specialist |
+14
I think the interesting part is that both happened at the same time. |
+13
I'm waiting the JOISC 2024 solution page for 4 weeks.. now I might collapse and will make blunder on all contest |
+13
I wish you all the best of luck. |
+12
I third thia |
+12
Hmm, why did you decide to post it now? |
+11
Any updates on this? |
+11
OTZ |
+11
There is a huge difference between a messy organization and health risks. Even if only 1-2% of all participants will get sick, it's not good. These kids aren't supposed to climb high mountains (2500+ m) to get ready for a school competition in programming, it's just totally wrong. |
+11
Topcoder has 2 divisions, first time participants would be assigned to Div2. There are only 3 problems per round, so it's hard to fully compare to the Codeforces divisions. |
+11
300iq will win IOI of scam |
+10
spoiler alert |
+10
I really liked TimeisMoney problems, although I don't see it as a Geometry problem :) If you like it, then I want to recommend 2014-2015 ACM-ICPC, Asia Tokyo Regional Contest J. Exhibition. 2015-2016 NEERC Northern K. Kingdom trip is one of my favorite Geometry problem. I usually do not prefer geometry problems, but I like them if it has a nice observation and is not too painful to code. I want to introduce my problem from ptzcamp. Can you solve it in $$$O(n \log W)$$$ time? |
+10
cf: 2182 lichess rapid: 2227 |
+10
where's the interview |
+10
yes! |
+10
welcome to crypto! |
+9
"your boos mean nothing to me, I have seen what makes you cheer" — 300iq, probably |
+8
Thanks, also: "Because you won't become GM before me hehe" — GlowCheese 2024. |
+8
They will probably appear closer to contest start, i have seen it many times |
On
IceKnight1093 →
Invitation to CodeChef Starters 131 (Rated till 5-Stars) - 24th April, 36 hours ago
+8
Fun problems, kudos to the authors! |
+8
I liked the blog, and I say as an expert that it helps me a lot, especially because I tend to get stuck in problems. But most of the time it's not a random guess (only when I'm out of ideas), but something that comes naturally by imagining the problem and making examples on paper, something related to intuition. And there's a skill that helps me a lot: knowing how to create good test cases. You can observe many things by simulating a good test case (in addition to avoiding WAs due to edge cases haha). |
+8
Codeforces: 1712 Chess.com: Blitz: 787 Rapid: 892 I usually play blitz more, but I guess this is abnormal for you guys. |
+8
CF peak: 2437 Chess.com rapid peak: 907 |
+8
My code passed your case, but for this case:
my code will give 4. I'm not sure whether this is common. |
+8
I hacked a lot people when I try to use their codes to check my wrong code. I'm so helpless. Who could help me? |
+8
|
+8
Or they should just start holding them on codeforces. It's a different format and a different kind of problems but they're still generally good quality so I suspect the low attendance is due to the disgusting platform and them not being advertised in the right place (eg CF main page). |
+8
Ignore this. I misunderstood the problem. |
+7
A is so weird...the most illogical describtion i've ever read... |
+7
Correct. People have just given up on the platform since Topcoder has been putting negative effort into competitive programming. |
+6
fortunately it has returned infact i got a +2 over it :D |
+6
cool |
+6
You get +10 mins added to your total submission time for each wrong verdict you receive. |
+6
yandex cup qual? semifinal? or final? (Because if not final,I can participate.) |
+5
no |
+5
Waiting for |
+5
Chess.com: 2050 (Omar_Hafez_Chess) Codeforces: 1410 Unfortinatly I didn't give competitive programming so much time Although I really enjoyed it But it becomes so boring for me to learn new topics in Competitive Programming and Reading tutorials which is a real pain for me.. But in chess, I don't need to read long boring tutorials or watch badly prepared YouTube videos to understand a problem. In chess, I just need to imagine the board. I didn't read any book about chess or watch tutorial in chess or get a coach in it. |
+5
I'm talking about the overall quality and usefulness of a blog. I feel like you shouldn't post things that most of the people on Codeforces agree on just for + contribution. |
+5
According to this paper, the problem is NP-hard, so if n and k are large you're out of luck. However, you can do a bit better ($$$\mathcal O\left(n 2^k\right)$$$) with a simple DP: for each $$$0 \le i \le n$$$, $$$0 \le a \le 2^k$$$, let $$$dp_{i,a}$$$ be the minimum positive number of the first $$$i$$$ elements you need to get an XOR of 0. $$$dp_{0,a} = \infty$$$, $$$dp_{i,a_i} = 1$$$, and otherwise $$$dp_{i,a} = \min \left ( dp_{i-1,a},1+dp_{i-1,a \oplus a_i} \right ) $$$. The answer is $$$dp_{n,0}$$$. |
+5
I second |
+4
Get a life |
+4
I hope we will be honest enough to refrain who have participated in Yandex Cup. Otherwise, it will adversely affect the rating distribution. Because you know, the problem authored by "tourist" will surely hold a huge score. |
+3
CF peak: 2102 |
On
dragonslayerintraining →
Codeforces Round #584 (Dasha Code Championship Elimination Round) (div. 1 + div. 2) Editorial, 40 hours ago
+3
Hey, can someone help me with test case 4? Consider $$$n=4$$$. What I did is just take $$$x_{1}, x_{2}$$$ contigous numbers from 2 columns, and shift them to get the desired result. So, $$$x_{1}=1,2$$$, and correspondingly, $$$x_{2}=3,2$$$. This is just one case. We can take numbers from 3 columns, and get $$${x_{1},x_{2},x_{3}}$$$={$$$1,1,2$$$}, $$${x_{1},x_{2},x_{3}}$$$={$$$1,2,1$$$}, and $$${x_{1},x_{2},x_{3}}$$$={$$$2,1,1$$$}. Seeing the number of cases to be small, I just bruteforced over the number of integers $$$p$$$, such that I choose $$$p$$$ columns, and take $$$x_{i}$$$ many contigous values from column $$$i$$$. Here is my code |
On
IceKnight1093 →
Invitation to CodeChef Starters 131 (Rated till 5-Stars) - 24th April, 36 hours ago
+3
3/4 people did it with a simple $$$O(q x\log^2{n})$$$ (x is unordered map) cheese. The two solutions I had:
|
+3
Looks like really high constant factor. There are a lot of calls to |
+3
Sorry, not sure what the issue is, updated the link. Also for your implementation, I'm not sure but I believe it should be possible to store the inverse values for all the Segment tree nodes when building it. You would need to call |
+3
Q. Why doesn't anybody talk to circles ? Ans- Because it's pointless |
+3
Some statistics from today: Div1: Registered — 46 Opened at least 1 problem — 38 Div2: Registered — 59 Opened at least 1 problem — 46 Total: Registered — 105 Opened at least 1 problem — 84 Codeforces Round 940 (Div. 2) and CodeCraft-23: Registered — 26432 Submitted at least 1 problem — 13722 Can we make a conclusion that Topcoder SRMs are basically dead? What's your best guess when Topcoder will stop holding them altogether given such a low attendance? |
+3
I never even got to specialist , but hopefully any day now :) |
+3
There is a mistake in the last line, it should be best_i + sum(i+1,i+len) — k (it is written correctly in the sample code). As for the reasoning, Suppose you want to find score of array of length len starting at index, then let rem=len%m. The your score would be sum(i,i+rem-1) -k + max(i+rem). where max(i+rem) is the maximum score you can obtain if you are starting at index (i+rem) and your sub-array's length is multiple of m (i.e. m, 2m, 3m...) Now, you can notice that max[i] = sum(i,i+m-1) + max[i+m]. Your base case would be max[n-m]= MAX(0, sum(n-m,n-1)], and max[i]=0 for all i greater than n-m and less than n-1. After your max array is calculated you can go through all the indices and for each rem = 1,2,3....m, find out the maximum score. |
+3
|
+2
Auto comment: topic has been updated by syrtin (previous revision, new revision, compare). |
+2
After removing non-shortest-path edges, we only have edges that are on some shortest path. A bridge is an edge that makes the graph disconnected when deleted. My claim is that not only the graph becomes disconnected, but nodes 1 and n become disconnected in particular. Let's prove it by assuming it's false and reaching a contradiction. If it's false, there is a bridge (u,v) that, when removed, doesn't disconnect 1 and n, meaning it leads to some biconnected component that is not in the path from 1 to n in the block-cut tree. This means that any path from 1 to n that crosses (u,v) must then come back and cross it in the opposite direction. At the same time (u,v) is on a shortest path from 1 to n, which is a contradiction, as no shortest path would cross over itself if weights are positive. This should be enough to prove that bridges are on all shortest paths. You can prove that non-bridges are not on all shortest paths by yourself. |
+2
The average altutide of a country is clearly not the same as the average altitude of where people live. |
+1
wow!! OP |
+1
Keyser_soze_09 orz. Oh Wow, so much rating. |
+1
I'm glad someone got that reference :D |
+1
MikeMirzayanov listened to users complaining about not enough CF rounds, so he invented rounds that write themselves |
+1
It's tough to say because I'm not sure what rating I'd achieve on Codeforces if I put in the same amount of time as I did with chess. I'd probably lean towards saying that chess seemed easier for me to improve in, considering I had a higher rating after 3 years of playing chess, which is the same amount of time I've spent on Codeforces. |
+1
2030 in chess.com |
+1
CF peak: 1428, Chess: 2260 Bullet (Lichess). Chess is a waste of time, CF is fun and rewarding, leading to valuable skills, job opportunities, and a better future. : I'M TRYING TO RETIRE FROM CHESS BUT I'M ADDICTED : |
+1
300iq(in base 4) move |
+1
$$$a$$$ size is n you have if $$$i$$$ is $$$n-1$$$ you will try to take value out of $$$a$$$ bounds which is undefined behaviour |
+1
9 alts now. |
0
got it bro thanks! |
0
Chess :1450 (lichess) and 800 (Chess.com) CF : will update soon )) |
0
MetalPower orz |
0
cf peak — 1402 , chess.com peak — 1350 |
0
cf peak: 1933 chess: lmao. |
0
Auto comment: topic has been updated by swetabh_7 (previous revision, new revision, compare). |
0
Codeforces: 1403 Lichess (Rapid): 1982 |
0
CF peak : 1695 Chess.com peak: 1982 (chess.com) I think there is a lot of similarity in the two fields |
0
How can we do B using DP? |
0
CF peak — 1750 (2014 y.) |