TLE on D. Not Adding?

Revision en1, by anil_1, 2022-01-16 09:15:19

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.

Tags tle, weak testcases

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English anil_1 2022-01-16 09:23:19 0 (published)
en3 English anil_1 2022-01-16 09:18:56 20
en2 English anil_1 2022-01-16 09:16:52 1 Tiny change: '[problem:127D], I th' -> '[problem:1627D], I th'
en1 English anil_1 2022-01-16 09:15:19 529 Initial revision (saved to drafts)