oj.uz

Submission #984482

# Submission time Handle Problem Language Result Execution time Memory
984482 2024-05-16T17:30:55 Z Ahmed57 Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 35592 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
const int T = 60;
int nah[T][4101][4];
int sz[T];
bitset<4101>xd[T];
mt19937 rng;
signed main(){
    rng.seed(time(0));
    int n,m,k;
    cin>>n>>m>>k;
    vector<string> v(n);
    for(int i = 0;i<n;i++)cin>>v[i];
    for(int it = 0;it<T;it++){
        for(int j = 0;j<n;j++){
            if(rng()%2){
                xd[it][j] = 1;
                sz[it]++;
                for(int e = 0;e<m;e++){
                    if(v[j][e]=='A')nah[it][e][0]++;
                    else if(v[j][e]=='C')nah[it][e][1]++;
                    else if(v[j][e]=='G')nah[it][e][2]++;
                    else nah[it][e][3]++;
                }
            }
        }
    }
    for(int i = 0;i<n;i++){
        bool bad = 0;
        for(int it = 0;it<T;it++){
            int lol = k*sz[it];
            if(xd[it][i]){
                lol-=k;
            }
            for(int e = 0;e<m;e++){
                if(v[i][e]=='A')lol-=nah[it][e][1]+nah[it][e][2]+nah[it][e][3];
                if(v[i][e]=='C')lol-=nah[it][e][0]+nah[it][e][2]+nah[it][e][3];
                if(v[i][e]=='G')lol-=nah[it][e][0]+nah[it][e][1]+nah[it][e][3];
                if(v[i][e]=='T')lol-=nah[it][e][0]+nah[it][e][1]+nah[it][e][2];
            }
            if(lol!=0){
                bad = 1;
                break;
            }
        }
        if(bad==0){
            cout<<i+1<<endl;
            return 0;
        }
    }
}

Subtask #1
27.0 / 27.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 10092 KB Output is correct
2 Correct 203 ms 10576 KB Output is correct
3 Correct 499 ms 10576 KB Output is correct
4 Correct 106 ms 7764 KB Output is correct
5 Correct 492 ms 10692 KB Output is correct
6 Correct 511 ms 10644 KB Output is correct
7 Correct 220 ms 8788 KB Output is correct
8 Correct 211 ms 8784 KB Output is correct
9 Correct 455 ms 10508 KB Output is correct
10 Correct 498 ms 10512 KB Output is correct
11 Correct 406 ms 10304 KB Output is correct
12 Correct 402 ms 10068 KB Output is correct
13 Correct 411 ms 10092 KB Output is correct
14 Correct 351 ms 9812 KB Output is correct
15 Correct 353 ms 10116 KB Output is correct
16 Correct 351 ms 10068 KB Output is correct
17 Correct 490 ms 10500 KB Output is correct
18 Correct 469 ms 10452 KB Output is correct
19 Correct 481 ms 10416 KB Output is correct
20 Correct 473 ms 10448 KB Output is correct
21 Correct 484 ms 10576 KB Output is correct
22 Correct 490 ms 10700 KB Output is correct
23 Correct 502 ms 10708 KB Output is correct
24 Correct 505 ms 10460 KB Output is correct
25 Correct 467 ms 10712 KB Output is correct
26 Correct 475 ms 10440 KB Output is correct
27 Correct 481 ms 10444 KB Output is correct
28 Correct 475 ms 10856 KB Output is correct
29 Correct 479 ms 10492 KB Output is correct
30 Correct 215 ms 10688 KB Output is correct
31 Correct 235 ms 10648 KB Output is correct
32 Correct 498 ms 10768 KB Output is correct
33 Correct 1 ms 6488 KB Output is correct
34 Correct 2 ms 6748 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 10092 KB Output is correct
2 Correct 203 ms 10576 KB Output is correct
3 Correct 499 ms 10576 KB Output is correct
4 Correct 106 ms 7764 KB Output is correct
5 Correct 492 ms 10692 KB Output is correct
6 Correct 511 ms 10644 KB Output is correct
7 Correct 220 ms 8788 KB Output is correct
8 Correct 211 ms 8784 KB Output is correct
9 Correct 455 ms 10508 KB Output is correct
10 Correct 498 ms 10512 KB Output is correct
11 Correct 406 ms 10304 KB Output is correct
12 Correct 402 ms 10068 KB Output is correct
13 Correct 411 ms 10092 KB Output is correct
14 Correct 351 ms 9812 KB Output is correct
15 Correct 353 ms 10116 KB Output is correct
16 Correct 351 ms 10068 KB Output is correct
17 Correct 490 ms 10500 KB Output is correct
18 Correct 469 ms 10452 KB Output is correct
19 Correct 481 ms 10416 KB Output is correct
20 Correct 473 ms 10448 KB Output is correct
21 Correct 484 ms 10576 KB Output is correct
22 Correct 490 ms 10700 KB Output is correct
23 Correct 502 ms 10708 KB Output is correct
24 Correct 505 ms 10460 KB Output is correct
25 Correct 467 ms 10712 KB Output is correct
26 Correct 475 ms 10440 KB Output is correct
27 Correct 481 ms 10444 KB Output is correct
28 Correct 475 ms 10856 KB Output is correct
29 Correct 479 ms 10492 KB Output is correct
30 Correct 215 ms 10688 KB Output is correct
31 Correct 235 ms 10648 KB Output is correct
32 Correct 498 ms 10768 KB Output is correct
33 Correct 1 ms 6488 KB Output is correct
34 Correct 2 ms 6748 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Execution timed out 2053 ms 35592 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 1 ms 6604 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 437 ms 10092 KB Output is correct
19 Correct 203 ms 10576 KB Output is correct
20 Correct 499 ms 10576 KB Output is correct
21 Correct 106 ms 7764 KB Output is correct
22 Correct 492 ms 10692 KB Output is correct
23 Correct 511 ms 10644 KB Output is correct
24 Correct 220 ms 8788 KB Output is correct
25 Correct 211 ms 8784 KB Output is correct
26 Correct 455 ms 10508 KB Output is correct
27 Correct 498 ms 10512 KB Output is correct
28 Correct 406 ms 10304 KB Output is correct
29 Correct 402 ms 10068 KB Output is correct
30 Correct 411 ms 10092 KB Output is correct
31 Correct 351 ms 9812 KB Output is correct
32 Correct 353 ms 10116 KB Output is correct
33 Correct 351 ms 10068 KB Output is correct
34 Correct 490 ms 10500 KB Output is correct
35 Correct 469 ms 10452 KB Output is correct
36 Correct 481 ms 10416 KB Output is correct
37 Correct 473 ms 10448 KB Output is correct
38 Correct 484 ms 10576 KB Output is correct
39 Correct 490 ms 10700 KB Output is correct
40 Correct 502 ms 10708 KB Output is correct
41 Correct 505 ms 10460 KB Output is correct
42 Correct 467 ms 10712 KB Output is correct
43 Correct 475 ms 10440 KB Output is correct
44 Correct 481 ms 10444 KB Output is correct
45 Correct 475 ms 10856 KB Output is correct
46 Correct 479 ms 10492 KB Output is correct
47 Correct 215 ms 10688 KB Output is correct
48 Correct 235 ms 10648 KB Output is correct
49 Correct 498 ms 10768 KB Output is correct
50 Correct 1 ms 6488 KB Output is correct
51 Correct 2 ms 6748 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Execution timed out 2053 ms 35592 KB Time limit exceeded
54 Halted 0 ms 0 KB -