# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
26785 |
2017-07-05T16:00:40 Z |
baactree |
cmp (balkan11_cmp) |
C++14 |
|
4144 ms |
100908 KB |
#include "cmp.h"
void remember(int n) {
bit_set(10240-n);
n++;
while(n<5000){
bit_set(n);
n+=n&(-n);
}
}
int compare(int b) {
if(bit_get(10240-b))
return 0;
int ret=0;
b++;
while(b){
ret+=bit_get(b);
b-=b&(-b);
}
if(ret>0)
return 1;
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4144 ms |
100908 KB |
ZERO POINTS: more than 20 accesses in the worst case |