oj.uz

Submission #952959

# Submission time Handle Problem Language Result Execution time Memory
952959 2024-03-25T07:45:58 Z koukirocks Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 22908 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;
bitset<MAX> gne[MAX][4];
 
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][0][j]=(c=='A');
			gne[i][1][j]=(c=='T');
			gne[i][2][j]=(c=='C');
			gne[i][3][j]=(c=='G');
		}
	}
	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][0]^gne[j][0]).count()+(gne[i][1]^gne[j][1]).count()+(gne[i][2]^gne[j][2]).count()+(gne[i][3]^gne[j][3]).count()!=2*k) {
				flag=false;
				break;
			}
		}
		if (flag) {
			ans=i;
			break;
		}
	}
	cout<<ans<<"\n";
	return 0;
}

Compilation message

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

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 4 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2524 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 592 ms 7504 KB Output is correct
2 Correct 372 ms 7760 KB Output is correct
3 Correct 913 ms 7748 KB Output is correct
4 Correct 189 ms 5372 KB Output is correct
5 Correct 118 ms 7764 KB Output is correct
6 Correct 234 ms 7764 KB Output is correct
7 Correct 100 ms 3920 KB Output is correct
8 Correct 99 ms 4028 KB Output is correct
9 Correct 57 ms 7528 KB Output is correct
10 Correct 582 ms 7764 KB Output is correct
11 Correct 158 ms 7280 KB Output is correct
12 Correct 56 ms 7248 KB Output is correct
13 Correct 132 ms 7408 KB Output is correct
14 Correct 278 ms 6916 KB Output is correct
15 Correct 115 ms 6896 KB Output is correct
16 Correct 197 ms 6736 KB Output is correct
17 Correct 317 ms 7752 KB Output is correct
18 Correct 74 ms 7504 KB Output is correct
19 Correct 333 ms 7760 KB Output is correct
20 Correct 205 ms 7712 KB Output is correct
21 Correct 555 ms 7744 KB Output is correct
22 Correct 757 ms 7504 KB Output is correct
23 Correct 817 ms 7508 KB Output is correct
24 Correct 458 ms 7736 KB Output is correct
25 Correct 99 ms 7508 KB Output is correct
26 Correct 375 ms 7748 KB Output is correct
27 Correct 226 ms 7720 KB Output is correct
28 Correct 198 ms 7532 KB Output is correct
29 Correct 489 ms 7532 KB Output is correct
30 Correct 53 ms 7664 KB Output is correct
31 Correct 54 ms 7768 KB Output is correct
32 Correct 56 ms 7660 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 592 ms 7504 KB Output is correct
2 Correct 372 ms 7760 KB Output is correct
3 Correct 913 ms 7748 KB Output is correct
4 Correct 189 ms 5372 KB Output is correct
5 Correct 118 ms 7764 KB Output is correct
6 Correct 234 ms 7764 KB Output is correct
7 Correct 100 ms 3920 KB Output is correct
8 Correct 99 ms 4028 KB Output is correct
9 Correct 57 ms 7528 KB Output is correct
10 Correct 582 ms 7764 KB Output is correct
11 Correct 158 ms 7280 KB Output is correct
12 Correct 56 ms 7248 KB Output is correct
13 Correct 132 ms 7408 KB Output is correct
14 Correct 278 ms 6916 KB Output is correct
15 Correct 115 ms 6896 KB Output is correct
16 Correct 197 ms 6736 KB Output is correct
17 Correct 317 ms 7752 KB Output is correct
18 Correct 74 ms 7504 KB Output is correct
19 Correct 333 ms 7760 KB Output is correct
20 Correct 205 ms 7712 KB Output is correct
21 Correct 555 ms 7744 KB Output is correct
22 Correct 757 ms 7504 KB Output is correct
23 Correct 817 ms 7508 KB Output is correct
24 Correct 458 ms 7736 KB Output is correct
25 Correct 99 ms 7508 KB Output is correct
26 Correct 375 ms 7748 KB Output is correct
27 Correct 226 ms 7720 KB Output is correct
28 Correct 198 ms 7532 KB Output is correct
29 Correct 489 ms 7532 KB Output is correct
30 Correct 53 ms 7664 KB Output is correct
31 Correct 54 ms 7768 KB Output is correct
32 Correct 56 ms 7660 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Execution timed out 2029 ms 22908 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 4 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2524 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 592 ms 7504 KB Output is correct
19 Correct 372 ms 7760 KB Output is correct
20 Correct 913 ms 7748 KB Output is correct
21 Correct 189 ms 5372 KB Output is correct
22 Correct 118 ms 7764 KB Output is correct
23 Correct 234 ms 7764 KB Output is correct
24 Correct 100 ms 3920 KB Output is correct
25 Correct 99 ms 4028 KB Output is correct
26 Correct 57 ms 7528 KB Output is correct
27 Correct 582 ms 7764 KB Output is correct
28 Correct 158 ms 7280 KB Output is correct
29 Correct 56 ms 7248 KB Output is correct
30 Correct 132 ms 7408 KB Output is correct
31 Correct 278 ms 6916 KB Output is correct
32 Correct 115 ms 6896 KB Output is correct
33 Correct 197 ms 6736 KB Output is correct
34 Correct 317 ms 7752 KB Output is correct
35 Correct 74 ms 7504 KB Output is correct
36 Correct 333 ms 7760 KB Output is correct
37 Correct 205 ms 7712 KB Output is correct
38 Correct 555 ms 7744 KB Output is correct
39 Correct 757 ms 7504 KB Output is correct
40 Correct 817 ms 7508 KB Output is correct
41 Correct 458 ms 7736 KB Output is correct
42 Correct 99 ms 7508 KB Output is correct
43 Correct 375 ms 7748 KB Output is correct
44 Correct 226 ms 7720 KB Output is correct
45 Correct 198 ms 7532 KB Output is correct
46 Correct 489 ms 7532 KB Output is correct
47 Correct 53 ms 7664 KB Output is correct
48 Correct 54 ms 7768 KB Output is correct
49 Correct 56 ms 7660 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 2652 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Execution timed out 2029 ms 22908 KB Time limit exceeded
54 Halted 0 ms 0 KB -