Submission #590604

#	Time	Username	Problem	Language	Result	Execution time	Memory
590604		Jakub_Wozniak	Cards (LMIO19_korteles)	C++14	36 / 100	1084 ms	4648 KiB

korteles

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500000;
char karty[2][2][MAXN];

bool check(int i , int j)
{
	if(karty[1][0][i] == karty[0][0][j] && karty[1][1][i] == karty[0][1][j]) return 1;
	if(karty[1][0][j] == karty[0][0][i] && karty[1][1][j] == karty[0][1][i]) return 1;
	if(karty[0][1][i] == karty[0][0][j] && karty[1][1][i] == karty[1][0][j]) return 1;
	if(karty[0][1][j] == karty[0][0][i] && karty[1][1][j] == karty[1][0][i]) return 1;
	return 0;
}
int main()
{
	int N;
	cin >> N;
	string pom;
	for(int i=0;i<N;i++)
	{
		cin >> pom;
		karty[0][0][i]=pom[0];
		karty[0][1][i]=pom[1];
		
		cin >> pom;
		karty[1][0][i]=pom[0];
		karty[1][1][i]=pom[1];
	}
	long long int wynik=0;
	for(int i=0;i<N-1;i++)
	{
		for(int j=i+1;j<N;j++)
		{
			if(check(i,j))
			{
				wynik++;
			}
		}
	}
	cout << wynik;
	return 0;
}

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