| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
0
Hello — I received the plagiarism notice for my submission 349871347 to problem 2171B. I did not copy other users’ code. I wrote the solution myself during the contest. To support this, My submission time for that particular question was 20:14 UTC +5.5 20 Nov 2025 and the other person's timing was 21:03 UTC +5.5 20 Nov 2025 I don't know the person and I have written my code myself If you look at the code, it is very simple so it has a high chance to coincide in my opinion Please let me know if you need any additional logs. I’m happy to cooperate to resolve this. Thank you. Here is my solution : ~~~~~ t = int(input()) for _ in range(t): n = int(input()) a = list(map(int, input().split())) if a[0] != -1 and a[-1] != -1: ans = abs(a[-1] — a[0]) else: ans = 0 if a[0] == -1 and a[-1] == -1: a[0] = 0 a[-1] = 0 elif a[0] == -1: a[0] = a[-1] elif a[-1] == -1: a[-1] = a[0] for i in range(n): if a[i] == -1: a[i] = 0 print(ans) print(*a) ~~~~~ |
|
0
hi it was nice contest |
| Name |
|---|


