# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255043 | vioalbert | Cards (LMIO19_korteles) | C++14 | 147 ms | 20312 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;
typedef long long ll;
const int N = 456976+5, MAX1 = 26*26+5, MAX2 = 26*26*26+5, MAX3 = 26*26*26*26+5;
int n, ans;
int val[N][4];
int cnt[4][MAX3][4];
inline int parse(char a, char b) {
return (int)(a - 'A') * 26 + (int)(b - 'A');
}
inline int parse(char a, char b, char c) {
return (int)(a - 'A') * 26 * 26 + (int)(b - 'A') * 26
+ (int)(c - 'A');
}
inline int parse(char a, char b, char c, char d) {
return (int)(a - 'A') * 26 * 26 * 26 + (int)(b - 'A') * 26 * 26
+ (int)(c - 'A') * 26 + (int)(d - 'A');
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
ans = 0;
cin >> n;
for(int i = 0; i < n; i++) {
char c[4];
for(int j = 0; j < 4; j++)
cin >> c[j];
# | 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... |