# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855889 | lovrot | Genetics (BOI18_genetics) | C++17 | 897 ms | 149664 KiB |
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 <cstdio>
#include <random>
#include <chrono>
using namespace std;
typedef long long ll;
const int N = 4110;
const ll INF = 1e18;
//const ll INF = 10;
int n, m, k;
ll A[N][N];
ll W[N] = {3, 2, 1, 9}, C[N][10];
int main() {
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
scanf("%d%d%d", &n, &m, &k);
ll sum = 0;
for(int i = 0; i < n; ++i) {
W[i] = rng() % INF;
sum += W[i];
// printf("%lld\n", W[i]);
}
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j) {
char c;
scanf(" %c", &c);
A[i][j] = c == 'A' ? 0 : (c == 'C' ? 1 : (c == 'G' ? 2 : 3));
// printf("%d%c", A[i][j], " \n"[j == m - 1]);
}
for(int j = 0; j < m; ++j)
for(int i = 0; i < n; ++i)
for(int l = 0; l < 4; ++l) C[j][l] += A[i][j] != l ? W[i] : 0;
for(int i = 0; i < n; ++i) {
ll _sum = 0;
for(int j = 0; j < m; ++j) _sum += C[j][A[i][j]];
//printf("%lld %lld\n", _sum, (sum - W[i]) * k);
if(_sum == (sum - W[i]) * (ll) k) {
printf("%d\n", i + 1);
return 0;
}
}
return 0;
}
Compilation message (stderr)
# | 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... |