oj.uz

Submission #68330

# Submission time Handle Problem Language Result Execution time Memory
68330 2018-08-16T18:14:53 Z Pajaraja Genetics (BOI18_genetics) C++17
46 / 100
 2000 ms 57964 KB 
#include <bits/stdc++.h>
using namespace std;
int arr[4107][4107];
int uc[4][4107];
bool c[4107];
int main()
{
	ios::sync_with_stdio(false);
	int n,m,k;
	bool ps=false;
	cin>>n>>m>>k;
	string s;
	for(int i=0;i<n;i++)
	{
		cin>>s;
		for(int j=0;j<m;j++)
		{
			if(s[j]=='A') arr[i][j]=0;
			if(s[j]=='C') arr[i][j]=1;
			if(s[j]=='G') arr[i][j]=2;
			if(s[j]=='T') arr[i][j]=3;
			uc[arr[i][j]][j]++;
		}
	}
	for(int ttt=0;ttt<200000;ttt++)
	{
		int x=rand()%n,y=rand()%n;
		if(x==y) continue;
		int st=0;
		for(int t=0;t<m;t++) if(arr[x][t]!=arr[y][t]) st++;
		if(st!=k) {c[x]=c[y]=true;};
	}
	for(int i=0;i<n;i++) if(!c[i])
	{
		int skor=0;
		bool propo=false;
		for(int j=0;j<m;j++) skor+=(n-uc[arr[i][j]][j]);
		if(skor!=(n-1)*k) continue;
		for(int j=0;j<n;j++) if(i!=j)
		{
			int x=0;
			for(int t=0;t<m;t++) if(arr[i][t]!=arr[j][t]) x++;
			if(x!=k) {propo=true; break;}
		}
		if(propo) continue;
		printf("%d",i+1);
		return 0;
	}
}

Compilation message

