#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=20;
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
3 ms |
724 KB |
Output is correct |
3 |
Correct |
4 ms |
724 KB |
Output is correct |
4 |
Correct |
9 ms |
1220 KB |
Output is correct |
5 |
Correct |
3 ms |
724 KB |
Output is correct |
6 |
Correct |
2 ms |
596 KB |
Output is correct |
7 |
Correct |
8 ms |
812 KB |
Output is correct |
8 |
Correct |
31 ms |
1236 KB |
Output is correct |
9 |
Correct |
2 ms |
552 KB |
Output is correct |
10 |
Correct |
31 ms |
1236 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
960 KB |
Output is correct |
2 |
Correct |
8 ms |
1108 KB |
Output is correct |
3 |
Correct |
6 ms |
980 KB |
Output is correct |
4 |
Correct |
5 ms |
956 KB |
Output is correct |
5 |
Correct |
9 ms |
1212 KB |
Output is correct |
6 |
Correct |
11 ms |
852 KB |
Output is correct |
7 |
Correct |
20 ms |
980 KB |
Output is correct |
8 |
Correct |
22 ms |
1108 KB |
Output is correct |
9 |
Correct |
6 ms |
724 KB |
Output is correct |
10 |
Correct |
34 ms |
1308 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
1108 KB |
Output is correct |
2 |
Correct |
11 ms |
1108 KB |
Output is correct |
3 |
Correct |
5 ms |
852 KB |
Output is correct |
4 |
Correct |
7 ms |
980 KB |
Output is correct |
5 |
Correct |
7 ms |
980 KB |
Output is correct |
6 |
Correct |
33 ms |
1236 KB |
Output is correct |
7 |
Correct |
8 ms |
724 KB |
Output is correct |
8 |
Correct |
19 ms |
980 KB |
Output is correct |
9 |
Correct |
20 ms |
980 KB |
Output is correct |
10 |
Correct |
34 ms |
1236 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
964 KB |
Output is correct |
2 |
Correct |
6 ms |
852 KB |
Output is correct |
3 |
Correct |
13 ms |
1224 KB |
Output is correct |
4 |
Correct |
4 ms |
852 KB |
Output is correct |
5 |
Correct |
5 ms |
852 KB |
Output is correct |
6 |
Correct |
33 ms |
1236 KB |
Output is correct |
7 |
Correct |
9 ms |
724 KB |
Output is correct |
8 |
Correct |
10 ms |
852 KB |
Output is correct |
9 |
Correct |
16 ms |
852 KB |
Output is correct |
10 |
Correct |
10 ms |
880 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
1236 KB |
Output is correct |
2 |
Correct |
11 ms |
1288 KB |
Output is correct |
3 |
Correct |
11 ms |
1248 KB |
Output is correct |
4 |
Correct |
6 ms |
968 KB |
Output is correct |
5 |
Correct |
6 ms |
980 KB |
Output is correct |
6 |
Correct |
22 ms |
1068 KB |
Output is correct |
7 |
Correct |
10 ms |
860 KB |
Output is correct |
8 |
Correct |
27 ms |
1156 KB |
Output is correct |
9 |
Correct |
15 ms |
960 KB |
Output is correct |
10 |
Correct |
32 ms |
1236 KB |
Output is correct |