이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);
//#define endl "\n"
#define ll long long
#define pb push_back
#define N 1005
#define f first
#define s second
#define M 17
int dp[N];
int main(){
int n,k;cin>>n>>k;
int arr[n][n];
for(int i=0;i<n;i++){
string str;cin>>str;
for(int j=0;j<n;j++){
arr[i][j]=(str[j]=='o');
}
}
for(int uwu=0;uwu<1;uwu++){
for(int i=0;i<n;i++){
int bir=0;
for(int j=0;j<n;j++){
bir+=arr[j][i];
}
if(bir>n-bir){
for(int j=0;j<n;j++){
arr[j][i]^=1;
}
}
}
for(int i=0;i<n;i++){
int bir=0;
for(int j=0;j<n;j++){
bir+=arr[i][j];
}
if(bir>n-bir){
for(int j=0;j<n;j++){
arr[i][j]^=1;
}
}
}
}
int bir=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
bir+=arr[i][j];
}
}
if(bir>n*n-bir)bir=n*n-bir;
if(bir<=k)cout<<"DA"<<endl;
else cout<<"NE"<<endl;
}
# | 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... |