# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374975 | _martynas | Cards (LMIO19_korteles) | C++11 | 88 ms | 6744 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 26*26*26*26 + 5;
int n;
char C[MAX_N][4]; // cards
int cnt[MAX_N];
int L[676], R[676], U[676], D[676];
void Read(char IN[])
{
scanf(" %c%c %c%c", &IN[0], &IN[1], &IN[2], &IN[3]);
}
int Hash2(char a, char b)
{
return 26 * (a - 'A') + (b - 'A');
}
int Hash4(char Arr[4])
{
int h = 0;
for(int i = 0; i < 4; i++)
{
h *= 26;
Compilation message (stderr)
# | 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... |