Submission #96545

# Submission time Handle Problem Language Result Execution time Memory
96545 2019-02-10T08:57:25 Z Kastanda Genetics (BOI18_genetics) C++11
19 / 100
2000 ms 2556 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];
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();
            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:18: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);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
# 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 -
# Verdict Execution time Memory Grader output
1 Correct 253 ms 1252 KB Output is correct
2 Correct 393 ms 1272 KB Output is correct
3 Correct 397 ms 1144 KB Output is correct
4 Correct 172 ms 888 KB Output is correct
5 Correct 109 ms 1272 KB Output is correct
6 Correct 242 ms 1288 KB Output is correct
7 Correct 102 ms 760 KB Output is correct
8 Correct 87 ms 760 KB Output is correct
9 Correct 64 ms 1400 KB Output is correct
10 Correct 170 ms 1144 KB Output is correct
11 Correct 187 ms 1144 KB Output is correct
12 Correct 66 ms 1144 KB Output is correct
13 Correct 111 ms 1144 KB Output is correct
14 Correct 214 ms 1052 KB Output is correct
15 Correct 81 ms 1016 KB Output is correct
16 Correct 161 ms 1016 KB Output is correct
17 Correct 337 ms 1400 KB Output is correct
18 Correct 74 ms 1144 KB Output is correct
19 Correct 309 ms 1248 KB Output is correct
20 Correct 143 ms 1272 KB Output is correct
21 Correct 294 ms 1148 KB Output is correct
22 Correct 422 ms 1272 KB Output is correct
23 Correct 446 ms 1148 KB Output is correct
24 Correct 446 ms 1272 KB Output is correct
25 Correct 164 ms 1144 KB Output is correct
26 Correct 210 ms 1144 KB Output is correct
27 Correct 215 ms 1272 KB Output is correct
28 Correct 217 ms 1144 KB Output is correct
29 Correct 357 ms 1144 KB Output is correct
30 Correct 63 ms 1272 KB Output is correct
31 Correct 64 ms 1272 KB Output is correct
32 Correct 63 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
# Verdict Execution time Memory Grader output
1 Correct 253 ms 1252 KB Output is correct
2 Correct 393 ms 1272 KB Output is correct
3 Correct 397 ms 1144 KB Output is correct
4 Correct 172 ms 888 KB Output is correct
5 Correct 109 ms 1272 KB Output is correct
6 Correct 242 ms 1288 KB Output is correct
7 Correct 102 ms 760 KB Output is correct
8 Correct 87 ms 760 KB Output is correct
9 Correct 64 ms 1400 KB Output is correct
10 Correct 170 ms 1144 KB Output is correct
11 Correct 187 ms 1144 KB Output is correct
12 Correct 66 ms 1144 KB Output is correct
13 Correct 111 ms 1144 KB Output is correct
14 Correct 214 ms 1052 KB Output is correct
15 Correct 81 ms 1016 KB Output is correct
16 Correct 161 ms 1016 KB Output is correct
17 Correct 337 ms 1400 KB Output is correct
18 Correct 74 ms 1144 KB Output is correct
19 Correct 309 ms 1248 KB Output is correct
20 Correct 143 ms 1272 KB Output is correct
21 Correct 294 ms 1148 KB Output is correct
22 Correct 422 ms 1272 KB Output is correct
23 Correct 446 ms 1148 KB Output is correct
24 Correct 446 ms 1272 KB Output is correct
25 Correct 164 ms 1144 KB Output is correct
26 Correct 210 ms 1144 KB Output is correct
27 Correct 215 ms 1272 KB Output is correct
28 Correct 217 ms 1144 KB Output is correct
29 Correct 357 ms 1144 KB Output is correct
30 Correct 63 ms 1272 KB Output is correct
31 Correct 64 ms 1272 KB Output is correct
32 Correct 63 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 900 ms 2168 KB Output is correct
37 Correct 1022 ms 2556 KB Output is correct
38 Execution timed out 2092 ms 2424 KB Time limit exceeded
39 Halted 0 ms 0 KB -
# 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 -