oj.uz

Submission #952670

# Submission time Handle Problem Language Result Execution time Memory
952670 2024-03-24T13:06:14 Z Ellinor Genetics (BOI18_genetics) C++14
100 / 100
 1848 ms 36380 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

bool g4 = false;

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]++;
                g4 = true;
            }
            else
            {
                sum[j][3]++;
                g4 = true;
            }
        }
    }

    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 && g4)
    {
        checked.assign(M, false);

        int tmp = 0;

        while (tmp < 10)
        {
            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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 348 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 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 3320 KB Output is correct
2 Correct 17 ms 3928 KB Output is correct
3 Correct 35 ms 3844 KB Output is correct
4 Correct 8 ms 1116 KB Output is correct
5 Correct 37 ms 3932 KB Output is correct
6 Correct 36 ms 3932 KB Output is correct
7 Correct 17 ms 1880 KB Output is correct
8 Correct 16 ms 2136 KB Output is correct
9 Correct 36 ms 3672 KB Output is correct
10 Correct 204 ms 3620 KB Output is correct
11 Correct 77 ms 3312 KB Output is correct
12 Correct 37 ms 3164 KB Output is correct
13 Correct 71 ms 3316 KB Output is correct
14 Correct 80 ms 2920 KB Output is correct
15 Correct 48 ms 2904 KB Output is correct
16 Correct 26 ms 2908 KB Output is correct
17 Correct 35 ms 3676 KB Output is correct
18 Correct 38 ms 3672 KB Output is correct
19 Correct 36 ms 3676 KB Output is correct
20 Correct 35 ms 3672 KB Output is correct
21 Correct 35 ms 3676 KB Output is correct
22 Correct 35 ms 3676 KB Output is correct
23 Correct 37 ms 3676 KB Output is correct
24 Correct 36 ms 3676 KB Output is correct
25 Correct 39 ms 3792 KB Output is correct
26 Correct 37 ms 3928 KB Output is correct
27 Correct 37 ms 3672 KB Output is correct
28 Correct 36 ms 3676 KB Output is correct
29 Correct 36 ms 3676 KB Output is correct
30 Correct 16 ms 3928 KB Output is correct
31 Correct 19 ms 3932 KB Output is correct
32 Correct 37 ms 3932 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 3320 KB Output is correct
2 Correct 17 ms 3928 KB Output is correct
3 Correct 35 ms 3844 KB Output is correct
4 Correct 8 ms 1116 KB Output is correct
5 Correct 37 ms 3932 KB Output is correct
6 Correct 36 ms 3932 KB Output is correct
7 Correct 17 ms 1880 KB Output is correct
8 Correct 16 ms 2136 KB Output is correct
9 Correct 36 ms 3672 KB Output is correct
10 Correct 204 ms 3620 KB Output is correct
11 Correct 77 ms 3312 KB Output is correct
12 Correct 37 ms 3164 KB Output is correct
13 Correct 71 ms 3316 KB Output is correct
14 Correct 80 ms 2920 KB Output is correct
15 Correct 48 ms 2904 KB Output is correct
16 Correct 26 ms 2908 KB Output is correct
17 Correct 35 ms 3676 KB Output is correct
18 Correct 38 ms 3672 KB Output is correct
19 Correct 36 ms 3676 KB Output is correct
20 Correct 35 ms 3672 KB Output is correct
21 Correct 35 ms 3676 KB Output is correct
22 Correct 35 ms 3676 KB Output is correct
23 Correct 37 ms 3676 KB Output is correct
24 Correct 36 ms 3676 KB Output is correct
25 Correct 39 ms 3792 KB Output is correct
26 Correct 37 ms 3928 KB Output is correct
27 Correct 37 ms 3672 KB Output is correct
28 Correct 36 ms 3676 KB Output is correct
29 Correct 36 ms 3676 KB Output is correct
30 Correct 16 ms 3928 KB Output is correct
31 Correct 19 ms 3932 KB Output is correct
32 Correct 37 ms 3932 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1848 ms 17692 KB Output is correct
37 Correct 98 ms 35924 KB Output is correct
38 Correct 205 ms 35444 KB Output is correct
39 Correct 73 ms 12544 KB Output is correct
40 Correct 201 ms 35920 KB Output is correct
41 Correct 97 ms 18244 KB Output is correct
42 Correct 92 ms 18032 KB Output is correct
43 Correct 214 ms 25160 KB Output is correct
44 Correct 238 ms 36352 KB Output is correct
45 Correct 565 ms 36176 KB Output is correct
46 Correct 367 ms 36372 KB Output is correct
47 Correct 1378 ms 31872 KB Output is correct
48 Correct 1031 ms 31824 KB Output is correct
49 Correct 283 ms 27352 KB Output is correct
50 Correct 1631 ms 27216 KB Output is correct
51 Correct 166 ms 30288 KB Output is correct
52 Correct 193 ms 35504 KB Output is correct
53 Correct 193 ms 35408 KB Output is correct
54 Correct 85 ms 33808 KB Output is correct
55 Correct 101 ms 33996 KB Output is correct
56 Correct 190 ms 33872 KB Output is correct
57 Correct 203 ms 35612 KB Output is correct
58 Correct 192 ms 35472 KB Output is correct
59 Correct 204 ms 35440 KB Output is correct
60 Correct 196 ms 35664 KB Output is correct
61 Correct 194 ms 35464 KB Output is correct
62 Correct 187 ms 35272 KB Output is correct
63 Correct 191 ms 35412 KB Output is correct
64 Correct 201 ms 35516 KB Output is correct
65 Correct 204 ms 35892 KB Output is correct
66 Correct 193 ms 35508 KB Output is correct
67 Correct 199 ms 35632 KB Output is correct
68 Correct 194 ms 35612 KB Output is correct
69 Correct 206 ms 35256 KB Output is correct
70 Correct 206 ms 35664 KB Output is correct
71 Correct 212 ms 35468 KB Output is correct
72 Correct 196 ms 35660 KB Output is correct
73 Correct 198 ms 35476 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 348 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 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 244 ms 3320 KB Output is correct
19 Correct 17 ms 3928 KB Output is correct
20 Correct 35 ms 3844 KB Output is correct
21 Correct 8 ms 1116 KB Output is correct
22 Correct 37 ms 3932 KB Output is correct
23 Correct 36 ms 3932 KB Output is correct
24 Correct 17 ms 1880 KB Output is correct
25 Correct 16 ms 2136 KB Output is correct
26 Correct 36 ms 3672 KB Output is correct
27 Correct 204 ms 3620 KB Output is correct
28 Correct 77 ms 3312 KB Output is correct
29 Correct 37 ms 3164 KB Output is correct
30 Correct 71 ms 3316 KB Output is correct
31 Correct 80 ms 2920 KB Output is correct
32 Correct 48 ms 2904 KB Output is correct
33 Correct 26 ms 2908 KB Output is correct
34 Correct 35 ms 3676 KB Output is correct
35 Correct 38 ms 3672 KB Output is correct
36 Correct 36 ms 3676 KB Output is correct
37 Correct 35 ms 3672 KB Output is correct
38 Correct 35 ms 3676 KB Output is correct
39 Correct 35 ms 3676 KB Output is correct
40 Correct 37 ms 3676 KB Output is correct
41 Correct 36 ms 3676 KB Output is correct
42 Correct 39 ms 3792 KB Output is correct
43 Correct 37 ms 3928 KB Output is correct
44 Correct 37 ms 3672 KB Output is correct
45 Correct 36 ms 3676 KB Output is correct
46 Correct 36 ms 3676 KB Output is correct
47 Correct 16 ms 3928 KB Output is correct
48 Correct 19 ms 3932 KB Output is correct
49 Correct 37 ms 3932 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1848 ms 17692 KB Output is correct
54 Correct 98 ms 35924 KB Output is correct
55 Correct 205 ms 35444 KB Output is correct
56 Correct 73 ms 12544 KB Output is correct
57 Correct 201 ms 35920 KB Output is correct
58 Correct 97 ms 18244 KB Output is correct
59 Correct 92 ms 18032 KB Output is correct
60 Correct 214 ms 25160 KB Output is correct
61 Correct 238 ms 36352 KB Output is correct
62 Correct 565 ms 36176 KB Output is correct
63 Correct 367 ms 36372 KB Output is correct
64 Correct 1378 ms 31872 KB Output is correct
65 Correct 1031 ms 31824 KB Output is correct
66 Correct 283 ms 27352 KB Output is correct
67 Correct 1631 ms 27216 KB Output is correct
68 Correct 166 ms 30288 KB Output is correct
69 Correct 193 ms 35504 KB Output is correct
70 Correct 193 ms 35408 KB Output is correct
71 Correct 85 ms 33808 KB Output is correct
72 Correct 101 ms 33996 KB Output is correct
73 Correct 190 ms 33872 KB Output is correct
74 Correct 203 ms 35612 KB Output is correct
75 Correct 192 ms 35472 KB Output is correct
76 Correct 204 ms 35440 KB Output is correct
77 Correct 196 ms 35664 KB Output is correct
78 Correct 194 ms 35464 KB Output is correct
79 Correct 187 ms 35272 KB Output is correct
80 Correct 191 ms 35412 KB Output is correct
81 Correct 201 ms 35516 KB Output is correct
82 Correct 204 ms 35892 KB Output is correct
83 Correct 193 ms 35508 KB Output is correct
84 Correct 199 ms 35632 KB Output is correct
85 Correct 194 ms 35612 KB Output is correct
86 Correct 206 ms 35256 KB Output is correct
87 Correct 206 ms 35664 KB Output is correct
88 Correct 212 ms 35468 KB Output is correct
89 Correct 196 ms 35660 KB Output is correct
90 Correct 198 ms 35476 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 0 ms 348 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 1545 ms 34544 KB Output is correct
95 Correct 125 ms 35788 KB Output is correct
96 Correct 269 ms 35776 KB Output is correct
97 Correct 144 ms 19380 KB Output is correct
98 Correct 86 ms 12636 KB Output is correct
99 Correct 202 ms 36004 KB Output is correct
100 Correct 125 ms 18244 KB Output is correct
101 Correct 119 ms 18244 KB Output is correct
102 Correct 196 ms 25544 KB Output is correct
103 Correct 325 ms 36348 KB Output is correct
104 Correct 389 ms 36356 KB Output is correct
105 Correct 430 ms 36380 KB Output is correct
106 Correct 744 ms 34648 KB Output is correct
107 Correct 531 ms 31824 KB Output is correct
108 Correct 370 ms 27536 KB Output is correct
109 Correct 991 ms 31572 KB Output is correct
110 Correct 210 ms 29456 KB Output is correct
111 Correct 255 ms 36352 KB Output is correct
112 Correct 260 ms 35924 KB Output is correct
113 Correct 102 ms 34196 KB Output is correct
114 Correct 91 ms 34248 KB Output is correct
115 Correct 245 ms 33940 KB Output is correct
116 Correct 246 ms 35920 KB Output is correct
117 Correct 249 ms 36192 KB Output is correct
118 Correct 251 ms 36172 KB Output is correct
119 Correct 244 ms 35728 KB Output is correct
120 Correct 267 ms 36140 KB Output is correct
121 Correct 1833 ms 32036 KB Output is correct
122 Correct 100 ms 35796 KB Output is correct
123 Correct 201 ms 35568 KB Output is correct
124 Correct 0 ms 348 KB Output is correct
125 Correct 1 ms 348 KB Output is correct
126 Correct 1 ms 348 KB Output is correct