제출 #753262

#제출 시각아이디문제언어결과실행 시간메모리
753262boyliguanhanGenetics (BOI18_genetics)C++17
0 / 100
61 ms26668 KiB
#include<bits/stdc++.h>
#define int long long
#define X d[i][j]
#define F(i,j,k) for(int i=j;i<k;++i)
using namespace std;
int n, m, k, tot, sum[4101][4], d[4101][4101], w[4101];
signed main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m >> k;
    F(i,1,n+1){
        char c; tot+=w[i]=rand();
        F(j,0,n){
            cin >> c;
            if(c=='C')X=1;
            if(c=='G')X=2;
            if(c=='T')X=3;
            sum[j][X]+=w[i];
        }
    }
    F(i,1,n+1){
        int x = 0;
        F(j,0,n){
            x+=tot-sum[j][X];
        }
        if(x==k*(tot-w[i]))
            cout << i << '\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...