이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;
int n, m, k, c;
bitset<4200> a[4200][4];
vector<bool> is(N);
int dif(int x, int y){
int ans = 0;
for(int i = 0; i < c; ++i) ans += (a[x][i] & a[y][i]).count();
return m - ans;
}
void solve(){
cin >> n >> m >> k;
string t;
if(n <= 100) c = 4;
else c = 2;
for(int i = 0; i < n; ++i){
cin >> t;
for(int j = 0; j < m; ++j){
if(t[j] == 'A') a[i][0][j] = 1;
if(t[j] == 'C') a[i][1][j] = 1;
if(t[j] == 'T') a[i][2][j] = 1;
if(t[j] == 'G') a[i][3][j] = 1;
}
}
vector<int> cur;
for(int i = 1; i < n; ++i){
if(dif(0, i) == k) cur.pb(i);
}
if(cur.size()==n-1) cout << 1;
else{
int c = 0;
while(1){
int v = cur.back(); cur.pop_back();
bool ok = 1;
for(int i = 0; i < n; ++i){
if(i==v) continue;
if(dif(i, v) != k){
ok = 0;
break;
}
}
if(ok){
cout << v + 1;
return;
}
}
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
cout << '\n';
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
genetics.cpp: In function 'void solve()':
genetics.cpp:44:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
44 | if(cur.size()==n-1) cout << 1;
| ~~~~~~~~~~^~~~~
genetics.cpp:46:13: warning: unused variable 'c' [-Wunused-variable]
46 | int c = 0;
| ^
genetics.cpp: In function 'int main()':
genetics.cpp:71:16: warning: unused variable 'aa' [-Wunused-variable]
71 | int T = 1, aa;
| ^~| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |