Submission #591968

#	Time	Username	Problem	Language	Result	Execution time	Memory
591968		Kacper_Ziemecki	Cards (LMIO19_korteles)	C++14	36 / 100	1095 ms	14548 KiB

korteles

#include <bits/stdc++.h>
using namespace std;
#define endl "\n";

void solve(){
	int n, res = 0;
	string jeden, dwa;
	cin >> n;
	vector<string> lista(n, "");
	for(int i = 0; i < n; i++){
		cin >> jeden >> dwa;
		lista[i] += jeden + dwa;
		for(int j = i - 1; j >= 0; j--){
			if(lista[i][0] == lista[j][2] && lista[i][1] == lista[j][3]) res++;
			else if(lista[i][2] == lista[j][0] && lista[i][3] == lista[j][1]) res++;
			else if(lista[i][1] == lista[j][0] && lista[i][3] == lista[j][2]) res++;
			else if(lista[i][0] == lista[j][1] && lista[i][2] == lista[j][3]) res++;
		}
	}
	cout << res << endl;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	//freopen("input.txt", "r", stdin);
	solve();
}

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