oj.uz

Submission #501873

# Submission time Handle Problem Language Result Execution time Memory
501873 2022-01-04T17:49:36 Z lovrot Cards (LMIO19_korteles) C++11
19 / 100
 37 ms 4440 KB 
#include <bits/stdc++.h> 
 
#define X first
#define Y second
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define vec vector
#define siz size()
#define pri(i, poc, n, pov) for(int i = (int) poc; i < (int) n; i += (int) pov)
#define od(i, poc, n, pov) for(int i = (int) poc; i > (int) n; i -= (int) pov)
 
using namespace std;
 
const ll INF = 1e18;                              
const int LOG = 20;
const int OFF = (1 << LOG);
const int MOD = 1e9 + 7;
const int lx[8] = {1, -1, 0, 0, -1, 1, 1, -1};
const int ly[8] = {0, 0, 1, -1, -1, 1, -1, 1};
const int N = 1e5 + 10;
 
int abs(int x){ 
	if(x < 0)
		return -x;
	return x;
}
 
ll a[26][26], b[26][26], c[26][26], d[26][26];
ll bc[26][26][26], cd[26][26][26], ad[26][26][26], ab[26][26][26];
ll all[26][26][26][26];
 
int main(){ 
	ios_base::sync_with_stdio(false); 
	cin.tie(0);
	cout.tie(0);
	setprecision(9);
 
	int n;
	cin >> n;
 
	ll ans = 0;
 
	pri(i, 0, n, 1){ 
		char s1, s2, s3, s4;
		cin >> s1 >> s2 >> s3 >> s4;
		int x = s1 - 'A';
		int y = s2 - 'A';
		int z = s3 - 'A';
		int w = s4 - 'A';
			
		ans += c[x][y] + d[z][x] + a[z][w] + b[y][w];
		if(y == z){
			ans -= ab[w][z][w];
			ans -= cd[x][y][x]; 
		}
		if(x == w){ 
			ans -= bc[y][w][y];
			ans -= ad[z][y][z];
		}
		if(x == w && y == z) ans += 3 * all[x][y][y][x];
		ans -= all[w][z][x][y];
		ans -= all[x][y][w][z];
	
		a[x][y]++;
		b[x][z]++;
		c[z][w]++;
		d[w][y]++;
		ab[y][x][z]++;	
		ad[w][y][x]++;
		bc[x][z][w]++;
		cd[z][w][y]++;
		all[y][x][z][w]++;
	}
 
	cout << ans;
	return 0;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 1 ms 716 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 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 1 ms 716 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 4440 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 0 ms 332 KB Output is correct
2 Correct 7 ms 4300 KB Output is correct
3 Correct 31 ms 4416 KB Output is correct
4 Correct 31 ms 4420 KB Output is correct
5 Correct 21 ms 4300 KB Output is correct

Subtask #5
0 / 25.0

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