oj.uz

Submission #96551

# Submission time Handle Problem Language Result Execution time Memory
96551 2019-02-10T09:15:36 Z Kastanda Genetics (BOI18_genetics) C++11
19 / 100
 2000 ms 7416 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
using namespace std;
const int N = 4105;
int n, m, k, P[N], Q[N];
bitset < N > B[N];
inline int Diff(int i, int j)
{
    return ((B[i] ^ B[j]).count());
    /*int diff = m;
    for (int w = 0; w <= 3; w ++)
        diff -= (B[i][w] & B[j][w]).count();
    return (diff);*/
}
mt19937 Rnd(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
    scanf("%d%d%d", &n, &m, &k);
    getchar();
    for (int i = 1; i <= n; i++, getchar())
    {
        for (int j = 1; j <= m; j++)
        {
            B[i][j] = (getchar() == 'A');
            /*int ch = getchar();
            if (ch == 'A') ch = 0;
            else if (ch == 'C') ch = 1;
            else if (ch == 'G') ch = 2;
            else ch = 3;
            B[i][ch][j] = 1;*/
        }
    }
    iota(P, P + n + 1, 0);
    iota(Q, Q + n + 1, 0);
    shuffle(Q + 1, Q + n + 1, Rnd);
    for (int i = 1; i <= n; i++)
    {
        int &id = Q[i];
        if (i % 20 == 0)
            shuffle(P + 1, P + n + 1, Rnd);
        int j = 1;
        for (; j <= n; j++)
            if (id != P[j] && Diff(id, P[j]) != k)
                break;
        if (j > n)
            return !printf("%d\n", id);
    }
    assert(0);
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Runtime error 6 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 1212 KB Output is correct
2 Correct 280 ms 1396 KB Output is correct
3 Correct 374 ms 1272 KB Output is correct
4 Correct 158 ms 888 KB Output is correct
5 Correct 393 ms 1272 KB Output is correct
6 Correct 81 ms 1272 KB Output is correct
7 Correct 105 ms 760 KB Output is correct
8 Correct 56 ms 760 KB Output is correct
9 Correct 117 ms 1144 KB Output is correct
10 Correct 110 ms 1144 KB Output is correct
11 Correct 88 ms 1144 KB Output is correct
12 Correct 148 ms 1144 KB Output is correct
13 Correct 219 ms 1188 KB Output is correct
14 Correct 67 ms 1016 KB Output is correct
15 Correct 152 ms 1016 KB Output is correct
16 Correct 72 ms 1144 KB Output is correct
17 Correct 217 ms 1144 KB Output is correct
18 Correct 324 ms 1144 KB Output is correct
19 Correct 385 ms 1272 KB Output is correct
20 Correct 269 ms 1144 KB Output is correct
21 Correct 314 ms 1144 KB Output is correct
22 Correct 131 ms 1144 KB Output is correct
23 Correct 194 ms 1400 KB Output is correct
24 Correct 112 ms 1144 KB Output is correct
25 Correct 249 ms 1144 KB Output is correct
26 Correct 226 ms 1144 KB Output is correct
27 Correct 87 ms 1144 KB Output is correct
28 Correct 162 ms 1144 KB Output is correct
29 Correct 435 ms 1144 KB Output is correct
30 Correct 62 ms 1272 KB Output is correct
31 Correct 64 ms 1272 KB Output is correct
32 Correct 67 ms 1272 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 1212 KB Output is correct
2 Correct 280 ms 1396 KB Output is correct
3 Correct 374 ms 1272 KB Output is correct
4 Correct 158 ms 888 KB Output is correct
5 Correct 393 ms 1272 KB Output is correct
6 Correct 81 ms 1272 KB Output is correct
7 Correct 105 ms 760 KB Output is correct
8 Correct 56 ms 760 KB Output is correct
9 Correct 117 ms 1144 KB Output is correct
10 Correct 110 ms 1144 KB Output is correct
11 Correct 88 ms 1144 KB Output is correct
12 Correct 148 ms 1144 KB Output is correct
13 Correct 219 ms 1188 KB Output is correct
14 Correct 67 ms 1016 KB Output is correct
15 Correct 152 ms 1016 KB Output is correct
16 Correct 72 ms 1144 KB Output is correct
17 Correct 217 ms 1144 KB Output is correct
18 Correct 324 ms 1144 KB Output is correct
19 Correct 385 ms 1272 KB Output is correct
20 Correct 269 ms 1144 KB Output is correct
21 Correct 314 ms 1144 KB Output is correct
22 Correct 131 ms 1144 KB Output is correct
23 Correct 194 ms 1400 KB Output is correct
24 Correct 112 ms 1144 KB Output is correct
25 Correct 249 ms 1144 KB Output is correct
26 Correct 226 ms 1144 KB Output is correct
27 Correct 87 ms 1144 KB Output is correct
28 Correct 162 ms 1144 KB Output is correct
29 Correct 435 ms 1144 KB Output is correct
30 Correct 62 ms 1272 KB Output is correct
31 Correct 64 ms 1272 KB Output is correct
32 Correct 67 ms 1272 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 723 ms 2168 KB Output is correct
37 Correct 1873 ms 2680 KB Output is correct
38 Correct 393 ms 2436 KB Output is correct
39 Correct 921 ms 6008 KB Output is correct
40 Execution timed out 2059 ms 7416 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Runtime error 6 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -