제출 #502133

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
502133	2022-01-05 10:49:11	Marduk	Cards (LMIO19_korteles)	C++14	100 / 100	342 ms	29380 KiB

korteles

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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;
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 16 / 16
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 19 / 19
• Subtask 5: 25 / 25