Submission #1218697

#TimeUsernameProblemLanguageResultExecution timeMemory
1218697MalixGenetics (BOI18_genetics)C++20
19 / 100
2091 ms2376 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<int,int,int> ti; typedef vector<ll> li; typedef vector<li> lii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define LSOne(s) ((s)&(-s)) #define all(x) x.begin(),x.end() ll INF=1000000000000000010; int inf=1e9+10; ll M=1e9+7; int n,m,k; // vector<pair<string,int>> a; vector<bitset<4100>> b; int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>n>>m>>k; b.resize(n); REP(i,0,n){ string s;cin>>s; REP(j,0,m)if(s[j]=='A')b[i][j]=1; } REP(i,0,n){ bool flag=1; REP(j,0,n)if(i!=j){ bitset<4100> c; c=b[i]^b[j]; int cnt=c.count(); if(cnt!=k){ flag=0; break; } } if(flag){ cout<<i+1; return 0; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...