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>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 4105, K = 4, B = 63;
string s[N], let = "ACGT";
int a[N], b[N][K], mem[N][N];
bool banned[N];
ll w[K][N][N];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, k, let_cnt;
cin >> n >> m >> k;
if (n < 2000)
let_cnt = 4;
else
let_cnt = 2;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int bl_cnt = (m - 1) / B + 1;
for (int i = 0; i < n; i++) {
a[i] = i;
while (s[i].empty())
getline(cin, s[i]);
for (int j = 0; j < m; j++) {
s[i][j] = find(all(let), s[i][j]) - let.begin();
b[j][s[i][j]]++;
w[s[i][j]][i][j / B] |= 1ll << (j % B);
}
}
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = 0; j < K; j++) {
sum += b[i][j];
}
for (int j = 0; j < K; j++) {
b[i][j] = sum - b[i][j];
}
}
shuffle(a, a + n, rng);
memset(mem, -1, sizeof(mem));
for (int h = 0; h < n; h++) {
int i = a[h];
if (banned[i])
continue;
ll sum = 0;
for (int j = 0; j < m; j++) {
sum += b[j][s[i][j]];
}
if (sum != k * (n - 1))
continue;
bool ok = true;
for (int j = 0; j < n; j++) {
if (i != j) {
if (mem[i][j] == -1) {
mem[i][j] = m;
for (int h = 0; h < let_cnt; h++) {
for (int z = 0; z < bl_cnt; z++) {
mem[i][j] -= __builtin_popcountll(w[h][i][z] & w[h][j][z]);
}
}
mem[j][i] = mem[i][j];
}
if (mem[i][j] != k) {
banned[j] = 1;
ok = false;
}
}
}
if (ok) {
cout << i + 1;
return 0;
}
}
return 0;
}
Compilation message (stderr)
genetics.cpp: In function 'int main()':
genetics.cpp:41:25: warning: array subscript has type 'char' [-Wchar-subscripts]
b[j][s[i][j]]++;
^
genetics.cpp:42:22: warning: array subscript has type 'char' [-Wchar-subscripts]
w[s[i][j]][i][j / B] |= 1ll << (j % B);
^
genetics.cpp:68:32: warning: array subscript has type 'char' [-Wchar-subscripts]
sum += b[j][s[i][j]];
^
# | 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... |