# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163079 | nvmdava | Genetics (BOI18_genetics) | C++17 | 854 ms | 40056 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>
// #pragma GCC optimize("unroll-loops,Ofast")
#pragma GCC target("fma")
using namespace std;
#define ll long long
#define ff first
#define ss second
#define N 1000005
char c;
ll val[4500][70];
ll val2[4500][70];
int to[500];
int to2[500];
bool ans[4200][4200];
bool vis[4200][4200];
bool ok[4200];
int n, m, k;
inline bool comp(int a, int b){
if(vis[a][b])
return ans[a][b];
int q = 0;
for(int j = 0; j <= 65; ++j)
q += __builtin_popcountll((val[a][j] ^ val[b][j]) | (val2[a][j] ^ val2[b][j]));
vis[a][b] = vis[b][a] = 1;
return ans[a][b] = ans[b][a] = (q == k);
}
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... |