Submission #199819

#	Time	Username	Problem	Language	Result	Execution time	Memory
199819		mahmoudbadawy	Sajam (COCI18_sajam)	C++17	90 / 90	194 ms	3232 KiB

sajam

#include <bits/stdc++.h>

using namespace std;

string arr[1005];
bitset<1005> bit[1005];
int co[1005];
int n,k;


int main()
{
	cin >> n >> k;
	for(int i=0;i<n;i++)
	{
		cin >> arr[i];
		for(int j=0;j<n;j++)
		{
			arr[i][j]=(arr[i][j]=='o'?'1':'0');
		}
		bit[i]=bitset<1005>(arr[i]);
	}
	for(int i=0;i<n;i++)
	{
		int cur=0;
		for(int j=0;j<n;j++)
		{
			int z=(bit[i]^bit[j]).count();
			cur+=min(z,n-z);
		}
		if(cur<=k)
		{
			cout << "DA" << endl;
			return 0;
		}
	}
	bitset<1005> b=bit[0];
	for(int i=0;i<n;i++)
	{
		b[i]=(1-b[i]);
		int cur=0;
		for(int j=0;j<n;j++)
		{
			int z=(b^bit[j]).count();
			cur+=min(z,n-z);
		}
		if(cur<=k)
		{
			cout << "DA" << endl;
			return 0;
		}
		b[i]=(1-b[i]);
	}
	cout << "NE" << endl;
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 15 / 15