제출 #997731

#제출 시각아이디문제언어결과실행 시간메모리
997731MarwenElarbiGenetics (BOI18_genetics)C++17
0 / 100
70 ms7024 KiB
#include <bits/stdc++.h> using namespace std; #define fi first #define se second #define ll long long #define pb push_back #define ii pair<int,int> const int nax=5e4+5; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int main(){ int n,m,k; cin>>n>>m>>k; string tab[n]; vector<int> per(n); for (int i = 0; i < n; ++i) { per[i]=i; cin>>tab[i]; } shuffle(per.begin(),per.end(),rng); bool vis[n]; memset(vis,0,sizeof vis); int cnt=0; for (int i = 0; i < n; ++i) { if(vis[per[i]]) continue; if(cnt>10) break; cnt++; for (int j = 0; j < n; ++j) { if(per[i]==per[j]) continue; int cur=0; for (int t = 0; t < m; ++t) { if(tab[per[i]][t]!=tab[per[j]][t]) cur++; if(cur>k) break; } if(cur!=k){ vis[per[j]]=1; vis[per[i]]=1; } } } for (int i = 0; i < n; ++i) { if(vis[per[i]]==0){ cout <<per[i]+1<<endl; break; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...