genetics.cpp: In function 'int main()':
genetics.cpp:10:7: warning: unused variable 'ps' [-Wunused-variable]
  bool ps=false;
       ^~

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 760 KB Output is correct
2 Correct 31 ms 760 KB Output is correct
3 Correct 11 ms 376 KB Output is correct
4 Correct 27 ms 632 KB Output is correct
5 Correct 22 ms 760 KB Output is correct
6 Correct 31 ms 760 KB Output is correct
7 Correct 30 ms 632 KB Output is correct
8 Correct 14 ms 376 KB Output is correct
9 Correct 24 ms 632 KB Output is correct
10 Correct 30 ms 760 KB Output is correct
11 Correct 30 ms 760 KB Output is correct
12 Correct 30 ms 760 KB Output is correct
13 Correct 30 ms 760 KB Output is correct
14 Correct 30 ms 760 KB Output is correct
15 Correct 33 ms 760 KB Output is correct
16 Correct 12 ms 760 KB Output is correct
17 Correct 31 ms 460 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1066 ms 16632 KB Output is correct
2 Correct 509 ms 20244 KB Output is correct
3 Correct 454 ms 19324 KB Output is correct
4 Correct 146 ms 7544 KB Output is correct
5 Correct 481 ms 20320 KB Output is correct
6 Correct 471 ms 20244 KB Output is correct
7 Correct 396 ms 8952 KB Output is correct
8 Correct 421 ms 8824 KB Output is correct
9 Correct 456 ms 18936 KB Output is correct
10 Correct 742 ms 19096 KB Output is correct
11 Correct 549 ms 16680 KB Output is correct
12 Correct 453 ms 16760 KB Output is correct
13 Correct 597 ms 16736 KB Output is correct
14 Correct 544 ms 14456 KB Output is correct
15 Correct 486 ms 14716 KB Output is correct
16 Correct 391 ms 15224 KB Output is correct
17 Correct 464 ms 19320 KB Output is correct
18 Correct 462 ms 19192 KB Output is correct
19 Correct 465 ms 19448 KB Output is correct
20 Correct 462 ms 19192 KB Output is correct
21 Correct 494 ms 19448 KB Output is correct
22 Correct 472 ms 19320 KB Output is correct
23 Correct 466 ms 19340 KB Output is correct
24 Correct 462 ms 19320 KB Output is correct
25 Correct 476 ms 19172 KB Output is correct
26 Correct 520 ms 19448 KB Output is correct
27 Correct 508 ms 19192 KB Output is correct
28 Correct 485 ms 19192 KB Output is correct
29 Correct 484 ms 19296 KB Output is correct
30 Correct 450 ms 20216 KB Output is correct
31 Correct 466 ms 20216 KB Output is correct
32 Correct 469 ms 20216 KB Output is correct
33 Correct 13 ms 380 KB Output is correct
34 Correct 33 ms 760 KB Output is correct
35 Correct 29 ms 376 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1066 ms 16632 KB Output is correct
2 Correct 509 ms 20244 KB Output is correct
3 Correct 454 ms 19324 KB Output is correct
4 Correct 146 ms 7544 KB Output is correct
5 Correct 481 ms 20320 KB Output is correct
6 Correct 471 ms 20244 KB Output is correct
7 Correct 396 ms 8952 KB Output is correct
8 Correct 421 ms 8824 KB Output is correct
9 Correct 456 ms 18936 KB Output is correct
10 Correct 742 ms 19096 KB Output is correct
11 Correct 549 ms 16680 KB Output is correct
12 Correct 453 ms 16760 KB Output is correct
13 Correct 597 ms 16736 KB Output is correct
14 Correct 544 ms 14456 KB Output is correct
15 Correct 486 ms 14716 KB Output is correct
16 Correct 391 ms 15224 KB Output is correct
17 Correct 464 ms 19320 KB Output is correct
18 Correct 462 ms 19192 KB Output is correct
19 Correct 465 ms 19448 KB Output is correct
20 Correct 462 ms 19192 KB Output is correct
21 Correct 494 ms 19448 KB Output is correct
22 Correct 472 ms 19320 KB Output is correct
23 Correct 466 ms 19340 KB Output is correct
24 Correct 462 ms 19320 KB Output is correct
25 Correct 476 ms 19172 KB Output is correct
26 Correct 520 ms 19448 KB Output is correct
27 Correct 508 ms 19192 KB Output is correct
28 Correct 485 ms 19192 KB Output is correct
29 Correct 484 ms 19296 KB Output is correct
30 Correct 450 ms 20216 KB Output is correct
31 Correct 466 ms 20216 KB Output is correct
32 Correct 469 ms 20216 KB Output is correct
33 Correct 13 ms 380 KB Output is correct
34 Correct 33 ms 760 KB Output is correct
35 Correct 29 ms 376 KB Output is correct
36 Execution timed out 2095 ms 57964 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 760 KB Output is correct
2 Correct 31 ms 760 KB Output is correct
3 Correct 11 ms 376 KB Output is correct
4 Correct 27 ms 632 KB Output is correct
5 Correct 22 ms 760 KB Output is correct
6 Correct 31 ms 760 KB Output is correct
7 Correct 30 ms 632 KB Output is correct
8 Correct 14 ms 376 KB Output is correct
9 Correct 24 ms 632 KB Output is correct
10 Correct 30 ms 760 KB Output is correct
11 Correct 30 ms 760 KB Output is correct
12 Correct 30 ms 760 KB Output is correct
13 Correct 30 ms 760 KB Output is correct
14 Correct 30 ms 760 KB Output is correct
15 Correct 33 ms 760 KB Output is correct
16 Correct 12 ms 760 KB Output is correct
17 Correct 31 ms 460 KB Output is correct
18 Correct 1066 ms 16632 KB Output is correct
19 Correct 509 ms 20244 KB Output is correct
20 Correct 454 ms 19324 KB Output is correct
21 Correct 146 ms 7544 KB Output is correct
22 Correct 481 ms 20320 KB Output is correct
23 Correct 471 ms 20244 KB Output is correct
24 Correct 396 ms 8952 KB Output is correct
25 Correct 421 ms 8824 KB Output is correct
26 Correct 456 ms 18936 KB Output is correct
27 Correct 742 ms 19096 KB Output is correct
28 Correct 549 ms 16680 KB Output is correct
29 Correct 453 ms 16760 KB Output is correct
30 Correct 597 ms 16736 KB Output is correct
31 Correct 544 ms 14456 KB Output is correct
32 Correct 486 ms 14716 KB Output is correct
33 Correct 391 ms 15224 KB Output is correct
34 Correct 464 ms 19320 KB Output is correct
35 Correct 462 ms 19192 KB Output is correct
36 Correct 465 ms 19448 KB Output is correct
37 Correct 462 ms 19192 KB Output is correct
38 Correct 494 ms 19448 KB Output is correct
39 Correct 472 ms 19320 KB Output is correct
40 Correct 466 ms 19340 KB Output is correct
41 Correct 462 ms 19320 KB Output is correct
42 Correct 476 ms 19172 KB Output is correct
43 Correct 520 ms 19448 KB Output is correct
44 Correct 508 ms 19192 KB Output is correct
45 Correct 485 ms 19192 KB Output is correct
46 Correct 484 ms 19296 KB Output is correct
47 Correct 450 ms 20216 KB Output is correct
48 Correct 466 ms 20216 KB Output is correct
49 Correct 469 ms 20216 KB Output is correct
50 Correct 13 ms 380 KB Output is correct
51 Correct 33 ms 760 KB Output is correct
52 Correct 29 ms 376 KB Output is correct
53 Execution timed out 2095 ms 57964 KB Time limit exceeded
54 Halted 0 ms 0 KB -