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
bool dizi[1005][1005];
int main(){
faster
int n,k;
cin>>n>>k;
char c;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>c;
if(c=='x')dizi[i][j]=1;
else dizi[i][j]=0;
}
}
int y=2;
while(y--){
for(int i=0;i<n;i++){
int top=0;
for(int j=0;j<n;j++){
top+=dizi[i][j];
}
if(top*2>n){
for(int j=0;j<n;j++){
dizi[i][j]^=1;
}
}
}
int cev=0;
for(int j=0;j<n;j++){
int top=0;
for(int i=0;i<n;i++){
top+=dizi[i][j];
}
if(top*2>n){
for(int i=0;i<n;i++){
dizi[i][j]^=1;
//cev+=dizi[i][j];
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cev+=dizi[i][j];
}
}
if(cev<=k){
cout<<"DA"<<'\n';
return 0;
}
}
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... |