# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
927682 |
2024-02-15T08:37:12 Z |
MuntherCarrot |
cmp (balkan11_cmp) |
C++17 |
|
1233 ms |
107088 KB |
#include <bits/stdc++.h>
#include "cmp.h"
using namespace std;
// void bit_set(int add)
// int bit_get(int add);
void remember(int a){
for(int i = 0; i < 6; i++){
bit_set(a % 4 + i * 4 + 1);
a /= 4;
}
}
int compare(int b){
int dig[6];
for(int i = 0; i < 6; i++){
dig[i] = b % 4;
b /= 4;
}
int i = 5;
for(; i >= 0; i--){
int x = bit_get(dig[i] + i * 4 + 1);
if(x == 0) break;
}
if(i == -1){
return 0;
}
else{
if(dig[i] == 3){
return 1;
}
if(dig[i] == 0){
return -1;
}
int b1 = bit_get(0 + i * 4 + 1);
if(b1){
return 1;
}
int b2 = bit_get(3 + i * 4 + 1);
if(b2){
return -1;
}
return dig[i] == 1 ? -1 : 1;
}
return 0;
}
// by me
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
1233 ms |
107088 KB |
Output is partially correct - maxAccess = 14, score = 64 |