Submission #375719

#TimeUsernameProblemLanguageResultExecution timeMemory
375719YJUPIN (CEOI10_pin)C++14
80 / 100
1090 ms11960 KiB
#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,ans=0,v[N][4]; string s; ll id[N],dp[16],pre[16]; unordered_map<ll,ll> mm[N]; vector<ll> vid; 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){ if(count(mask)!=d)continue; vid.clear(); REP(i,n){ id[i]=0; REP(j,4)if(!((mask>>j)&1)){ id[i]=id[i]*36+v[i][j]; } vid.pb(id[i]); } sort(vid.begin(),vid.end()); vid.erase(unique(vid.begin(),vid.end()),vid.end()); REP(i,n){ id[i]=lwb(vid.begin(),vid.end(),id[i])-vid.begin(); memset(dp,0,sizeof(dp)); for(int j=0,P=1;j<4;j++,P*=37)pre[(1<<j)]=P*((mask>>j)&1?v[i][j]+1:0); for(ll bit=0;bit<(1<<4);++bit){ dp[bit]=dp[bit-(bit&-bit)]+pre[(bit&-bit)]; if((bit|mask)>mask)continue; ll val=dp[bit]; ans+=(count(bit)&1?-1:1)*mm[id[i]][val]; ++mm[id[i]][val]; } } REP(i,n){ mm[id[i]].clear(); } } cout<<ans<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...