oj.uz

Submission #96541

# Submission time Handle Problem Language Result Execution time Memory
96541 2019-02-10T08:48:41 Z Kastanda Genetics (BOI18_genetics) C++11
46 / 100
 2000 ms 11844 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 4105;
int n, m, k, P[N];
char A[N];
bitset < N > B[N][4];
inline int Diff(int i, int j)
{
    int diff = m;
    for (int w = 0; w <= 3; w ++)
        diff -= (B[i][w] & B[j][w]).count();
    return (diff);
}
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++)
        {
            int ch = getchar();
            A[j] = ch;
            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;
        }
    }
    srand(time(0));
    iota(P, P + n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        random_shuffle(P + 1, P + n + 1);
        int j = 1;
        for (; j <= n; j++)
            if (i != P[j] && Diff(i, P[j]) != k)
                break;
        if (j > n)
            return !printf("%d\n", i);
    }
    assert(0);
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:16: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
27.0 / 27.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1211 ms 4728 KB Output is correct
2 Correct 1599 ms 5880 KB Output is correct
3 Correct 1935 ms 5352 KB Output is correct
4 Correct 747 ms 3448 KB Output is correct
5 Correct 264 ms 5624 KB Output is correct
6 Correct 740 ms 5756 KB Output is correct
7 Correct 353 ms 3324 KB Output is correct
8 Correct 306 ms 3192 KB Output is correct
9 Correct 82 ms 5496 KB Output is correct
10 Correct 578 ms 5368 KB Output is correct
11 Correct 700 ms 4856 KB Output is correct
12 Correct 114 ms 4728 KB Output is correct
13 Correct 359 ms 4764 KB Output is correct
14 Correct 863 ms 4344 KB Output is correct
15 Correct 219 ms 4344 KB Output is correct
16 Correct 471 ms 4728 KB Output is correct
17 Correct 1438 ms 5368 KB Output is correct
18 Correct 105 ms 5240 KB Output is correct
19 Correct 1262 ms 5500 KB Output is correct
20 Correct 376 ms 5240 KB Output is correct
21 Correct 1222 ms 5368 KB Output is correct
22 Correct 1774 ms 5368 KB Output is correct
23 Correct 1828 ms 5368 KB Output is correct
24 Correct 1767 ms 5376 KB Output is correct
25 Correct 461 ms 5372 KB Output is correct
26 Correct 852 ms 5368 KB Output is correct
27 Correct 767 ms 5368 KB Output is correct
28 Correct 715 ms 5368 KB Output is correct
29 Correct 1357 ms 5368 KB Output is correct
30 Correct 77 ms 5624 KB Output is correct
31 Correct 100 ms 5624 KB Output is correct
32 Correct 80 ms 5624 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 504 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 1211 ms 4728 KB Output is correct
2 Correct 1599 ms 5880 KB Output is correct
3 Correct 1935 ms 5352 KB Output is correct
4 Correct 747 ms 3448 KB Output is correct
5 Correct 264 ms 5624 KB Output is correct
6 Correct 740 ms 5756 KB Output is correct
7 Correct 353 ms 3324 KB Output is correct
8 Correct 306 ms 3192 KB Output is correct
9 Correct 82 ms 5496 KB Output is correct
10 Correct 578 ms 5368 KB Output is correct
11 Correct 700 ms 4856 KB Output is correct
12 Correct 114 ms 4728 KB Output is correct
13 Correct 359 ms 4764 KB Output is correct
14 Correct 863 ms 4344 KB Output is correct
15 Correct 219 ms 4344 KB Output is correct
16 Correct 471 ms 4728 KB Output is correct
17 Correct 1438 ms 5368 KB Output is correct
18 Correct 105 ms 5240 KB Output is correct
19 Correct 1262 ms 5500 KB Output is correct
20 Correct 376 ms 5240 KB Output is correct
21 Correct 1222 ms 5368 KB Output is correct
22 Correct 1774 ms 5368 KB Output is correct
23 Correct 1828 ms 5368 KB Output is correct
24 Correct 1767 ms 5376 KB Output is correct
25 Correct 461 ms 5372 KB Output is correct
26 Correct 852 ms 5368 KB Output is correct
27 Correct 767 ms 5368 KB Output is correct
28 Correct 715 ms 5368 KB Output is correct
29 Correct 1357 ms 5368 KB Output is correct
30 Correct 77 ms 5624 KB Output is correct
31 Correct 100 ms 5624 KB Output is correct
32 Correct 80 ms 5624 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Execution timed out 2056 ms 11844 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 8 ms 504 KB Output is correct
5 Correct 11 ms 504 KB Output is correct
6 Correct 12 ms 504 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 7 ms 504 KB Output is correct
11 Correct 8 ms 504 KB Output is correct
12 Correct 11 ms 504 KB Output is correct
13 Correct 6 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 380 KB Output is correct
18 Correct 1211 ms 4728 KB Output is correct
19 Correct 1599 ms 5880 KB Output is correct
20 Correct 1935 ms 5352 KB Output is correct
21 Correct 747 ms 3448 KB Output is correct
22 Correct 264 ms 5624 KB Output is correct
23 Correct 740 ms 5756 KB Output is correct
24 Correct 353 ms 3324 KB Output is correct
25 Correct 306 ms 3192 KB Output is correct
26 Correct 82 ms 5496 KB Output is correct
27 Correct 578 ms 5368 KB Output is correct
28 Correct 700 ms 4856 KB Output is correct
29 Correct 114 ms 4728 KB Output is correct
30 Correct 359 ms 4764 KB Output is correct
31 Correct 863 ms 4344 KB Output is correct
32 Correct 219 ms 4344 KB Output is correct
33 Correct 471 ms 4728 KB Output is correct
34 Correct 1438 ms 5368 KB Output is correct
35 Correct 105 ms 5240 KB Output is correct
36 Correct 1262 ms 5500 KB Output is correct
37 Correct 376 ms 5240 KB Output is correct
38 Correct 1222 ms 5368 KB Output is correct
39 Correct 1774 ms 5368 KB Output is correct
40 Correct 1828 ms 5368 KB Output is correct
41 Correct 1767 ms 5376 KB Output is correct
42 Correct 461 ms 5372 KB Output is correct
43 Correct 852 ms 5368 KB Output is correct
44 Correct 767 ms 5368 KB Output is correct
45 Correct 715 ms 5368 KB Output is correct
46 Correct 1357 ms 5368 KB Output is correct
47 Correct 77 ms 5624 KB Output is correct
48 Correct 100 ms 5624 KB Output is correct
49 Correct 80 ms 5624 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 504 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Execution timed out 2056 ms 11844 KB Time limit exceeded
54 Halted 0 ms 0 KB -