Submission #375712

#	Time	Username	Problem	Language	Result	Execution time	Memory
375712		YJU	PIN (CEOI10_pin)	C++14	30 / 100	161 ms	11792 KiB

pin

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long 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);
const ll INF=(1LL<<60);
#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 num(char c){
	return ((c>='0'&&c<='9')?c-'0':10+c-'a');
}

ll n,d,ans=0;
vector<ll> v[N];
string s;

ll id[N],in[N],cnt[N];
unordered_map<ll,ll> mm[N];

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>d;
	REP(i,n){
		cin>>s;
		REP(j,4)v[i].pb(num(s[j]));
	}
	for(ll bit=0;bit<(1<<4);++bit){
		if(count(bit)!=4-d)continue;
		vector<ll> vid,vin;
		REP(i,n){
			id[i]=in[i]=0;
			REP(j,4)if((bit>>j)&1){
				id[i]=id[i]*36+v[i][j];
			}else in[i]=in[i]*36+v[i][j];
			vid.pb(id[i]);
			vin.pb(in[i]);
		}
		sort(vid.begin(),vid.end());
		vid.erase(unique(vid.begin(),vid.end()),vid.end());
		sort(vin.begin(),vin.end());
		vin.erase(unique(vin.begin(),vin.end()),vin.end());
		REP(i,n){
			id[i]=lwb(vid.begin(),vid.end(),id[i])-vid.begin();
			in[i]=lwb(vin.begin(),vin.end(),in[i])-vin.begin();
			ans+=cnt[id[i]]-mm[id[i]][in[i]];
			++mm[id[i]][in[i]];++cnt[id[i]];
		}
		memset(cnt,0,sizeof(cnt));
		REP(i,n)mm[i].clear();
	}
	cout<<ans<<"\n";
	return 0;
}

• Subtask 1: 30 / 100