Hi Codeforces!↵
↵
Today I'm writing this blog to express my sad feelings about my lack of knowledge. I was pretty sure that a testing system does around 1e9 operations per a second. That's what everyone have been telling me for last 2 years. The problem, as I think, is that I didn't really question myself what **"the operation"** is. That's why I made an unsuccessful hack attempt in today's round. Some newbie wrote the code for problem A using this:↵
↵
~~~~~↵
for(int i = 0; i < m; ++i){↵
for(int j = 0; j < i; ++j){↵
if(B[i] == B[j]) {...}↵
}↵
}↵
~~~~~↵
m is up to 5*1e4, so even these 5 lines make around _5*1e4*2.5*1e4 = 1.25*1e9_ operations. Obvious TL, as I thought. But it wasn't (the solution soon got AC on final tests). I think that by saying "the operation" people actually mean some arithmetic operation like plus, minus, maybe divide, while logic operations may take smaller time. Again, this is only my assumption, and if you know the real explanation to this situation, please write it in the commentary section.↵
↵
Today I'm writing this blog to express my sad feelings about my lack of knowledge. I was pretty sure that a testing system does around 1e9 operations per a second. That's what everyone have been telling me for last 2 years. The problem, as I think, is that I didn't really question myself what **"the operation"** is. That's why I made an unsuccessful hack attempt in today's round. Some newbie wrote the code for problem A using this:↵
↵
~~~~~↵
for(int i = 0; i < m; ++i){↵
for(int j = 0; j < i; ++j){↵
if(B[i] == B[j]) {...}↵
}↵
}↵
~~~~~↵
m is up to 5*1e4, so even these 5 lines make around _5*1e4*2.5*1e4 = 1.25*1e9_ operations. Obvious TL, as I thought. But it wasn't (the solution soon got AC on final tests). I think that by saying "the operation" people actually mean some arithmetic operation like plus, minus, maybe divide, while logic operations may take smaller time. Again, this is only my assumption, and if you know the real explanation to this situation, please write it in the commentary section.↵
