oj.uz

답안 #945170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945170 2024-03-13T13:24:02 Z LucaIlie Genetics (BOI18_genetics) C++17
27 / 100
 2000 ms 4180 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++ ) {
            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]]++;
      |                             ^

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 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 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 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 1 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 4180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 4180 KB Time limit exceeded
2 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 604 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 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 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 1 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Execution timed out 2060 ms 4180 KB Time limit exceeded
19 Halted 0 ms 0 KB -