oj.uz

Submission #979900

# Submission time Handle Problem Language Result Execution time Memory
979900 2024-05-11T15:22:15 Z vjudge1 Genetics (BOI18_genetics) C++17
19 / 100
 2000 ms 11296 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxN  = 4'101;

int N, M, K;
bitset<maxN> A[maxN];

int main() {
    scanf("%d %d %d", &N, &M, &K);
    char buf;
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            scanf(" %c", &buf);
            if (buf == 'A') A[i][j] = 1;
        }
    }

    for (int r = 1; r <= N; r++) {
        bool valid = true;
        for (int i = 1; i <= N; i++) if (i != r) {
            if ((A[r] ^ A[i]).count() != K) {
                valid = false;
                break;
            }
        }

        if (valid) {
            printf("%d\n", r);
            exit(0);
        }
    }
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:22:39: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |             if ((A[r] ^ A[i]).count() != K) {
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~
genetics.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d %d %d", &N, &M, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:14:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |             scanf(" %c", &buf);
      |             ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 2520 KB Output is correct
2 Correct 348 ms 3040 KB Output is correct
3 Correct 720 ms 2900 KB Output is correct
4 Correct 143 ms 1372 KB Output is correct
5 Correct 148 ms 2896 KB Output is correct
6 Correct 244 ms 3132 KB Output is correct
7 Correct 107 ms 1828 KB Output is correct
8 Correct 119 ms 1672 KB Output is correct
9 Correct 114 ms 2900 KB Output is correct
10 Correct 472 ms 3164 KB Output is correct
11 Correct 174 ms 2648 KB Output is correct
12 Correct 106 ms 2720 KB Output is correct
13 Correct 161 ms 2720 KB Output is correct
14 Correct 255 ms 2200 KB Output is correct
15 Correct 135 ms 2128 KB Output is correct
16 Correct 168 ms 2264 KB Output is correct
17 Correct 315 ms 3088 KB Output is correct
18 Correct 133 ms 2896 KB Output is correct
19 Correct 323 ms 3308 KB Output is correct
20 Correct 215 ms 2900 KB Output is correct
21 Correct 459 ms 3080 KB Output is correct
22 Correct 617 ms 3076 KB Output is correct
23 Correct 674 ms 3088 KB Output is correct
24 Correct 426 ms 2900 KB Output is correct
25 Correct 145 ms 2896 KB Output is correct
26 Correct 335 ms 2900 KB Output is correct
27 Correct 241 ms 3072 KB Output is correct
28 Correct 214 ms 2940 KB Output is correct
29 Correct 441 ms 3080 KB Output is correct
30 Correct 120 ms 3080 KB Output is correct
31 Correct 119 ms 2904 KB Output is correct
32 Correct 137 ms 3104 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 2520 KB Output is correct
2 Correct 348 ms 3040 KB Output is correct
3 Correct 720 ms 2900 KB Output is correct
4 Correct 143 ms 1372 KB Output is correct
5 Correct 148 ms 2896 KB Output is correct
6 Correct 244 ms 3132 KB Output is correct
7 Correct 107 ms 1828 KB Output is correct
8 Correct 119 ms 1672 KB Output is correct
9 Correct 114 ms 2900 KB Output is correct
10 Correct 472 ms 3164 KB Output is correct
11 Correct 174 ms 2648 KB Output is correct
12 Correct 106 ms 2720 KB Output is correct
13 Correct 161 ms 2720 KB Output is correct
14 Correct 255 ms 2200 KB Output is correct
15 Correct 135 ms 2128 KB Output is correct
16 Correct 168 ms 2264 KB Output is correct
17 Correct 315 ms 3088 KB Output is correct
18 Correct 133 ms 2896 KB Output is correct
19 Correct 323 ms 3308 KB Output is correct
20 Correct 215 ms 2900 KB Output is correct
21 Correct 459 ms 3080 KB Output is correct
22 Correct 617 ms 3076 KB Output is correct
23 Correct 674 ms 3088 KB Output is correct
24 Correct 426 ms 2900 KB Output is correct
25 Correct 145 ms 2896 KB Output is correct
26 Correct 335 ms 2900 KB Output is correct
27 Correct 241 ms 3072 KB Output is correct
28 Correct 214 ms 2940 KB Output is correct
29 Correct 441 ms 3080 KB Output is correct
30 Correct 120 ms 3080 KB Output is correct
31 Correct 119 ms 2904 KB Output is correct
32 Correct 137 ms 3104 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1789 ms 9916 KB Output is correct
37 Correct 1211 ms 11296 KB Output is correct
38 Execution timed out 2009 ms 10604 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -