Problem Link:(http://codeforces.me/contest/548/problem/B) My Code
Problem Link:(http://codeforces.me/contest/548/problem/B) My Code
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
first we can't see what problem you are talking about because the link goes to your submissions but if you talk about this submission the answer is simple .... your code is O(n * m * q) which is too much for this problem as n*m*q = 1250000000
Why this is accepted?
tbh i just think that this step has saved him
a[x][y]=1-a[x][y];
instead of putting ifs
he should have gotten timelimit. To solve the question you should have added an array which keeps maximum contiguos 1's in each row.
And update the row that gets changed.To get complexity of O(n+m)q);
Thank you.ggok