oj.uz

Submission #251411

# Submission time Handle Problem Language Result Execution time Memory
251411 2020-07-21T07:19:39 Z tinjyu Martian DNA (IOI16_dna) C++14
100 / 100
 14 ms 392 KB 
#include "dna.h"
#include <iostream>
#include <cstdlib>
using namespace std;

string ans,tmp;
std::string analyse(int n, int t) {
    ans="";
    long long int cnt=0;
    while(ans.length()<n)
    {
    	long long int temp=rand()%2;
    	if(temp==0)tmp=ans+"0";
    	else tmp=ans+"1";

		if(make_test(tmp)==1)
    	{
    		ans=tmp;
    		cnt=0;
		}
		else 
		{
			if(temp==1)ans+="0";
			else ans+="1";
			cnt++;
			if(cnt==12 || ans.length()==n)
			{
				for(int i=max(1,12-n+1);i<=12;i++)
				{
					string te="";
					for(int j=1;j<=ans.length()-12+i;j++)
					{
						te+=ans[j-1];
					}
					if(make_test(te)==0)
					{
						te="";
						for(int j=1;j<=ans.length()-12+i-1;j++)
						{
							te+=ans[j-1];
						}
						ans=te;
						break;
					}
				}
				break;
			}
		}
	}
	while(ans.length()<n)
	{
		tmp="0"+ans;
    	if(make_test(tmp)==1)
    	{
    		ans="0"+ans;
		}
		else 
		{
			ans="1"+ans;
		}
	}
    return ans;
}

Compilation message

dna.cpp: In function 'std::__cxx11::string analyse(int, int)':
dna.cpp:10:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ans.length()<n)
           ~~~~~~~~~~~~^~
dna.cpp:26:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(cnt==12 || ans.length()==n)
                  ~~~~~~~~~~~~^~~
dna.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int j=1;j<=ans.length()-12+i;j++)
                  ~^~~~~~~~~~~~~~~~~~~
dna.cpp:38:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int j=1;j<=ans.length()-12+i-1;j++)
                   ~^~~~~~~~~~~~~~~~~~~~~
dna.cpp:50:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(ans.length()<n)
        ~~~~~~~~~~~~^~
grader.cpp: In function 'bool make_test(std::__cxx11::string)':
grader.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < p.size(); i++) {
                  ~~^~~~~~~~~~
grader.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i <= ss.size(); i++) {
                  ~~^~~~~~~~~~~~
grader.cpp:28:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (pr[i] == p.size()) {

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 14 ms 384 KB Output is correct
23 Correct 12 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 9 ms 392 KB Output is correct
26 Correct 12 ms 384 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 9 ms 384 KB Output is correct
30 Correct 9 ms 384 KB Output is correct
31 Correct 9 ms 384 KB Output is correct
32 Correct 8 ms 388 KB Output is correct
33 Correct 8 ms 384 KB Output is correct
34 Correct 9 ms 384 KB Output is correct
35 Correct 10 ms 384 KB Output is correct
36 Correct 9 ms 384 KB Output is correct
37 Correct 9 ms 384 KB Output is correct
38 Correct 12 ms 384 KB Output is correct
39 Correct 11 ms 384 KB Output is correct