Submission #589816

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
589816	2022-07-05T10:17:27 Z	ignus	Cards (LMIO19_korteles)	C++14	19 / 100	126 ms	4756 KB

korteles

 #include<bits/stdc++.h>
using namespace std;

int main(){
	int n;
	cin >> n;
	int a[4][676];
	int b[4][676];
	int c[456976];
	long long fin = 0;
	for(int i = 0; i < 676; i++){
		for(int j = 0; j < 4; j++)a[j][i]=0;
		for(int j = 0; j < 4; j++)b[j][i]=0;
	}
	for(int i = 0; i < 456976; i++){
		c[i]=0;
	}
	for(int i = 0; i < n; i++){
		char t1, t2, t3, t4;
		cin >> t1 >> t2 >> t3 >> t4;
		t1-='A';
		t2-='A';
		t3-='A';
		t4-='A';
		long long r1=0, r4=0, r2c=0, r2o=0;
		
		if(t1==t4&&t2==t3){
			r4+=c[26*(26*(26*(t3)+t4)+t1)+t2];
		}
		if(t1==t4){
			r2c+=b[0][26*(t2)+t1]-r4;
			r2c+=b[1][26*(t3)+t1]-r4;
		}
		if(t2==t3){
			r2c+=b[2][26*(t4)+t2]-r4;
			r2c+=b[3][26*(t1)+t2]-r4;
		}
		r2o+=c[26*(26*(26*(t2)+t1)+t4)+t3]-r4;
		r2o+=c[26*(26*(26*(t3)+t4)+t1)+t2]-r4;
		r1=a[0][26*(t3)+t4]+a[1][26*(t1)+t2]+a[2][26*(t2)+t4]+a[3][26*(t1)+t3]-r4*4-r2c*2-r2o*2;
		fin+=r1+r2o+r2c+r4;
		//cout << b[1][26*(t2)+t1] << ' ' << b[0][26*(t3)+t1] << ' ' << b[3][26*(t4)+t2] << ' ' << b[2][26*(t1)+t2] << '\n';
		//cout << a[0][26*(t3)+t4] << ' '<< a[1][26*(t1)+t2] << ' ' << a[2][26*(t2)+t4] << ' ' << a[3][26*(t1)+t3] <<'\n';
		//cout << i << ' ' << fin << ' ' << r1 << ' ' << r2o << ' ' << r2c << ' ' << r4 << '\n';
		if(t1==t4){
			b[0][26*(t1)+t2]++;
			b[1][26*(t1)+t3]++;
		}
		
		if(t2==t3){
			b[2][26*(t2)+t1]++;
			b[3][26*(t2)+t4]++;
		}
		
		c[26*(26*(26*(t1)+t2)+t3)+t4]++;
		
		a[0][26*(t1)+t2]++;
		a[1][26*(t3)+t4]++;
		a[2][26*(t1)+t3]++;
		a[3][26*(t2)+t4]++;
	}
	cout << fin;
	return 0;
}

Subtask #1

0 / 16.0

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

Subtask #2

0 / 20.0

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

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	126 ms	4756 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2004 KB	Output is correct
2	Correct	17 ms	2336 KB	Output is correct
3	Correct	85 ms	3732 KB	Output is correct
4	Correct	47 ms	3112 KB	Output is correct
5	Correct	58 ms	3020 KB	Output is correct

Subtask #5

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2004 KB	Output is correct
2	Correct	1 ms	2004 KB	Output is correct
3	Correct	1 ms	2004 KB	Output is correct
4	Incorrect	1 ms	2004 KB	Output isn't correct
5	Halted	0 ms	0 KB	-