이 제출은 이전 버전의 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 ilk[n];
string str;cin>>str;
for(int i=0;i<n;i++){
ilk[i]=(str[i]=='o');
}
int arr[n-1][n];
for(int i=0;i<n-1;i++){
cin>>str;
for(int j=0;j<n;j++){
int a=(str[j]=='o');
arr[i][j]=ilk[j]^a;
}
}
ll int cev=0;
for(int i=0;i<n-1;i++){
for(int j=0;j<n;j++){
dp[i]+=arr[i][j];
}
if(dp[i]<=n-dp[i])cev+=dp[i];
else cev+=(n-dp[i]);
}
if(cev<=k){
cout<<"DA"<<endl;
return 0;
}
for(int i=0;i<n;i++){
int fark=0;
for(int j=0;j<n-1;j++){
if(dp[j]==n-dp[j]){
fark--;continue;
}
if(arr[j][i]){
if(dp[j]>n-dp[j])fark--;
else fark++;
continue;
}
if(dp[j]>n-dp[j])fark++;
else fark--;
}
if(fark<0){
cev+=fark;
}
}
if(cev<=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... |