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>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _343tk3a ios::sync_with_stdio(0),cin.tie(0)
using namespace std;
void print(){cout<<"\n";}
template<class te,class ...ti>
void print(const te&v,const ti&...nv){cout<<v;if(sizeof...(nv)){cout<<" ";print(nv...);}}
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
//e
int main(){
_343tk3a;
int n,k;
cin>>n>>k;
int h,w;
h=n,w=n;
vec(vi) a(h,vi(w));
rep(i,h){
string s;
cin>>s;
rep(j,w){
a[i][j]=(s[j]=='x');
}
}
vec(vi) oa;
oa=a;
auto af=[&](vi _a){
a=oa;
rep(j,w){
if(_a[j]){
rep(_i,h){
a[_i][j]^=1;
}
}
}
int res=0;
rep(i,h){
int c=0;
rep(j,w)c+=a[i][j];
res+=min(c,n-c);
}
return res;
};
int res=n+1;
rep(i,h){
res=min(res,af(a[i]));
rep(j,w)a[i][j]^=1;
res=min(res,af(a[i]));
rep(j,w)a[i][j]^=1;
}
print((res<=k?"DA":"NO"),"\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... |