제출 #473477

#제출 시각아이디문제언어결과실행 시간메모리
473477Ahmadsm2005Genetics (BOI18_genetics)C++17
46 / 100
2051 ms20908 KiB
#include <bits/stdc++.h> #define endl '\n' #define modulo 998244353 #define modulo2 998244353 #define eps 0.00000001 //#define int long long #define PI acos(-1) #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") //#pragma GCC optimize("trapv") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops") #define sinDegrees(x) sin((x) * PI / 180.0) #define cosDegrees(x) cos((x) * PI / 180.0) #define tanDegrees(x) tan((x) * PI / 180.0) #define atanDegrees(x) atan(x)* 180.0 / PI #define asinDegrees(x) asin(x)* 180.0 / PI #define EPS 0.000000001 using namespace std; int power(int x,int y,int m=modulo) { if(y<0) return 0; int temp; if(y == 0) return 1; temp = (power(x, y/2,m))%m; if (y%2 == 0) return ((temp%m)*temp)%m; else return ((x*temp%m)*temp%m)%m; } int inv(int x,int m=modulo) { return (power(x,m-2,m))%m; } int n,m,k; bool BAD[4100],GOOD[4100][4100]; string s; int lolz[4100]; bitset<4100>wow[4100]; bitset<4100>wow2[4100]; bitset<4100>TEMP; bitset<4100>TEMP2; int32_t main() { cin.tie(0),iostream::sync_with_stdio(0); //freopen("halfnice.in","r",stdin); cin>>n>>m>>k; mt19937 rng(2005); for(int i=0;i<n;i++){ cin>>s; lolz[i]=i; for(int l=0;l<m;l++){ if(s[l]=='C') wow[i][l]=1; else if(s[l]=='T') wow2[i][l]=1; else if(s[l]=='G') wow[i][l]=1,wow2[i][l]=1; } } while(1){ shuffle(lolz,lolz+n,rng); if(BAD[lolz[0]]) continue; for(int i=1;i<n;i++){ if(GOOD[lolz[0]][lolz[i]]) continue; TEMP=wow[lolz[0]]^wow[lolz[i]]; TEMP2=wow2[lolz[0]]^wow2[lolz[i]]; TEMP|=TEMP2; if(TEMP.count()!=k){ BAD[lolz[0]]=1,BAD[lolz[i]]=1; goto a; } else GOOD[lolz[0]][lolz[i]]=1,GOOD[lolz[i]][lolz[0]]=1; } cout<<lolz[0]+1<<endl; break; a:; } }

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

genetics.cpp: In function 'int32_t main()':
genetics.cpp:74:16: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 | if(TEMP.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...