제출 #375726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
375726		YJU	PIN (CEOI10_pin)	C++14	90 / 100	505 ms	21188 KiB

pin

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+9;
const ll MOD2=998244353;
const ll N=5e4+5;
const ld pi=acos(-1);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
#define count(_a) (ll)__builtin_popcount(_a)

ll n,d,v[N][4],u[5];
string s;
map<vector<ll>,ll> mm;

ll num(char c){
	return ((c>='0'&&c<='9')?c-'0':10+c-'a');
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>d;
	REP(i,n){
		cin>>s;
		REP(j,4)v[i][j]=num(s[j]);
		for(ll mask=0;mask<(1<<4);++mask){
			vector<ll> vec;
			REP(j,4){
				if((mask>>j)&1)vec.pb(v[i][j]);
				else vec.pb(-1);
			}
			++mm[vec];
		}
	}
	for(auto i:mm){
		ll ti=0;
		REP(j,4){
			if(i.X[j]==-1)++ti;
		}
		u[4-ti]+=((i.Y)*(i.Y-1)/2);
	}
	u[3]-=4*u[4];
	u[2]-=u[3]*3+u[4]*6;
	u[1]-=u[2]*2+u[3]*3+u[4]*4;
	u[0]=(n-1)*n/2-u[1]-u[2]-u[3]-u[4];
	cout<<u[4-d]<<"\n";
	return 0;
}

• Subtask 1: 90 / 100