# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1034180 |
2024-07-25T10:20:30 Z |
vjudge1 |
cmp (balkan11_cmp) |
C++17 |
|
889 ms |
82556 KB |
#include "cmp.h"
#include <bits/stdc++.h>
using namespace std;
void remember(int n) {
for (int i = 0; i <= 11; i++) {
if ((n >> i) & 1) bit_set(i+1);
}
}
int compare(int n) {
for (int i = 11; i >= 0; i--) {
int x = bit_get(i+1);
int y = (n >> i) & 1;
if (x > y) return -1;
else if (x < y) return 1;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
889 ms |
82556 KB |
ZERO POINTS: more than 20 accesses in the worst case |