# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1173094 | Hanksburger | Genetics (BOI18_genetics) | C++20 | 460 ms | 132460 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int a[4105][4105], cnt[4105][4], w[4105];
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
srand(time(0));
int n, m, k, sum=0;
cin >> n >> m >> k;
for (int i=1; i<=n; i++)
{
w[i]=rand();
sum+=w[i];
for (int j=1; j<=m; j++)
{
char x;
cin >> x;
a[i][j]=(x=='A'?0:(x=='C'?1:(x=='G'?2:3)));
cnt[j][a[i][j]]+=w[i];
}
}
for (int i=1; i<=n; i++)
{
int num=0;
for (int j=1; j<=m; j++)
num+=sum-cnt[j][a[i][j]];
if (num==k*(sum-w[i]))
# | 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... |