What happened??
How to handle this judge?
it is weird
How to handle this judge?
it is weird
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
The problem tester also used a set and got hacked
u mean, E unhackable?
E is hackable, but you need to wait for the problemsetters to fix their solution first
thanks)
Does this mean this question will be discarded?
But why nlog^2(n) should give a TLE
```bool part(int x, const vector& a, int k) { if(x == 0) return true;
int segs = 0; int cnts = 0; vector<bool> nv(x, false); for (int num : a) { if(num < x && !nv[num]) { nv[num] = true; ++cnts; } if(cnts == x) { segs++; if(segs >= k) return true; fill(nv.begin(), nv.end(), false); cnts = 0; } } return false;}``` this shouldn't pass right this is like O(n^2logn) but it is getting passed
Now there is a hack with unexpected verdict for problem G