oj.uz

Submission #122908

# Submission time Handle Problem Language Result Execution time Memory
122908 2019-06-29T14:20:09 Z miguel Genetics (BOI18_genetics) C++14
27 / 100
 890 ms 1784 KB 
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, int>
#define vi vector <int>
const ll mod = 1000000007;
#define int ll
int n, m, k;
string s[101];
bitset <4101> ss[4100];

int gcd(int a, int b){
    if(a==0) return b;
    else return gcd(b%a, a);
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n>>m>>k;
    if(n<=100 && m<=100){
        for(int i=1; i<=n; i++) cin>>s[i];
        for(int i=1; i<=n; i++){
            bool ctrl=1;
            for(int j=1; j<=n; j++){
                if(j!=i){
                    int dif=0;
                    for(int ix=0; ix<m; ix++)
                        if(s[i][ix]!=s[j][ix]) dif++;
                    if(dif!=k){
                        ctrl=0;
                        continue;
                    }
                }
            }
            if(ctrl) return cout<<i, 0;
        }
    }
    for(int i=0; i<n; i++){
        string xd;
        cin>>xd;
        for(int j=0; j<m; j++) ss[i]|=((1<<j)*(xd[j]=='A'));
    }
    for(int i=0; i<n; i++){
        bool ctrl=1;
        for(int j=0; j<n; j++){
            if(i==j) continue;
            if((ss[i]^ss[j]).count()!=k){
                //cout<<i<<" "<<j<<" "<<(ss[i]^ss[j]).count()<<endl;
                ctrl=0;
                continue;
            }
        }
        if(ctrl) return cout<<i+1, 0;
    }
}

Compilation message

genetics.cpp: In function 'int32_t main()':
genetics.cpp:54:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if((ss[i]^ss[j]).count()!=k){
                ~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 380 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 890 ms 1784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 890 ms 1784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 380 KB Output is correct
18 Incorrect 890 ms 1784 KB Output isn't correct
19 Halted 0 ms 0 KB -