Submission #598843

#TimeUsernameProblemLanguageResultExecution timeMemory
598843shrimbCards (LMIO19_korteles)C++17
36 / 100
1098 ms77752 KiB
#include"bits/stdc++.h" using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<class x> using ordered_set = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>; // #define int long long #define endl '\n' #define mod 1000000007 //\ #define mod 1686876991 int Hash (int a, int b) { return (a * 31) % mod + b; } signed main () { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; int ans = 0; unordered_map<int,int> mp[1<<4]; int inc[16]; for (int i = 0 ; i < n ; i++) { char a, b, c, d; cin >> a >> b >> c >> d; int H[4] = {Hash(a, b), Hash(b, d), Hash(c, d), Hash(a, c)}; // U R D L int cnt = 0; int inv = 0; #define check(j,i,k) if (j & (1 << i)) { cnt++; enc = (enc * 31 * 31 + H[i])%mod; inv |= (1 << k);} for (int j = 1 ; j < (1 << 4) ; j++) { int enc = 0, ienc = 0; cnt = 0; inv = 0; check(j, 0, 2); check(j, 1, 3); check(j, 2, 0); check(j, 3, 1); for (int k = 0 ; k < 4 ; k++) { if (inv & (1 << k)) { ienc = (ienc * 31 *31 + H[(k + 2) % 4])%mod; } } if (cnt & 1) ans += mp[inv][ienc]; else ans -= mp[inv][ienc]; // cerr << enc << endl; inc[j] = enc; } for (int j = 1 ; j < (1 << 4) ; j++) mp[j][inc[j]]++; } cout << ans << endl; }

Compilation message (stderr)

korteles.cpp:14:1: warning: multi-line comment [-Wcomment]
   14 | //\
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...