# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
202676 | karma | Genetics (BOI18_genetics) | C++14 | 6 ms | 888 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 pb emplace_back
#define fi first
#define se second
#define mp make_pair
//#define int int64_t
using namespace std;
typedef pair<ll, ll> pii;
const int N = 4500;
ll k, cur = 0, ss;
int n, m;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Code(char c) {
if(c == 'A') return 1;
if(c == 'C') return 2;
if(c == 'T') return 3;
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define FileName "test"
if(fopen(FileName".inp", "r")) {
freopen(FileName".inp", "r", stdin);
freopen(FileName".out", "w", stdout);
}
cin >> n >> m >> k;
vector<string> s(n);
vector<vector<ll>> sum(n, vector<ll>(4));
vector<ll> ssum(n), p(n);
for(int i = 0; i < n; ++i) {
p[i] = uniform_int_distribution<ll>((ll)1e9, (ll)1e11)(rng);
cin >> s[i];
for(int j = 0; j < m; ++j) sum[j][Code(s[i][j])] += p[i];
cur += p[i] * k;
}
for(int i = 0; i < m; ++i) {
ssum[i] = 0;
for(int j = 0; j < 4; ++j) ssum[i] += sum[i][j];
}
for(int i = 0; i < n; ++i) {
ss = 0;
for(int j = 0; j < m; ++j) ss += (ssum[j] - sum[j][Code(s[i][j])]);
if(cur - p[i] * k == ss) return cout << i + 1, 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... |