oj.uz

Submission #952662

# Submission time Handle Problem Language Result Execution time Memory
952662 2024-03-24T12:59:20 Z Ellinor Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 28964 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize("unroll-loops")
#pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
#pragma GCC target("movbe")                 // byte swap
#pragma GCC target("aes,pclmul,rdrnd")      // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2")

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define rep(i, a, b) for (int i = (a); i < int(b); i++)     // in , ex
#define rrep(i, a, b) for (int i = (a)-1; i >= int(b); i--) // ex, in
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

inline void fast()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const ll INF = 100000000000000000; // 1e17
const ll MOD = 1e9 + 7;

//

random_device rd;
mt19937 rng(rd());
template <typename T>
inline T randint(T lo, T hi) { return uniform_int_distribution<T>(lo, hi)(rng); }

#define int ll
#define float double

//

int N, M, K;
vector<string> ns;

vector<bool> na, checked;

vector<pii> score;

vector<array<int, 4>> sum; // A, C, G, T

int32_t main()
{
    fast();

    cin >> N >> M >> K;

    ns.assign(N, "");
    rep(i, 0, N) cin >> ns[i];

    //

    sum.assign(M, {0, 0, 0, 0});

    rep(i, 0, N)
    {
        rep(j, 0, M)
        {
            if (ns[i][j] == 'A')
                sum[j][0]++;
            else if (ns[i][j] == 'C')
                sum[j][1]++;
            else if (ns[i][j] == 'G')
                sum[j][2]++;
            else
                sum[j][3]++;
        }
    }

    na.assign(N, true);

    rep(i, 0, N)
    {
        ll cnt = 0;

        rep(j, 0, M)
        {
            if (ns[i][j] == 'A')
                cnt += (N - sum[j][0]);
            else if (ns[i][j] == 'C')
                cnt += (N - sum[j][1]);
            else if (ns[i][j] == 'G')
                cnt += (N - sum[j][2]);
            else
                cnt += (N - sum[j][3]);
        }

        if (cnt % (N - 1) == 0)
        {
            cnt /= (N - 1);

            if (cnt != K)
                na[i] = false;
        }
        else
            na[i] = false;
    }

    //

    score.assign(N, {0, -1});
    rep(i, 0, N) score[i].second = i;

    if (N > 500 && M > 500)
    {
        checked.assign(M, false);

        int tmp = 0;

        while (tmp < 30)
        {
            int che = randint(int(0), int(M - 1));

            if (checked[che])
                continue;
            checked[che] = true;
            tmp++;

            char cha;
            if (K < M / 2)
            {
                int m = 0;
                m = max(m, sum[che][0]);
                m = max(m, sum[che][1]);
                m = max(m, sum[che][2]);
                m = max(m, sum[che][3]);

                if (m == sum[che][0])
                    cha = 'A';
                else if (m == sum[che][1])
                    cha = 'C';
                else if (m == sum[che][2])
                    cha = 'G';
                else
                    cha = 'T';
            }
            else
            {
                int m = M;
                if (sum[che][0] != 0)
                    m = min(m, sum[che][0]);
                if (sum[che][1] != 0)
                    m = min(m, sum[che][1]);
                if (sum[che][2] != 0)
                    m = min(m, sum[che][2]);
                if (sum[che][3] != 0)
                    m = min(m, sum[che][3]);

                if (m == sum[che][0])
                    cha = 'A';
                else if (m == sum[che][1])
                    cha = 'C';
                else if (m == sum[che][2])
                    cha = 'G';
                else
                    cha = 'T';
            }

            rep(i, 0, N)
            {
                if (ns[i][che] == cha)
                    score[i].first += 1;
            }
        }
    }

    sort(rall(score));

    //

    rep(_, 0, N)
    {
        int i = score[_].second;

        if (!na[i])
            continue;

        rep(j, 0, N)
        {
            if (j == i)
                continue;

            int cnt = 0;

            rep(k, 0, M)
            {
                if (ns[i][k] != ns[j][k])
                    cnt++;
            }

            if (cnt != K)
            {
                na[i] = false;
                na[j] = false;
                break;
            }
        }

        if (na[i])
        {
            cout << i + 1 << "\n";

            return 0;
        }
    }
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 5620 KB Output is correct
2 Correct 18 ms 6780 KB Output is correct
3 Correct 36 ms 6380 KB Output is correct
4 Correct 8 ms 1628 KB Output is correct
5 Correct 38 ms 6800 KB Output is correct
6 Correct 39 ms 6800 KB Output is correct
7 Correct 16 ms 3388 KB Output is correct
8 Correct 15 ms 3164 KB Output is correct
9 Correct 39 ms 6252 KB Output is correct
10 Correct 47 ms 6228 KB Output is correct
11 Correct 52 ms 5468 KB Output is correct
12 Correct 64 ms 5636 KB Output is correct
13 Correct 115 ms 5624 KB Output is correct
14 Correct 64 ms 4952 KB Output is correct
15 Correct 99 ms 4956 KB Output is correct
16 Correct 27 ms 4956 KB Output is correct
17 Correct 36 ms 6232 KB Output is correct
18 Correct 36 ms 6224 KB Output is correct
19 Correct 36 ms 6236 KB Output is correct
20 Correct 36 ms 6236 KB Output is correct
21 Correct 36 ms 6236 KB Output is correct
22 Correct 36 ms 6340 KB Output is correct
23 Correct 36 ms 6232 KB Output is correct
24 Correct 38 ms 6380 KB Output is correct
25 Correct 36 ms 6236 KB Output is correct
26 Correct 36 ms 6236 KB Output is correct
27 Correct 36 ms 6236 KB Output is correct
28 Correct 35 ms 6360 KB Output is correct
29 Correct 36 ms 6232 KB Output is correct
30 Correct 17 ms 6804 KB Output is correct
31 Correct 25 ms 6736 KB Output is correct
32 Correct 37 ms 6816 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 5620 KB Output is correct
2 Correct 18 ms 6780 KB Output is correct
3 Correct 36 ms 6380 KB Output is correct
4 Correct 8 ms 1628 KB Output is correct
5 Correct 38 ms 6800 KB Output is correct
6 Correct 39 ms 6800 KB Output is correct
7 Correct 16 ms 3388 KB Output is correct
8 Correct 15 ms 3164 KB Output is correct
9 Correct 39 ms 6252 KB Output is correct
10 Correct 47 ms 6228 KB Output is correct
11 Correct 52 ms 5468 KB Output is correct
12 Correct 64 ms 5636 KB Output is correct
13 Correct 115 ms 5624 KB Output is correct
14 Correct 64 ms 4952 KB Output is correct
15 Correct 99 ms 4956 KB Output is correct
16 Correct 27 ms 4956 KB Output is correct
17 Correct 36 ms 6232 KB Output is correct
18 Correct 36 ms 6224 KB Output is correct
19 Correct 36 ms 6236 KB Output is correct
20 Correct 36 ms 6236 KB Output is correct
21 Correct 36 ms 6236 KB Output is correct
22 Correct 36 ms 6340 KB Output is correct
23 Correct 36 ms 6232 KB Output is correct
24 Correct 38 ms 6380 KB Output is correct
25 Correct 36 ms 6236 KB Output is correct
26 Correct 36 ms 6236 KB Output is correct
27 Correct 36 ms 6236 KB Output is correct
28 Correct 35 ms 6360 KB Output is correct
29 Correct 36 ms 6232 KB Output is correct
30 Correct 17 ms 6804 KB Output is correct
31 Correct 25 ms 6736 KB Output is correct
32 Correct 37 ms 6816 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Execution timed out 2004 ms 28964 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 55 ms 5620 KB Output is correct
19 Correct 18 ms 6780 KB Output is correct
20 Correct 36 ms 6380 KB Output is correct
21 Correct 8 ms 1628 KB Output is correct
22 Correct 38 ms 6800 KB Output is correct
23 Correct 39 ms 6800 KB Output is correct
24 Correct 16 ms 3388 KB Output is correct
25 Correct 15 ms 3164 KB Output is correct
26 Correct 39 ms 6252 KB Output is correct
27 Correct 47 ms 6228 KB Output is correct
28 Correct 52 ms 5468 KB Output is correct
29 Correct 64 ms 5636 KB Output is correct
30 Correct 115 ms 5624 KB Output is correct
31 Correct 64 ms 4952 KB Output is correct
32 Correct 99 ms 4956 KB Output is correct
33 Correct 27 ms 4956 KB Output is correct
34 Correct 36 ms 6232 KB Output is correct
35 Correct 36 ms 6224 KB Output is correct
36 Correct 36 ms 6236 KB Output is correct
37 Correct 36 ms 6236 KB Output is correct
38 Correct 36 ms 6236 KB Output is correct
39 Correct 36 ms 6340 KB Output is correct
40 Correct 36 ms 6232 KB Output is correct
41 Correct 38 ms 6380 KB Output is correct
42 Correct 36 ms 6236 KB Output is correct
43 Correct 36 ms 6236 KB Output is correct
44 Correct 36 ms 6236 KB Output is correct
45 Correct 35 ms 6360 KB Output is correct
46 Correct 36 ms 6232 KB Output is correct
47 Correct 17 ms 6804 KB Output is correct
48 Correct 25 ms 6736 KB Output is correct
49 Correct 37 ms 6816 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Execution timed out 2004 ms 28964 KB Time limit exceeded
54 Halted 0 ms 0 KB -