Submission #146313

#	Time	Username	Problem	Language	Result	Execution time	Memory
146313		MvC	Genetics (BOI18_genetics)	C++11	46 / 100	2071 ms	22904 KiB

genetics

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=5e3+50;
const int mod=1e9+7;
using namespace std;
int n,m,k,i,j,bl,nr,t,x,y;
char a[nmax][nmax];
bitset<4105>bs[nmax];
vector<int>rad;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m>>k;
	for(i=1;i<=n;i++)for(j=1;j<=m;j++)cin>>a[i][j];
	if(n<=100 && m<=100)
	{
		for(i=1;i<=n;i++)
		{
			bl=0;
			for(j=1;j<=n;j++)
			{
				if(i==j)continue;
				nr=0;
				for(t=1;t<=m;t++)if(a[i][t]!=a[j][t])nr++;
				if(nr!=k)
				{
					bl=1;
					break;
				}
			}
			if(!bl)rc(i);
		}
	}
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			if(a[i][j]=='C')bs[i][j]=1;
		}
	}
	for(i=1;i<=n;i++)rad.pb(i);
	shuffle(rad.begin(),rad.end(),rng);
	for(i=0;i<n;i++)
	{
		x=rad[i];
		bl=0;
		for(j=0;j<n;j++)
		{
			y=rad[j];
			if(x==y)continue;
			nr=(bs[x]^bs[y]).count();
			if(nr!=k)
			{
				bl=1;
				break;
			}
		}
		if(!bl)rc(x);
	}
	return 0;
}

Compilation message (stderr)

genetics.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
genetics.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

• Subtask 1: 27 / 27
• Subtask 2: 19 / 19
• Subtask 3: 0 / 28
• Subtask 4: 0 / 26