제출 #164234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
164234		rajarshi_basu	Ispit (COCI19_ispit)	C++14	90 / 90	10 ms	632 KiB

Main

#include <iostream>

#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i = a;i<=b;i++)
#define ll long long int
#define pb push_back
#define vi vector<int>
#define ff first
#define ss second
#define vv vector
#define ii pair<int,int>

using namespace std;

const int MAXN = 501;
char grid[MAXN][MAXN];
int compo[MAXN][26];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,k;
	cin >> n >> k;
	FOR(i,n){
		string s;cin >> s;
		FOR(j,n)grid[i][j] = s[j],compo[i][s[j]-'a']++;
	}
	bool ok = 0;
	FOR(i,n){
		FOR(j,n){
			if(i >= j)continue;
			bool b = 1;
			FOR(a,26){
				if(compo[i][a] != compo[j][a])b = 0;
			}
			if(!b)continue;
			int ctr = 0;
			FOR(a,n)if(grid[i][a] != grid[j][a])break;else ctr++;
			FOR(a,n)if(grid[i][n-a-1] != grid[j][n-a-1])break; else ctr++;
			//cout << i << " " << j << endl;
			if(n-ctr <= k)ok = 1;
		}
	}
	if(ok)cout << "DA" << endl;
	else cout << "NE" << endl;
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9