Submission #140821

#	Time	Username	Problem	Language	Result	Execution time	Memory
140821		Minnakhmetov	Genetics (BOI18_genetics)	C++14	46 / 100	2095 ms	210168 KiB

genetics

#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
 
const int N = 4105, K = 4, B = 63, STUFF = 50;
string s[N], let = "ACGT";
int a[N], b[N][K], mem[N][N];
bool banned[N], used[K], trash[N];
ll w[K][N][N];
vector<int> v[K][N];
map<string, int> mp;
 
signed main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    int n, m, k, let_cnt = 0;
    cin >> n >> m >> k;

    mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

    int bl_cnt = (m - 1) / B + 1;
 
    for (int i = 0; i < n; i++) {
        a[i] = i;
        while (s[i].empty())
            getline(cin, s[i]);

        for (int j = 0; j < m; j++) {
            s[i][j] = find(all(let), s[i][j]) - let.begin();
            b[j][s[i][j]]++;
            w[s[i][j]][i][j / B] |= 1ll << (j % B);
            used[s[i][j]] = 1;
            v[s[i][j]][i].push_back(j);
        }

        mp[s[i]]++;
    }

    for (int i = 0; i < n; i++) {
        if (mp[s[i]] > 1)
            banned[i] = 1;
    }


    for (int i = 0; i < K; i++)
        let_cnt += used[i];
 
    for (int i = 0; i < m; i++) {
        int sum = 0;
        for (int j = 0; j < K; j++) {
            sum += b[i][j];
        }
        for (int j = 0; j < K; j++) {
            b[i][j] = sum - b[i][j];
        }
    }
 
    shuffle(a, a + n, rng);
 
    memset(mem, -1, sizeof(mem));
 
    for (int h = 0; h < n; h++) {
        int i = a[h];
 
        if (banned[i])
            continue;
 
        ll sum = 0;
        for (int j = 0; j < m; j++) {
            sum += b[j][s[i][j]];
        }
 
        if (sum != k * (n - 1))
            continue;
 
        bool ok = true;
        for (int j = 0; j < n; j++) {
            if (i != j) {
                int &d = mem[i][j];
                if (d == -1) {
                    d = m;
                    for (int h = 0; h < let_cnt; h++) {
                        if (v[h][i].size() < STUFF) {
                            for (int &x : v[h][i]) {
                                if (s[j][x] == h)
                                    d--;
                            }
                        }
                        else if (v[h][j].size() < STUFF) {
                            for (int &x : v[h][j]) {
                                if (s[i][x] == h)
                                    d--;
                            }
                        }
                        else {
                            for (int z = 0; z < bl_cnt; z++) {
                                d -= __builtin_popcountll(w[h][i][z] & w[h][j][z]);
                            }
                        }
                    }
                    mem[j][i] = d;
                }
                
                if (d != k) {
                    banned[j] = 1;
                    ok = false;
                    break;
                }
            }
        }
        if (ok) {
            cout << i + 1;
            return 0;
        }
    }
    
    return 0;
}

Compilation message (stderr)

genetics.cpp: In function 'int main()':
genetics.cpp:37:25: warning: array subscript has type 'char' [-Wchar-subscripts]
             b[j][s[i][j]]++;
                         ^
genetics.cpp:38:22: warning: array subscript has type 'char' [-Wchar-subscripts]
             w[s[i][j]][i][j / B] |= 1ll << (j % B);
                      ^
genetics.cpp:39:25: warning: array subscript has type 'char' [-Wchar-subscripts]
             used[s[i][j]] = 1;
                         ^
genetics.cpp:40:22: warning: array subscript has type 'char' [-Wchar-subscripts]
             v[s[i][j]][i].push_back(j);
                      ^
genetics.cpp:77:32: warning: array subscript has type 'char' [-Wchar-subscripts]
             sum += b[j][s[i][j]];
                                ^

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