Submission #1167958

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1167958	2025-03-16 19:18:36	razivo	Genetics (BOI18_genetics)	C++20	46 / 100	2091 ms	25580 KiB

genetics

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <set>
#include <vector>
#include <bitset>
#include <string>
#include <unordered_set>
#include <algorithm>
#include <unordered_set>
using namespace std;
vector<string> a;int N,M,K;
vector<bitset<4100>> l1;
vector<bitset<4100>> l2;
vector<bitset<4100>> c(4100);
vector<bitset<4100>> t(4100);
bool comp(int i, int j) {
    if(i>j) swap(i,j);
    if(c[i][j]) return t[i][j];
    bool u = ((l1[i]^l1[j]) | (l2[i]^l2[j])).count() == K;
    c[i][j]=true;
    t[i][j] = u;
    return u;
}
int main()
{
    cin>>N>>M>>K;
    l1.resize(N);
    l2.resize(N);
    for (int i = 0; i < N; ++i) {
        string s; cin>>s;
        a.push_back(s);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 27 / 27
• Subtask 2: 19 / 19
• Subtask 3: 0 / 28
• Subtask 4: 0 / 26