# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167810 | tamyte | Cards (LMIO19_korteles) | C++17 | 141 ms | 3972 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 26 * 26 * 26 * 26;
const int MAX1 = 26 * 26;
int cnt[MAX + 1];
char c[MAX + 1][4];
int L[MAX1 + 1], R[MAX1 + 1], U[MAX1 + 1], D[MAX1 + 1];
int hash2(char a, char b) {
return 26 * (a - 'A') + (b - 'A');
}
int hash4(char a[]) {
int res = 0;
for (int i = 0; i < 4; ++i) {
res *= 26;
res += (a[i] - 'A');
}
return res;
}
int hash4(int a, int b, int c, int d) {
int res = 0;
res += a;
res *= 26;
res += b;
res *= 26;
res += c;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |