# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
709878 | stevancv | Genetics (BOI18_genetics) | C++14 | 866 ms | 36264 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 <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 Get(char x) {
if (x == 'A') return 0;
if (x == 'C') return 1;
if (x == 'G') return 2;
if (x == 'T') return 3;
}
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);
vector<ll> v(n);
mt19937 mt(time(nullptr));
for (int i = 0; i < n; i++) {
cin >> s[i];
v[i] = mt() % mod;
}
vector<ll> d(n);
for (int j = 0; j < m; j++) {
vector<ll> a(4);
for (int i = 0; i < n; i++) {
a[Get(s[i][j])] += v[i];
}
for (int i = 0; i < n; i++) {
for (int p = 0; p < 4; p++) {
if (Get(s[i][j]) != p) d[i] += a[p];
}
}
}
ll svi = 0;
for (int i = 0; i < n; i++) svi += v[i];
for (int i = 0; i < n; i++) {
if ((svi - v[i]) * k == d[i]) {
cout << i + 1 << en;
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... |