Submission #895642

#TimeUsernameProblemLanguageResultExecution timeMemory
895642pccGenetics (BOI18_genetics)C++14
47 / 100
799 ms19052 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,popcnt") #define ll long long #define pll pair<ll,ll> #define pii pair<int,int> #define fs first #define sc second #define tlll tuple<ll,ll,ll> const int mxn = 4140; bitset<mxn> dp[mxn]; int N,M,K; string in; int arr[mxn],pos[mxn]; int main(){ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>N>>M>>K; for(int i = 0;i<N;i++)arr[i] = i; srand(time(NULL)); random_shuffle(arr,arr+N); for(int i = 0;i<N;i++)pos[arr[i]] = i; for(int i = 0;i<N;i++){ cin>>in; int now = pos[i]; for(int j = 0;j<M;j++){ if(in[j] == 'A')dp[now][j] = true; } } /* for(int i = 0;i<N;i++)cout<<arr[i]<<' ';cout<<endl; for(int i = 0;i<N;i++){ for(int j = 0;j<M;j++)cout<<(dp[i][j]?'A':'C'); cout<<endl; } */ for(int i = 0;i<N;i++){ bool flag = true; for(int j = 0;j<N;j++){ if(i == j)continue; //cout<<i<<','<<j<<":"<<(dp[i]^dp[j]).count()<<endl; if(!flag)break; if((dp[i]^dp[j]).count() != K)flag = false; } if(flag){ cout<<arr[i]+1; return 0; } } }

Compilation message (stderr)

genetics.cpp: In function 'int main()':
genetics.cpp:49:29: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |    if((dp[i]^dp[j]).count() != K)flag = false;
      |       ~~~~~~~~~~~~~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...