제출 #777356

#제출 시각아이디문제언어결과실행 시간메모리
777356vjudge1Sajam (COCI18_sajam)C++17
45 / 90
15 ms8668 KiB
#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 int dizi[1005][1005],x[1005][1005]; int32_t 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=='o')dizi[i][j]=0; else dizi[i][j]=1; } } if(n==1){ cout<<"DA"<<'\n'; return 0; } bool stop=true; int cev=0; for(int i=1;i<n && stop;i++){ for(int j=1;j<n && stop;j++){ int sor=dizi[i-1][j-1]+dizi[i-1][j]+dizi[i][j-1]+dizi[i][j]; //cout<<sor<<endl; if(sor%2!=0){ dizi[i][j]^=1; cev++; } if(cev>k){ stop=false; break; } } } if(stop)cout<<"DA"<<'\n'; else cout<<"NE"<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...