Submission #777824

#	Time	Username	Problem	Language	Result	Execution time	Memory
777824		Nelt	Genetics (BOI18_genetics)	C++17	46 / 100	2068 ms	23692 KiB

genetics

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 4105;
bitset<N> bs[4][N];
ll hsh[150]; 
void solve()
{
    hsh['A'] = 0, hsh['C'] = 1, hsh['G'] = 2, hsh['T'] = 3;
    ll n, m, k;
    cin >> n >> m >> k;
    k <<= 1;
    // k = m - k;
    str s[n];
    for (str &i : s)
        cin >> i;
    for (ll i = 0; i < n; i++)
    for (ll j = 0; j < m; j++)
        bs[hsh[s[i][j]]][i].set(j, 1);
    shuffle(all(s), rng);
    ll j;
    for (ll i = 0; i < n; i++)
    {
        for (j = 0; j < n; j++)
            if (i != j and (bs[0][i] ^ bs[0][j]).count() + (bs[1][i] ^ bs[1][j]).count() + (bs[2][i] ^ bs[2][j]).count() + (bs[3][i] ^ bs[3][j]).count() != k)
                break;
        if (j == n)
        {
            cout << i + 1 << endl;
            return;
        }
    }
}
/*
 
*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Compilation message (stderr)

genetics.cpp: In function 'void solve()':
genetics.cpp:59:23: warning: array subscript has type 'char' [-Wchar-subscripts]
   59 |         bs[hsh[s[i][j]]][i].set(j, 1);
      |                       ^
genetics.cpp:65:154: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   65 |             if (i != j and (bs[0][i] ^ bs[0][j]).count() + (bs[1][i] ^ bs[1][j]).count() + (bs[2][i] ^ bs[2][j]).count() + (bs[3][i] ^ bs[3][j]).count() != k)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

• Subtask 1: 27 / 27
• Subtask 2: 19 / 19
• Subtask 3: 0 / 28
• Subtask 4: 0 / 26