oj.uz

Submission #979899

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

using ll = long long;

const int maxN  = 123;

char id[256];

int N, M, K;
int A[maxN][maxN];

int main() {
    id['A'] = 0; id['C'] = 1; id['G'] = 2; id['T'] = 3;

    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);
            A[i][j] = id[buf];
        }
    }

    for (int r = 1; r <= N; r++) {
        bool valid = true;
        for (int i = 1; i <= N; i++) if (i != r) {
            int diff = 0;
            for (int c = 1; c <= M; c++) {
                if (A[r][c] != A[i][c]) diff++;
            }
            if (diff != K) {
                valid = false;
                break;
            }
        }

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

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:21:26: warning: array subscript has type 'char' [-Wchar-subscripts]
   21 |             A[i][j] = id[buf];
      |                          ^~~
genetics.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%d %d %d", &N, &M, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
genetics.cpp:20:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |             scanf(" %c", &buf);
      |             ~~~~~^~~~~~~~~~~~~

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 600 KB Output isn't correct
2 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 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 7 ms 600 KB Output isn't correct
19 Halted 0 ms 0 KB -