This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 4100 + 5;
const int inf = 1e9;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
mt19937 mt(time(nullptr));
for (int i = 0; i < n; i++) {
int u = 500;
int moze = 1;
while (u--) {
int j = (mt() % n) ^ (mt() % n) ^ (mt() % n);
if (i == j) continue;
int r = 0;
for (int p = 0; p < m; p++) {
if (s[i][p] != s[j][p]) r += 1;
if (r > k || r + m - p - 1 < k) {
moze = 0;
break;
}
}
if (moze == 0) break;
}
if (moze == 1) {
cout << i + 1 << en;
return 0;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |