Does Codeforces permanently ban someone's handle for any violations? If so, what kind of violations are they?

Before contest

Codeforces Round 940 (Div. 2) and CodeCraft-23

2 days

Register now »

Codeforces Round 940 (Div. 2) and CodeCraft-23

2 days

Register now »

*has extra registration

# | User | Rating |
---|---|---|

1 | ecnerwala | 3648 |

2 | Benq | 3580 |

3 | orzdevinwang | 3570 |

4 | cnnfls_csy | 3569 |

5 | Geothermal | 3568 |

6 | tourist | 3565 |

7 | maroonrk | 3530 |

8 | Radewoosh | 3520 |

9 | Um_nik | 3481 |

10 | jiangly | 3467 |

# | User | Contrib. |
---|---|---|

1 | maomao90 | 174 |

2 | adamant | 164 |

2 | awoo | 164 |

4 | TheScrasse | 160 |

5 | nor | 159 |

6 | maroonrk | 156 |

7 | -is-this-fft- | 150 |

8 | SecondThread | 147 |

9 | orz | 146 |

10 | pajenegod | 145 |

Almost all problems on the first page have not yet been updated to a difficulty level!

Is it really a bug of the judges??? I have given same input for 2 different accepted codes for the following problem: https://codeforces.com/contest/1771/problem/C But, they gave me different output!

Input: 1 101 2 3 5 7 1 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 4

First code: submission_id- 184778210 Output: NO.

Second code: submission_id- 185537533 Output: YES.

And the valid answer is "YES". But the judges also accepted "NO"!!!

I don't know how accurate my observation is! But, I think there is a bug in the accepted solutions to this problem. For example, let's see the third example: x1=1, x2=4, t1=0, t2=0. Here they say the answer will be unique and that is 2.5 but the answer can be 2 also! Consider, another example: n=3, x1=1, x2=3, x3=11 and t1=t2=t3=0; The accepted code gives answer: 6 (the meeting point). Analysis: |x1-6|+|x2-6|+|x3-6|=13; But, if we choose 2 as the meeting point, then the absolute sum is: |11-2|+|3-2|+|1-2|=11 which is lesser than 13(the accepted output) Could anyone please help me to understand this concept?

Update: Yes, I have understood the concept. I have to minimize the maximum distance among all distances. Thank You.

But,I couldn't understand it,,why I have to subtract dg at last??? Now, I am badly in need of help.Someone please explain the above statement.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/19/2024 07:27:43 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|