oj.uz

Submission #96543

# Submission time Handle Problem Language Result Execution time Memory
96543 2019-02-10T08:52:26 Z Kastanda Genetics (BOI18_genetics) C++11
19 / 100
 2000 ms 7416 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];
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);*/
}
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 assert(0);
            //else if (ch == 'G') ch = 2;
            //else ch = 3;
            //B[i][ch][j] = 1;
            B[i][j] = ch;
        }
    }
    srand(time(0));
    iota(P, P + n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        if (i % 20 == 0)
            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:17: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 376 KB Output is correct
2 Runtime error 5 ms 504 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 336 ms 1144 KB Output is correct
2 Correct 410 ms 1272 KB Output is correct
3 Correct 505 ms 1272 KB Output is correct
4 Correct 193 ms 1144 KB Output is correct
5 Correct 108 ms 1272 KB Output is correct
6 Correct 257 ms 1400 KB Output is correct
7 Correct 117 ms 760 KB Output is correct
8 Correct 104 ms 760 KB Output is correct
9 Correct 61 ms 1144 KB Output is correct
10 Correct 188 ms 1272 KB Output is correct
11 Correct 240 ms 1144 KB Output is correct
12 Correct 63 ms 1144 KB Output is correct
13 Correct 129 ms 1144 KB Output is correct
14 Correct 255 ms 1144 KB Output is correct
15 Correct 94 ms 1016 KB Output is correct
16 Correct 148 ms 1016 KB Output is correct
17 Correct 461 ms 1272 KB Output is correct
18 Correct 75 ms 1272 KB Output is correct
19 Correct 371 ms 1272 KB Output is correct
20 Correct 170 ms 1144 KB Output is correct
21 Correct 356 ms 1144 KB Output is correct
22 Correct 519 ms 1272 KB Output is correct
23 Correct 522 ms 1272 KB Output is correct
24 Correct 476 ms 1284 KB Output is correct
25 Correct 160 ms 1144 KB Output is correct
26 Correct 284 ms 1272 KB Output is correct
27 Correct 225 ms 1144 KB Output is correct
28 Correct 212 ms 1272 KB Output is correct
29 Correct 451 ms 1376 KB Output is correct
30 Correct 63 ms 1272 KB Output is correct
31 Correct 64 ms 1272 KB Output is correct
32 Correct 67 ms 1220 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 380 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 336 ms 1144 KB Output is correct
2 Correct 410 ms 1272 KB Output is correct
3 Correct 505 ms 1272 KB Output is correct
4 Correct 193 ms 1144 KB Output is correct
5 Correct 108 ms 1272 KB Output is correct
6 Correct 257 ms 1400 KB Output is correct
7 Correct 117 ms 760 KB Output is correct
8 Correct 104 ms 760 KB Output is correct
9 Correct 61 ms 1144 KB Output is correct
10 Correct 188 ms 1272 KB Output is correct
11 Correct 240 ms 1144 KB Output is correct
12 Correct 63 ms 1144 KB Output is correct
13 Correct 129 ms 1144 KB Output is correct
14 Correct 255 ms 1144 KB Output is correct
15 Correct 94 ms 1016 KB Output is correct
16 Correct 148 ms 1016 KB Output is correct
17 Correct 461 ms 1272 KB Output is correct
18 Correct 75 ms 1272 KB Output is correct
19 Correct 371 ms 1272 KB Output is correct
20 Correct 170 ms 1144 KB Output is correct
21 Correct 356 ms 1144 KB Output is correct
22 Correct 519 ms 1272 KB Output is correct
23 Correct 522 ms 1272 KB Output is correct
24 Correct 476 ms 1284 KB Output is correct
25 Correct 160 ms 1144 KB Output is correct
26 Correct 284 ms 1272 KB Output is correct
27 Correct 225 ms 1144 KB Output is correct
28 Correct 212 ms 1272 KB Output is correct
29 Correct 451 ms 1376 KB Output is correct
30 Correct 63 ms 1272 KB Output is correct
31 Correct 64 ms 1272 KB Output is correct
32 Correct 67 ms 1220 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 380 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 1142 ms 2296 KB Output is correct
37 Correct 1228 ms 2464 KB Output is correct
38 Execution timed out 2075 ms 7416 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

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