제출 #884168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
884168		vjudge1	Sajam (COCI18_sajam)	C++17	45 / 90	14 ms	9108 KiB

sajam

#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define int long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1000000009
#define MOD 998244353
#define lim 200005
using namespace std;





void solve(){
    int n, k; cin >> n >> k;
    int arr[n+1][n+1];
    for(int i=1; i<=n; i++){
        string s; cin >> s;
        for(int j=1; j<=n; j++){
            if(s[j-1]=='o') arr[i][j]=1;
            else arr[i][j]=0;
        }
    }
    int color[2][n+1];
    color[0][1]=0;
    for(int i=1; i<=n; i++){
        color[1][i] = arr[1][i];
        //cerr << "column" spc i spc color[1][i] << endl;
    }
    for(int i=1; i<=n; i++){
        color[0][i] = (arr[i][1]==1)?(1-color[1][1]):(color[1][1]);
        //cerr << "row" spc i spc color[0][i] << endl;
    }
    int ans=0;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if((color[0][i]!=color[1][j])!=arr[i][j])ans++;
        }
    }
    cerr << ans << endl;
    if(ans<=k) cout << "DA" << endl;
    else cout << "NE" << endl;
}



signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    #ifdef Local
    freopen("in","r",stdin);
    freopen("out","w",stdout);
    #endif

    /*freopen("fcolor.in","r",stdin);
    freopen("fcolor.out","w",stdout);*/

    int t=1;
    //cin >> t;
    while(t--) solve();
}

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