oj.uz

답안 #945169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945169 2024-03-13T13:23:27 Z LucaIlie Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 44020 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 4100;
const int MAX_M = 4100;

string s[MAX_N];
int frecv[MAX_N][128];

int main() {
    int n, m, k;

    cin >> n >> m >> k;
    for ( int i = 0; i < n; i++ ) {
        cin >> s[i];
        for ( int j = 0; j < m; j++ )
            frecv[j][s[i][j]]++;
    }

    for ( int i = 0; i < n; i++ ) {
        int d = 0;
        for ( int j = 0; j < m; j++ )
            d += n - frecv[j][s[i][j]];

        if ( d == (n - 1) * k ) {
            bool ok = true;
            for ( int j = 0; j < n && ok; j++ ) {
                if ( i == j )
                    continue;
                int d = 0;
                for ( int p = 0; p < m; p++ )
                    d += (s[i][p] != s[j][p]);
                if ( d != k )
                    ok = false;
            }
            if ( ok )
                cout << i + 1 << "\n";
        }
    }

    return 0;
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:18:29: warning: array subscript has type 'char' [-Wchar-subscripts]
   18 |             frecv[j][s[i][j]]++;
      |                             ^
genetics.cpp:24:38: warning: array subscript has type 'char' [-Wchar-subscripts]
   24 |             d += n - frecv[j][s[i][j]];
      |                                      ^

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 506 ms 7000 KB Output is correct
2 Correct 60 ms 8020 KB Output is correct
3 Correct 54 ms 7508 KB Output is correct
4 Correct 12 ms 2392 KB Output is correct
5 Correct 57 ms 8040 KB Output is correct
6 Correct 56 ms 7844 KB Output is correct
7 Correct 25 ms 4176 KB Output is correct
8 Correct 25 ms 4188 KB Output is correct
9 Correct 91 ms 7508 KB Output is correct
10 Correct 551 ms 7760 KB Output is correct
11 Correct 193 ms 6852 KB Output is correct
12 Correct 177 ms 6740 KB Output is correct
13 Correct 316 ms 6740 KB Output is correct
14 Correct 157 ms 6072 KB Output is correct
15 Correct 278 ms 6224 KB Output is correct
16 Correct 40 ms 6200 KB Output is correct
17 Correct 55 ms 7504 KB Output is correct
18 Correct 53 ms 7508 KB Output is correct
19 Correct 54 ms 7520 KB Output is correct
20 Correct 53 ms 7672 KB Output is correct
21 Correct 66 ms 7508 KB Output is correct
22 Correct 53 ms 7564 KB Output is correct
23 Correct 55 ms 7508 KB Output is correct
24 Correct 55 ms 7596 KB Output is correct
25 Correct 54 ms 7508 KB Output is correct
26 Correct 57 ms 7504 KB Output is correct
27 Correct 54 ms 7504 KB Output is correct
28 Correct 54 ms 7472 KB Output is correct
29 Correct 55 ms 7508 KB Output is correct
30 Correct 69 ms 8020 KB Output is correct
31 Correct 57 ms 8016 KB Output is correct
32 Correct 57 ms 8016 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 506 ms 7000 KB Output is correct
2 Correct 60 ms 8020 KB Output is correct
3 Correct 54 ms 7508 KB Output is correct
4 Correct 12 ms 2392 KB Output is correct
5 Correct 57 ms 8040 KB Output is correct
6 Correct 56 ms 7844 KB Output is correct
7 Correct 25 ms 4176 KB Output is correct
8 Correct 25 ms 4188 KB Output is correct
9 Correct 91 ms 7508 KB Output is correct
10 Correct 551 ms 7760 KB Output is correct
11 Correct 193 ms 6852 KB Output is correct
12 Correct 177 ms 6740 KB Output is correct
13 Correct 316 ms 6740 KB Output is correct
14 Correct 157 ms 6072 KB Output is correct
15 Correct 278 ms 6224 KB Output is correct
16 Correct 40 ms 6200 KB Output is correct
17 Correct 55 ms 7504 KB Output is correct
18 Correct 53 ms 7508 KB Output is correct
19 Correct 54 ms 7520 KB Output is correct
20 Correct 53 ms 7672 KB Output is correct
21 Correct 66 ms 7508 KB Output is correct
22 Correct 53 ms 7564 KB Output is correct
23 Correct 55 ms 7508 KB Output is correct
24 Correct 55 ms 7596 KB Output is correct
25 Correct 54 ms 7508 KB Output is correct
26 Correct 57 ms 7504 KB Output is correct
27 Correct 54 ms 7504 KB Output is correct
28 Correct 54 ms 7472 KB Output is correct
29 Correct 55 ms 7508 KB Output is correct
30 Correct 69 ms 8020 KB Output is correct
31 Correct 57 ms 8016 KB Output is correct
32 Correct 57 ms 8016 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Execution timed out 2064 ms 44020 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 506 ms 7000 KB Output is correct
19 Correct 60 ms 8020 KB Output is correct
20 Correct 54 ms 7508 KB Output is correct
21 Correct 12 ms 2392 KB Output is correct
22 Correct 57 ms 8040 KB Output is correct
23 Correct 56 ms 7844 KB Output is correct
24 Correct 25 ms 4176 KB Output is correct
25 Correct 25 ms 4188 KB Output is correct
26 Correct 91 ms 7508 KB Output is correct
27 Correct 551 ms 7760 KB Output is correct
28 Correct 193 ms 6852 KB Output is correct
29 Correct 177 ms 6740 KB Output is correct
30 Correct 316 ms 6740 KB Output is correct
31 Correct 157 ms 6072 KB Output is correct
32 Correct 278 ms 6224 KB Output is correct
33 Correct 40 ms 6200 KB Output is correct
34 Correct 55 ms 7504 KB Output is correct
35 Correct 53 ms 7508 KB Output is correct
36 Correct 54 ms 7520 KB Output is correct
37 Correct 53 ms 7672 KB Output is correct
38 Correct 66 ms 7508 KB Output is correct
39 Correct 53 ms 7564 KB Output is correct
40 Correct 55 ms 7508 KB Output is correct
41 Correct 55 ms 7596 KB Output is correct
42 Correct 54 ms 7508 KB Output is correct
43 Correct 57 ms 7504 KB Output is correct
44 Correct 54 ms 7504 KB Output is correct
45 Correct 54 ms 7472 KB Output is correct
46 Correct 55 ms 7508 KB Output is correct
47 Correct 69 ms 8020 KB Output is correct
48 Correct 57 ms 8016 KB Output is correct
49 Correct 57 ms 8016 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 588 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Execution timed out 2064 ms 44020 KB Time limit exceeded
54 Halted 0 ms 0 KB -