oj.uz

답안 #385220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385220 2021-04-03T17:48:24 Z ritul_kr_singh PIN (CEOI10_pin) C++17
100 / 100
 487 ms 2028 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

int mask;

bool comp(string x, string y){
	for(int i=0; i<4; ++i){
		if(((1<<i)&mask) and x[i]!=y[i]) return x[i]<y[i];
	}
	return false;
}

bool equal(string x, string y){
	return comp(x, y)==comp(y, x);
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, d; cin >> n >> d;
	string a[n]; for(auto &i : a) cin >> i;
	int ans[5] = {};

	int c[5][5];
	c[4][0] = c[4][4] = 1, c[4][1] = c[4][3] = 4, c[4][2] = 6;
	c[3][0] = c[3][3] = 1, c[3][1] = c[3][2] = 3;
	c[2][0] = c[2][2] = 1, c[2][1] = 2;
	c[1][0] = c[1][1] = 1;
	c[0][0] = 1;

	for(mask=0; mask<16; ++mask){
		int cnt = 0;
		for(int i=0; i<4; ++i) if((1<<i)&mask) ++cnt;

		sort(a, a+n, comp);
		for(int i=0; i<n; ++i){
			int j = i;
			while(j+1<n and equal(a[i], a[j+1])) ++j;
			ans[cnt] += ((j-i+1)*(j-i))/2;
			i = j;
		}
	}
	int j = -1, res = 0;
	for(int i=4-d; i<5; ++i){
		j = -j;
		res += ans[i] * j * c[i][4-d];
	}
	cout << res;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 364 KB Output is correct
2 Correct 12 ms 384 KB Output is correct
3 Correct 9 ms 364 KB Output is correct
4 Correct 162 ms 1132 KB Output is correct
5 Correct 208 ms 1280 KB Output is correct
6 Correct 201 ms 1152 KB Output is correct
7 Correct 165 ms 1260 KB Output is correct
8 Correct 224 ms 1132 KB Output is correct
9 Correct 385 ms 1920 KB Output is correct
10 Correct 422 ms 2028 KB Output is correct
11 Correct 218 ms 1132 KB Output is correct
12 Correct 396 ms 1900 KB Output is correct
13 Correct 244 ms 1260 KB Output is correct
14 Correct 228 ms 1260 KB Output is correct
15 Correct 487 ms 1772 KB Output is correct
16 Correct 295 ms 1516 KB Output is correct
17 Correct 464 ms 1900 KB Output is correct
18 Correct 355 ms 1644 KB Output is correct
19 Correct 400 ms 2028 KB Output is correct
20 Correct 456 ms 1900 KB Output is correct