# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254118 | Nightlight | Cards (LMIO19_korteles) | C++14 | 76 ms | 4096 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;
int N;
int L[680], R[680], U[680], D[680];
bitset<680> vis1, vis2;
long long cnt[500000];
char aa, bb, cc, dd;
long long ans;
/*
AB
CD
*/
inline int num(char A, char B, char C, char D) {return 17576 * (A - 'A') + 676 * (B - 'A') + 26 * (C - 'A') + D - 'A';}
inline int num(char C, char D) {return 26 * (C - 'A') + D - 'A';}
inline int num(int A, int B, int C, int D) {return 17576 * (A) + 676 * (B) + 26 * (C) + D;}
inline int num(int C, int D) {return 26 * (C) + D;}
inline void match(int a, int b) {if(a > b) ans -= cnt[a] * cnt[b];}
inline void match2(int a, int b) {if(a != b) ans -= cnt[a] * cnt[b];}
int main() {
ios_base::sync_with_stdio(0);
cin >> N;
for(int i = 1; i <= N; i++) {
cin >> aa >> bb >> cc >> dd;
if(aa == bb && cc == dd) ans--;
if(aa == cc && bb == dd) ans--;
cnt[num(aa, bb, cc, dd)]++;
# | 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... |