Submission #997758

#TimeUsernameProblemLanguageResultExecution timeMemory
997758MarwenElarbiGenetics (BOI18_genetics)C++17
46 / 100
2032 ms39972 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #define fi first #define se second #define ll long long #define pb push_back #define ii pair<int,int> const int nax=4100; vector<vector<bitset<nax>>> b(4,vector<bitset<nax>> (nax)); 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]; for (int j = 0; j < m; ++j) { if(tab[i][j]=='A') b[0][i][j]=1; else if(tab[i][j]=='C') b[1][i][j]=1; else if(tab[i][j]=='T') b[2][i][j]=1; else b[3][i][j]=1; } } bool vis[n]; memset(vis,0,sizeof vis); int cnt=0; shuffle(per.begin(),per.end(),rng); for (int i = 0; i < n; ++i) { if(vis[i]==1) continue; for (int j = 0; j < n; ++j) { if(per[j]==i) continue; auto cnt=b[0][i]^b[0][per[j]]; int cur=cnt.count(); cnt=b[1][i]^b[1][per[j]]; cur+=cnt.count(); cnt=b[2][i]^b[2][per[j]]; cur+=cnt.count(); cnt=b[3][i]^b[3][per[j]]; cur+=cnt.count(); cur/=2; if(cur!=k){ vis[per[j]]=1; vis[i]=1; break; } } if(vis[i]==0){ cout <<i+1<<endl; return 0; } } }

Compilation message (stderr)

genetics.cpp: In function 'int main()':
genetics.cpp:33:9: warning: unused variable 'cnt' [-Wunused-variable]
   33 |     int cnt=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...