Submission #878090

#TimeUsernameProblemLanguageResultExecution timeMemory
878090vjudge1Genetics (BOI18_genetics)C++17
46 / 100
2057 ms29296 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define pb push_back

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")

const int N = 4100 + 4;

int n, m, k;
char s[N][N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> k;
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }

    for (int i = 0; i < n; ++i) {
        int cntOk = 0;
        for (int j = 0; j < n; ++j) {
            if (j == i) {
                continue;
            }

            int cnt = 0;
            for (int l = 0; l < m; ++l) {
                cnt += (s[i][l] != s[j][l]);
            }

            cntOk += (cnt == k);
        }

        if (cntOk == n - 1) {
            cout << i + 1;
            return 0;
        }
    }

    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...