oj.uz

Submission #888349

# Submission time Handle Problem Language Result Execution time Memory
888349 2023-12-17T03:39:23 Z 1075508020060209tc Genetics (BOI18_genetics) C++14
46 / 100
 2000 ms 582248 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//const int mod=998244353;
unsigned long long seed=1234;
unsigned long long rnd(){
seed^=seed<<13;
seed^=seed>>7;
seed^=seed>>6;
return seed;
}

int n;int m;int K;
int gr[4105][4105];
int ps[4][4105][4105];
int mby[4105];
void init(){
cin>>n>>m>>K;
string s;
for(int i=1;i<=n;i++){
    cin>>s;
    s="*"+s;
    for(int j=1;j<=m;j++){
        if(s[j]=='A'){
            gr[i][j]=0;
        }
        if(s[j]=='C'){
            gr[i][j]=1;
        }
        if(s[j]=='G'){
            gr[i][j]=2;
        }
        if(s[j]=='T'){
            gr[i][j]=3;
        }
    }
}
for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
        ps[gr[i][j]][i][j]++;
        for(int k=0;k<4;k++){
            ps[k][i][j]+=ps[k][i-1][j];
        }
    }
}

}

int ok(int id){
int dif=0;
for(int i=1;i<=m;i++){
    dif+=n-ps[gr[id][i]][n][i];
}
if(dif!=K*(n-1)){return 0;}
for(int ttt=1;ttt<=20;ttt++){
    int pl=1+rnd()%n;
    dif=0;
    for(int i=1;i<=m;i++){
        dif+=pl-ps[gr[id][i]][pl][i];
    }
    if(dif!=K*pl-((pl>=id)*K) ){return 0;}
    dif=0;
    pl--;
    for(int i=1;i<=m;i++){
        dif+=(n-pl)-(ps[gr[id][i]][n][i]-ps[gr[id][i]][pl][i]);
    }
    if(dif!=K*(n-pl)-((pl<id)*K) ){return 0;}
}
for(int ttt=1;ttt<=20;ttt++){
    int pl=1+rnd()%n;
    if(pl==id){continue;}
    dif=0;
    for(int i=1;i<=m;i++){
        if(gr[id][i]!=gr[pl][i]){dif++;}
        if(dif>K){break;}
    }
    if(dif!=K){
        mby[pl]=-1;
        return 0;
    }
}
return 1;
}

int fchk(int id){

for(int pl=1;pl<=n;pl++){
    if(pl==id){continue;}
    int dif=0;
    for(int i=1;i<=m;i++){
        if(gr[id][i]!=gr[pl][i]){dif++;}
    }
    if(dif!=K){return 0;}
}
return 1;
}

