Submission #996259

#TimeUsernameProblemLanguageResultExecution timeMemory
996259amine_arouaGenetics (BOI18_genetics)C++17
0 / 100
19 ms3676 KiB
#include <bits/stdc++.h> //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") using namespace std; #define int long long #define pb push_back #define nl '\n' #define fore(i, y) for(int i = 0; i < y; i++) #define forr(i, x, y) for(int i = x;i<=y;i++) #define forn(i, y, x) for(int i = y; i >= x; i--) mt19937 rng (chrono::steady_clock::now().time_since_epoch().count()); signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n , m , k; cin>>n>>m>>k; bitset<4100> bs[n]; fore(i , n) { string s; cin>>s; fore(j , m) { bs[i][j] = (s[j] == 'A'); } } fore(i , n) { bool acc = 1; fore(cnt , 9) { int j = uniform_int_distribution<int>(0 , n - 1)(rng); if(i == j) continue; if((bs[j]^bs[i]).count() != k) { acc = 0; break; } } if(acc) { cout<<i + 1<<nl; return 0; } } }

Compilation message (stderr)

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