oj.uz

답안 #598859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598859 2022-07-19T06:33:00 Z shrimb Cards (LMIO19_korteles) C++17
16 / 100
 212 ms 262144 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 20000003

//\
#define mod 1686876991

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

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

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

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 1620 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 4 ms 4052 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 1620 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 4 ms 4052 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 17 ms 22408 KB Output is correct
7 Incorrect 19 ms 21488 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 178 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Runtime error 212 ms 262144 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 17 ms 22408 KB Output is correct
3 Incorrect 19 ms 21488 KB Output isn't correct
4 Halted 0 ms 0 KB -