Submission #779119

#TimeUsernameProblemLanguageResultExecution timeMemory
7791191075508020060209tcSajam (COCI18_sajam)C++14
15 / 90
25 ms16948 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define X first #define Y second int n;int K; int gr[1010][1010]; int ogr[1010][1010]; int rsame(int r){ for(int i=1;i<=n;i++){ if(gr[r][i]!=gr[r][1]){return 0;} } return 1; } void solve(){ for(int i=1;i<=n;i++){ if(gr[1][i]==0){ for(int j=1;j<=n;j++){ gr[j][i]^=1; } } } for(int i=1;i<=n;i++){ if(rsame(i)==0){return;} } cout<<"DA\n";exit(0); } signed main(){ cin>>n>>K; for(int i=1;i<=n;i++){ string s; cin>>s; s="*"+s; for(int j=1;j<=n;j++){ if(s[j]=='o'){ gr[i][j]=0; }else{ gr[i][j]=1; } ogr[i][j]=gr[i][j]; } } solve(); for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ gr[i][j]=ogr[i][j]; } } for(int i=1;i<=n;i++){ gr[1][i]^=1; } solve(); cout<<"NE\n"; }
#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...