이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3NRqilq ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
const int _n=4100;
pair<bitset<_n>,int> a[_n];
signed main(){
_3NRqilq;
int n,m,k;
cin>>n>>m>>k;
rep(i,n){
string s;
cin>>s;
rep(j,sz(s)){
if(s[j]=='C'){
a[i].fi[j]=1;
}
}
a[i].se=i;
}
srand(time(nullptr));
random_shuffle(a,a+n);
rep(i,n){
bool pok=1;
// print(a[i].fi);
rep(j,n/2+1){
if(j!=i and (a[i].fi^a[j].fi).count()!=k){
pok=0;
break;
}
if(n-1-j!=i and (a[i].fi^a[n-1-j].fi).count()!=k){
pok=0;
break;
}
}
if(pok){
print(a[i].se+1);
return 0;
}
}
print(-1);
}
컴파일 시 표준 에러 (stderr) 메시지
genetics.cpp: In function 'int main()':
genetics.cpp:43:41: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
43 | if(j!=i and (a[i].fi^a[j].fi).count()!=k){
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
genetics.cpp:47:49: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
47 | if(n-1-j!=i and (a[i].fi^a[n-1-j].fi).count()!=k){
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
# | 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... |