# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
130082 | TadijaSebez | Genetics (BOI18_genetics) | C++11 | 1080 ms | 84476 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 <stdio.h>
#include <stdlib.h>
#include <ctime>
const int N=4115;
int my[N],sz[2],cnt[2][4][N];
char s[N][N];
int val[N][N];
bool ok[N];
int oks;
void Try(int n, int m, int k)
{
int i,j;
for(j=1;j<=m;j++) for(i=0;i<4;i++) cnt[0][i][j]=cnt[1][i][j]=0;
sz[0]=sz[1]=0;
for(i=1;i<=n;i++)
{
my[i]=rand()&1;
sz[my[i]]++;
for(j=1;j<=m;j++) cnt[my[i]][val[i][j]][j]++;
}
for(i=1;i<=n;i++)
{
if(ok[i])
{
int po[2];
po[0]=po[1]=0;
for(j=1;j<=m;j++)
{
po[0]+=sz[0]-cnt[0][val[i][j]][j];
po[1]+=sz[1]-cnt[1][val[i][j]][j];
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... |