제출 #709536

#제출 시각아이디문제언어결과실행 시간메모리
709536stevancvGenetics (BOI18_genetics)C++14
27 / 100
554 ms15340 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) using namespace std; const int N = 4100 + 5; const int inf = 1e9; const int mod = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; vector<string> s(n); map<string, int> mp; for (int i = 0; i < n; i++) { cin >> s[i]; mp[s[i]]++; } if (n <= 100 && m <= 100) { for (int i = 0; i < n; i++) { if (mp[s[i]] > 1) continue; map<string, int> bio; int moze = 1; for (int j = 0; j < n; j++) { if (i == j || bio[s[j]] == 1) continue; int r = 0; for (int p = 0; p < m; p++) { if (s[i][p] != s[j][p]) r += 1; if (r > k || r + m - p - 1 < k) { moze = 0; break; } } if (moze == 0) break; bio[s[j]] = 1; } if (moze == 0) continue; cout << i + 1 << en; return 0; } } bitset<N> b[n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (s[i][j] == 'A') b[i][j] = 0; else b[i][j] = 1; } } for (int i = 0; i < n; i++) { int moze = 1; for (int j = 0; j < n; j++) { if (i == j) continue; bitset<N> c = b[i] ^ b[j]; if (c.count() != k) { moze = 0; break; } } if (moze == 1) { for (int xx = 0; xx < n; xx++) { for (int yy = 0; yy < n; yy++) { if (xx != yy && s[xx] == s[yy]) { assert(false); } } } cout << i + 1 << en; return 0; } } return 0; }

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

genetics.cpp: In function 'int main()':
genetics.cpp:59:27: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |             if (c.count() != k) {
      |                 ~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...