oj.uz

Submission #952964

# Submission time Handle Problem Language Result Execution time Memory
952964 2024-03-25T07:58:08 Z koukirocks Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 9464 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
 
namespace{using namespace std;}
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=4200+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
 
int n,m,k;

struct gene{
	int id;
	bitset<MAX> seq[4];
}gne[MAX];
 
int main() {
	speed;
	cin>>n>>m>>k;
	for (int i=1;i<=n;i++) {
		for (int j=0;j<m;j++) {
			char c;
			cin>>c;
			gne[i].seq[0][j]=(c=='A');
			gne[i].seq[1][j]=(c=='T');
			gne[i].seq[2][j]=(c=='C');
			gne[i].seq[3][j]=(c=='G');
		}
		gne[i].id=i;
	}
	random_shuffle(gne+1,gne+1+n);
	int ans=-1;
	for (int i=1;i<=n;i++) {
		bool flag=true;
		for (int j=1;j<=n;j++) {
			if (i==j) continue;
			if ((gne[i].seq[0]^gne[j].seq[0]).count()+(gne[i].seq[1]^gne[j].seq[1]).count()+(gne[i].seq[2]^gne[j].seq[2]).count()+(gne[i].seq[3]^gne[j].seq[3]).count()!=2*k) {
				flag=false;
				break;
			}
		}
		if (flag) {
			ans=gne[i].id;
			break;
		}
	}
	cout<<ans<<"\n";
	return 0;
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:46:159: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |    if ((gne[i].seq[0]^gne[j].seq[0]).count()+(gne[i].seq[1]^gne[j].seq[1]).count()+(gne[i].seq[2]^gne[j].seq[2]).count()+(gne[i].seq[3]^gne[j].seq[3]).count()!=2*k) {
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~

Subtask #1
27.0 / 27.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 9168 KB Output is correct
2 Correct 174 ms 9048 KB Output is correct
3 Correct 407 ms 9168 KB Output is correct
4 Correct 182 ms 9164 KB Output is correct
5 Correct 163 ms 9168 KB Output is correct
6 Correct 263 ms 9052 KB Output is correct
7 Correct 48 ms 9164 KB Output is correct
8 Correct 67 ms 9052 KB Output is correct
9 Correct 135 ms 9168 KB Output is correct
10 Correct 140 ms 9172 KB Output is correct
11 Correct 159 ms 9300 KB Output is correct
12 Correct 65 ms 9052 KB Output is correct
13 Correct 76 ms 9164 KB Output is correct
14 Correct 258 ms 9164 KB Output is correct
15 Correct 189 ms 9300 KB Output is correct
16 Correct 480 ms 9172 KB Output is correct
17 Correct 98 ms 9300 KB Output is correct
18 Correct 325 ms 9052 KB Output is correct
19 Correct 442 ms 9176 KB Output is correct
20 Correct 153 ms 9052 KB Output is correct
21 Correct 160 ms 9048 KB Output is correct
22 Correct 201 ms 9184 KB Output is correct
23 Correct 228 ms 9052 KB Output is correct
24 Correct 430 ms 9164 KB Output is correct
25 Correct 145 ms 9052 KB Output is correct
26 Correct 97 ms 9052 KB Output is correct
27 Correct 290 ms 9160 KB Output is correct
28 Correct 815 ms 9304 KB Output is correct
29 Correct 673 ms 9464 KB Output is correct
30 Correct 56 ms 9052 KB Output is correct
31 Correct 57 ms 9052 KB Output is correct
32 Correct 60 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 2 ms 9052 KB Output is correct
35 Correct 2 ms 9052 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 9168 KB Output is correct
2 Correct 174 ms 9048 KB Output is correct
3 Correct 407 ms 9168 KB Output is correct
4 Correct 182 ms 9164 KB Output is correct
5 Correct 163 ms 9168 KB Output is correct
6 Correct 263 ms 9052 KB Output is correct
7 Correct 48 ms 9164 KB Output is correct
8 Correct 67 ms 9052 KB Output is correct
9 Correct 135 ms 9168 KB Output is correct
10 Correct 140 ms 9172 KB Output is correct
11 Correct 159 ms 9300 KB Output is correct
12 Correct 65 ms 9052 KB Output is correct
13 Correct 76 ms 9164 KB Output is correct
14 Correct 258 ms 9164 KB Output is correct
15 Correct 189 ms 9300 KB Output is correct
16 Correct 480 ms 9172 KB Output is correct
17 Correct 98 ms 9300 KB Output is correct
18 Correct 325 ms 9052 KB Output is correct
19 Correct 442 ms 9176 KB Output is correct
20 Correct 153 ms 9052 KB Output is correct
21 Correct 160 ms 9048 KB Output is correct
22 Correct 201 ms 9184 KB Output is correct
23 Correct 228 ms 9052 KB Output is correct
24 Correct 430 ms 9164 KB Output is correct
25 Correct 145 ms 9052 KB Output is correct
26 Correct 97 ms 9052 KB Output is correct
27 Correct 290 ms 9160 KB Output is correct
28 Correct 815 ms 9304 KB Output is correct
29 Correct 673 ms 9464 KB Output is correct
30 Correct 56 ms 9052 KB Output is correct
31 Correct 57 ms 9052 KB Output is correct
32 Correct 60 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 2 ms 9052 KB Output is correct
35 Correct 2 ms 9052 KB Output is correct
36 Correct 993 ms 9300 KB Output is correct
37 Correct 1397 ms 9296 KB Output is correct
38 Correct 308 ms 9052 KB Output is correct
39 Correct 891 ms 9168 KB Output is correct
40 Correct 1075 ms 9176 KB Output is correct
41 Correct 522 ms 9164 KB Output is correct
42 Correct 216 ms 9164 KB Output is correct
43 Correct 670 ms 9168 KB Output is correct
44 Correct 617 ms 9168 KB Output is correct
45 Correct 425 ms 9052 KB Output is correct
46 Correct 603 ms 9164 KB Output is correct
47 Correct 979 ms 9164 KB Output is correct
48 Correct 803 ms 9168 KB Output is correct
49 Correct 301 ms 9164 KB Output is correct
50 Correct 1016 ms 9300 KB Output is correct
51 Correct 266 ms 9168 KB Output is correct
52 Correct 1582 ms 9164 KB Output is correct
53 Execution timed out 2031 ms 9048 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9052 KB Output is correct
2 Correct 3 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 3 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 3 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 3 ms 9192 KB Output is correct
12 Correct 5 ms 9052 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9048 KB Output is correct
15 Correct 2 ms 9052 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9048 KB Output is correct
18 Correct 127 ms 9168 KB Output is correct
19 Correct 174 ms 9048 KB Output is correct
20 Correct 407 ms 9168 KB Output is correct
21 Correct 182 ms 9164 KB Output is correct
22 Correct 163 ms 9168 KB Output is correct
23 Correct 263 ms 9052 KB Output is correct
24 Correct 48 ms 9164 KB Output is correct
25 Correct 67 ms 9052 KB Output is correct
26 Correct 135 ms 9168 KB Output is correct
27 Correct 140 ms 9172 KB Output is correct
28 Correct 159 ms 9300 KB Output is correct
29 Correct 65 ms 9052 KB Output is correct
30 Correct 76 ms 9164 KB Output is correct
31 Correct 258 ms 9164 KB Output is correct
32 Correct 189 ms 9300 KB Output is correct
33 Correct 480 ms 9172 KB Output is correct
34 Correct 98 ms 9300 KB Output is correct
35 Correct 325 ms 9052 KB Output is correct
36 Correct 442 ms 9176 KB Output is correct
37 Correct 153 ms 9052 KB Output is correct
38 Correct 160 ms 9048 KB Output is correct
39 Correct 201 ms 9184 KB Output is correct
40 Correct 228 ms 9052 KB Output is correct
41 Correct 430 ms 9164 KB Output is correct
42 Correct 145 ms 9052 KB Output is correct
43 Correct 97 ms 9052 KB Output is correct
44 Correct 290 ms 9160 KB Output is correct
45 Correct 815 ms 9304 KB Output is correct
46 Correct 673 ms 9464 KB Output is correct
47 Correct 56 ms 9052 KB Output is correct
48 Correct 57 ms 9052 KB Output is correct
49 Correct 60 ms 9052 KB Output is correct
50 Correct 2 ms 9052 KB Output is correct
51 Correct 2 ms 9052 KB Output is correct
52 Correct 2 ms 9052 KB Output is correct
53 Correct 993 ms 9300 KB Output is correct
54 Correct 1397 ms 9296 KB Output is correct
55 Correct 308 ms 9052 KB Output is correct
56 Correct 891 ms 9168 KB Output is correct
57 Correct 1075 ms 9176 KB Output is correct
58 Correct 522 ms 9164 KB Output is correct
59 Correct 216 ms 9164 KB Output is correct
60 Correct 670 ms 9168 KB Output is correct
61 Correct 617 ms 9168 KB Output is correct
62 Correct 425 ms 9052 KB Output is correct
63 Correct 603 ms 9164 KB Output is correct
64 Correct 979 ms 9164 KB Output is correct
65 Correct 803 ms 9168 KB Output is correct
66 Correct 301 ms 9164 KB Output is correct
67 Correct 1016 ms 9300 KB Output is correct
68 Correct 266 ms 9168 KB Output is correct
69 Correct 1582 ms 9164 KB Output is correct
70 Execution timed out 2031 ms 9048 KB Time limit exceeded
71 Halted 0 ms 0 KB -