signed main(){
init();
for(int i=1;i<=n;i++){
    if(mby[i]==-1){continue;}
    mby[i]=ok(i);
    /*if(mby[i]){
        cout<<i;return 0;
    }*/
}
for(int i=1;i<=n;i++){
    if(mby[i]==1&&fchk(i)){
        cout<<i;return 0;
    }

}


}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17244 KB Output is correct
2 Correct 3 ms 21244 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 17244 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 1 ms 4600 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 3 ms 19036 KB Output is correct
12 Correct 3 ms 21232 KB Output is correct
13 Correct 3 ms 21184 KB Output is correct
14 Correct 3 ms 21080 KB Output is correct
15 Correct 3 ms 19292 KB Output is correct
16 Correct 3 ms 21080 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 246452 KB Output is correct
2 Correct 93 ms 293456 KB Output is correct
3 Correct 102 ms 279308 KB Output is correct
4 Correct 34 ms 187984 KB Output is correct
5 Correct 103 ms 293392 KB Output is correct
6 Correct 103 ms 294736 KB Output is correct
7 Correct 45 ms 128468 KB Output is correct
8 Correct 51 ms 127184 KB Output is correct
9 Correct 111 ms 281268 KB Output is correct
10 Correct 216 ms 282384 KB Output is correct
11 Correct 120 ms 246236 KB Output is correct
12 Correct 97 ms 248812 KB Output is correct
13 Correct 92 ms 247360 KB Output is correct
14 Correct 73 ms 214616 KB Output is correct
15 Correct 180 ms 215636 KB Output is correct
16 Correct 78 ms 241120 KB Output is correct
17 Correct 104 ms 281108 KB Output is correct
18 Correct 98 ms 277072 KB Output is correct
19 Correct 99 ms 282316 KB Output is correct
20 Correct 98 ms 278096 KB Output is correct
21 Correct 102 ms 280404 KB Output is correct
22 Correct 100 ms 278100 KB Output is correct
23 Correct 98 ms 279024 KB Output is correct
24 Correct 98 ms 279124 KB Output is correct
25 Correct 97 ms 277124 KB Output is correct
26 Correct 98 ms 278996 KB Output is correct
27 Correct 98 ms 277072 KB Output is correct
28 Correct 98 ms 278100 KB Output is correct
29 Correct 100 ms 280268 KB Output is correct
30 Correct 95 ms 294740 KB Output is correct
31 Correct 94 ms 294672 KB Output is correct
32 Correct 103 ms 294680 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 3 ms 21084 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 246452 KB Output is correct
2 Correct 93 ms 293456 KB Output is correct
3 Correct 102 ms 279308 KB Output is correct
4 Correct 34 ms 187984 KB Output is correct
5 Correct 103 ms 293392 KB Output is correct
6 Correct 103 ms 294736 KB Output is correct
7 Correct 45 ms 128468 KB Output is correct
8 Correct 51 ms 127184 KB Output is correct
9 Correct 111 ms 281268 KB Output is correct
10 Correct 216 ms 282384 KB Output is correct
11 Correct 120 ms 246236 KB Output is correct
12 Correct 97 ms 248812 KB Output is correct
13 Correct 92 ms 247360 KB Output is correct
14 Correct 73 ms 214616 KB Output is correct
15 Correct 180 ms 215636 KB Output is correct
16 Correct 78 ms 241120 KB Output is correct
17 Correct 104 ms 281108 KB Output is correct
18 Correct 98 ms 277072 KB Output is correct
19 Correct 99 ms 282316 KB Output is correct
20 Correct 98 ms 278096 KB Output is correct
21 Correct 102 ms 280404 KB Output is correct
22 Correct 100 ms 278100 KB Output is correct
23 Correct 98 ms 279024 KB Output is correct
24 Correct 98 ms 279124 KB Output is correct
25 Correct 97 ms 277124 KB Output is correct
26 Correct 98 ms 278996 KB Output is correct
27 Correct 98 ms 277072 KB Output is correct
28 Correct 98 ms 278100 KB Output is correct
29 Correct 100 ms 280268 KB Output is correct
30 Correct 95 ms 294740 KB Output is correct
31 Correct 94 ms 294672 KB Output is correct
32 Correct 103 ms 294680 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 3 ms 21084 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Execution timed out 2103 ms 582248 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17244 KB Output is correct
2 Correct 3 ms 21244 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 17244 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 1 ms 4600 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 3 ms 19036 KB Output is correct
12 Correct 3 ms 21232 KB Output is correct
13 Correct 3 ms 21184 KB Output is correct
14 Correct 3 ms 21080 KB Output is correct
15 Correct 3 ms 19292 KB Output is correct
16 Correct 3 ms 21080 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 339 ms 246452 KB Output is correct
19 Correct 93 ms 293456 KB Output is correct
20 Correct 102 ms 279308 KB Output is correct
21 Correct 34 ms 187984 KB Output is correct
22 Correct 103 ms 293392 KB Output is correct
23 Correct 103 ms 294736 KB Output is correct
24 Correct 45 ms 128468 KB Output is correct
25 Correct 51 ms 127184 KB Output is correct
26 Correct 111 ms 281268 KB Output is correct
27 Correct 216 ms 282384 KB Output is correct
28 Correct 120 ms 246236 KB Output is correct
29 Correct 97 ms 248812 KB Output is correct
30 Correct 92 ms 247360 KB Output is correct
31 Correct 73 ms 214616 KB Output is correct
32 Correct 180 ms 215636 KB Output is correct
33 Correct 78 ms 241120 KB Output is correct
34 Correct 104 ms 281108 KB Output is correct
35 Correct 98 ms 277072 KB Output is correct
36 Correct 99 ms 282316 KB Output is correct
37 Correct 98 ms 278096 KB Output is correct
38 Correct 102 ms 280404 KB Output is correct
39 Correct 100 ms 278100 KB Output is correct
40 Correct 98 ms 279024 KB Output is correct
41 Correct 98 ms 279124 KB Output is correct
42 Correct 97 ms 277124 KB Output is correct
43 Correct 98 ms 278996 KB Output is correct
44 Correct 98 ms 277072 KB Output is correct
45 Correct 98 ms 278100 KB Output is correct
46 Correct 100 ms 280268 KB Output is correct
47 Correct 95 ms 294740 KB Output is correct
48 Correct 94 ms 294672 KB Output is correct
49 Correct 103 ms 294680 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 3 ms 21084 KB Output is correct
52 Correct 1 ms 4700 KB Output is correct
53 Execution timed out 2103 ms 582248 KB Time limit exceeded
54 Halted 0 ms 0 KB -