제출 #1090341

#제출 시각아이디문제언어결과실행 시간메모리
1090341andrei_iorgulescuGenetics (BOI18_genetics)C++14
0 / 100
38 ms9048 KiB
#include <bits/stdc++.h> using namespace std; mt19937 rng(8962); int n, m, k; char a[4105][4105]; bool mna(int x, int y) { int df = 0; for (int i = 1; i <= n; i++) if (a[x][i] != a[y][i]) df++; if (df == k) return true; return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> k; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; for (int i = 1; i <= n; i++) { vector<int> alti; for (int j = 1; j <= n; j++) if (j != i) alti.push_back(j); shuffle(alti.begin(), alti.end(), default_random_engine(rng())); bool ok = true; for (auto it : alti) { if (!mna(i, it)) { ok = false; break; } } if (ok) { cout << i; 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...