제출 #945169

#제출 시각아이디문제언어결과실행 시간메모리
945169LucaIlieGenetics (BOI18_genetics)C++17
46 / 100
2064 ms44020 KiB
#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; }

컴파일 시 표준 에러 (stderr) 메시지

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]];
      |                                      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...