# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502133 | Marduk | Cards (LMIO19_korteles) | C++14 | 342 ms | 29380 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 <string>
#include <vector>
#include <iostream>
#include <unordered_set>
using namespace std;
inline int hashing(string s) {
return int(s[0] - 'A') * 26 * 26 * 26 + int(s[1] - 'A') * 26 * 26 + int(s[2] - 'A') * 26 + int(s[3] - 'A');
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<int> > gl(676), gr(676), gu(676), gd(676);
vector<string> s(N);
vector<bool> st(676 * 676);
for (int i = 0; i < N; ++i) {
string sa, sb;
cin >> sa >> sb;
s[i] = sa + sb;
int cu = int(s[i][0] - 'A') * 26 + int(s[i][1] - 'A');
int cd = int(s[i][2] - 'A') * 26 + int(s[i][3] - 'A');
int cl = int(s[i][0] - 'A') * 26 + int(s[i][2] - 'A');
int cr = int(s[i][1] - 'A') * 26 + int(s[i][3] - 'A');
gu[cu].push_back(cd);
gd[cd].push_back(cu);
gl[cl].push_back(cr);
gr[cr].push_back(cl);
st[hashing(s[i])] = true;
}
# | 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... |