Submission #375726

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
375726	2021-03-09T21:25:48 Z	YJU	PIN (CEOI10_pin)	C++14	90 / 100	505 ms	21188 KB

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.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	1388 KB	Output is correct
2	Correct	9 ms	1260 KB	Output is correct
3	Correct	8 ms	1132 KB	Output is correct
4	Correct	118 ms	4972 KB	Output is correct
5	Correct	135 ms	5356 KB	Output is correct
6	Correct	141 ms	5620 KB	Output is correct
7	Correct	115 ms	4844 KB	Output is correct
8	Correct	176 ms	5868 KB	Output is correct
9	Correct	263 ms	7908 KB	Output is correct
10	Correct	305 ms	8556 KB	Output is correct
11	Correct	168 ms	5740 KB	Output is correct
12	Correct	360 ms	8172 KB	Output is correct
13	Correct	171 ms	6124 KB	Output is correct
14	Correct	151 ms	5740 KB	Output is correct
15	Incorrect	302 ms	8300 KB	Output isn't correct
16	Correct	316 ms	15980 KB	Output is correct
17	Correct	505 ms	21100 KB	Output is correct
18	Correct	367 ms	17516 KB	Output is correct
19	Correct	449 ms	19436 KB	Output is correct
20	Incorrect	485 ms	21188 KB	Output isn't correct