Submission #884195

#	Time	Username	Problem	Language	Result	Execution time	Memory
884195		vjudge1	Sajam (COCI18_sajam)	C++17	0 / 90	5 ms	2140 KiB

sajam

#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
const int N = 2e5+1;

void solve() {
  int n,k;
  cin >> n >> k;
  char grid[n+1][n+1];
  map<string,int> mp;
  int sm =0;
  F(i,n) {
    string s;
    cin >> s;
    F(j,n) grid[i][j] = s[j-1];
    int c = 0;
    for (auto it : s) if (it == 'o') c^=1;
    sm+=c;
  }
  int sm2 = 0;
  for (int j=1;j<=n;j++) {
    int c = 0;
    F(i,n) if (grid[i][j] == 'o') c ^= 1;
    sm2+=c;
  }
  cout << ((min(sm,sm2)<=k)?"DA\n":"NE\n");
}
    
                  
                             
signed main() { 
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  #ifdef Local
  freopen("in","r",stdin);
  freopen("out","w",stdout); 
  #endif
  int t = 1;
  //cin >> t;
	F(i,t) solve();
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15