This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 1000000000005
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL);
#define mid (start+end)/2
#define mod 1000000007
int32_t main(){
faster
int n,k;
cin>>n>>k;
string s[n],ger[n],sor1[n];
int cev=0;
for(int i=0;i<n;i++){
cin>>s[i];
string f="";
for(int j=0;j<n;j++){
if(s[i][j]=='x'){
f+='o';
}
else f+='x';
}
ger[i]=f;
}
int gec=n*n;
if(gec%2!=0)gec++;
gec/=2;
if(k>=gec){
cout<<"DA"<<'\n';
}
else{
for(int i=0;i<n;i++){
if(ger[i][0]=='o'){
sor1[i]=ger[i];
}
else{
sor1[i]=s[i];
}
}
bool stop=true;
for(int i=1;i<n && stop;i++){
for(int j=0;j<n && stop;j++){
if(sor1[i][j]==sor1[i-1][j]){
stop=true;
}
else {
cev++;
//cout<<i<<" "<<j<<endl;
}
}
}
if(cev<=k)cout<<"DA"<<'\n';
else cout<<"NE"<<'\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |