In the last Div2 round, for this 127D - Password, I think my 142872780 for the 4rth problem is not optimal and should not have passed but it did. One of the test on which it should give TLE can be generated with

int n = 1e5;
cout << n << '\n';
for(int i = 0; i < n; i++) {
   cout << (i + 1) * 10 << ' ';
}
cout << '\n';

I want to know whether it passed due to weak constraints or there is something wrong with my above hypothesis.