oj.uz

Submission #598841

# Submission time Handle Problem Language Result Execution time Memory
598841 2022-07-19T06:21:07 Z shrimb Cards (LMIO19_korteles) C++17
36 / 100
 1000 ms 71560 KB 
#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;
}

int Hashh (int a, int b) {
	return ((a*31 * 31) % mod + b )% mod;
}

signed main () {
    cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	int ans = 0;
	unordered_map<int,int> mp[1<<4];
	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
		vector<int> inc;

		int cnt = 0;
		int inv = 0;
		#define check(j,i,k) if (j & (1 << i)) { cnt++; enc = Hashh(enc, H[i]); 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 = Hashh(ienc, H[(k + 2) % 4]);
				}
			}
			if (cnt & 1) ans += mp[inv][ienc];
			else ans -= mp[inv][ienc];
			// cerr << enc << endl;
			inc.push_back(enc);
		}
		for (int j = 1 ; j < (1 << 4) ; j++) mp[j][inc[j - 1]]++;
	}
	cout << ans << endl;
}

Compilation message

korteles.cpp:14:1: warning: multi-line comment [-Wcomment]
   14 | //\
      | ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 5 ms 1236 KB Output is correct
8 Correct 11 ms 2568 KB Output is correct
9 Correct 9 ms 2164 KB Output is correct
10 Correct 12 ms 2132 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 71560 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 501 ms 36524 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 5 ms 1236 KB Output is correct
4 Correct 11 ms 2568 KB Output is correct
5 Correct 9 ms 2164 KB Output is correct
6 Correct 12 ms 2132 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Execution timed out 1090 ms 71560 KB Time limit exceeded
13 Halted 0 ms 0 KB -