Submission #199820

#	Time	Username	Problem	Language	Result	Execution time	Memory
199820		mohammedehab2002	Sajam (COCI18_sajam)	C++11	90 / 90	199 ms	2424 KiB

sajam

#include <bits/stdc++.h>
using namespace std;
int n,k;
string s[1005];
bitset<1005> b[1005];
int get(int i,int j)
{
	int cnt=(b[i]^b[j]).count();
	return min(cnt,n-cnt);
}
int main()
{
	cin >> n >> k;
	for (int i=0;i<n;i++)
	{
		cin >> s[i];
		for (int j=0;j<n;j++)
		b[i][j]=(s[i][j]=='o');
	}
	for (int i=0;i<n;i++)
	{
		int cur=0;
		for (int j=0;j<n;j++)
		cur+=get(i,j);
		if (cur<=k)
		{
			cout << "DA";
			return 0;
		}
	}
	for (int i=0;i<n;i++)
	{
		b[0][i].flip();
		int cur=0;
		for (int j=0;j<n;j++)
		cur+=get(0,j);
		if (cur<=k)
		{
			cout << "DA";
			return 0;
		}
		b[0][i].flip();
	}
	cout << "NE";
}

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