# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254133 | rama_pang | Cards (LMIO19_korteles) | C++14 | 357 ms | 33664 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 lint = long long;
const int MAXN = 27 * 27 * 27 * 27;
int N;
int cnt[MAXN][16]; // NESW
inline int Hash(int c[2][2]) {
return c[0][0] * 27 * 27 * 27 +
c[0][1] * 27 * 27 +
c[1][0] * 27 +
c[1][1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> N;
lint ans = 0;
for (int cards = 0; cards < N; cards++) {
int c[2][2];
int alt[2][2];
int pick[2][2];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
char a;
# | 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... |