Submission #251397

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
251397	2020-07-21T06:37:14 Z	tinjyu	Martian DNA (IOI16_dna)	C++14	36 / 100	23 ms	388 KB

dna

#include "dna.h"
#include <iostream>
#include <cstdlib>
using namespace std;

string ans,tmp;
std::string analyse(int n, int t) {
    ans="";
    //cout<<"ok"<<endl;
    while(true)
    {
    	tmp=ans+"0";
    	if(make_test(tmp)==1)
    	{
    		ans=ans+"0";
    		continue;
		}
		tmp=ans+"1";
		if(make_test(tmp)==1)
		{
			ans=ans+"1";
			continue;
		}
		else 
		{
			break;
		}
		//cout<<ans<<endl;
	}
	//cout<<ans<<endl;
	while(true)
	{
		tmp="0"+ans;
    	if(make_test(tmp)==1)
    	{
    		ans="0"+ans;
    		continue;
		}
		tmp="1"+ans;
		if(make_test(tmp)==1)
		{
			ans="1"+ans;
		}
		else 
		{
			break;
		}
	}
	long long int l=1,r=n;
	string tmpans;
    return ans;
}

Compilation message

dna.cpp: In function 'std::__cxx11::string analyse(int, int)':
dna.cpp:49:16: warning: unused variable 'l' [-Wunused-variable]
  long long int l=1,r=n;
                ^
dna.cpp:49:20: warning: unused variable 'r' [-Wunused-variable]
  long long int l=1,r=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	1 ms	256 KB	Output is correct
6	Correct	1 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	0 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 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	384 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 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	0 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	1 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	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	1 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	1 ms	256 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	0 ms	256 KB	Output is correct
25	Correct	1 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	1 ms	256 KB	Output is correct
32	Correct	1 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct

Subtask #3

0 / 64.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 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	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 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	1 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	1 ms	256 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Incorrect	15 ms	384 KB	Too many tests
23	Incorrect	19 ms	384 KB	Too many tests
24	Incorrect	20 ms	384 KB	Too many tests
25	Incorrect	22 ms	384 KB	Too many tests
26	Incorrect	23 ms	384 KB	Too many tests
27	Incorrect	11 ms	384 KB	Too many tests
28	Incorrect	10 ms	388 KB	Too many tests
29	Correct	7 ms	384 KB	Output is correct
30	Incorrect	16 ms	384 KB	Too many tests
31	Incorrect	16 ms	384 KB	Too many tests
32	Correct	7 ms	384 KB	Output is correct
33	Incorrect	14 ms	384 KB	Too many tests
34	Incorrect	14 ms	384 KB	Too many tests
35	Incorrect	12 ms	384 KB	Too many tests
36	Incorrect	13 ms	384 KB	Too many tests
37	Incorrect	14 ms	384 KB	Too many tests
38	Incorrect	12 ms	384 KB	Too many tests
39	Incorrect	15 ms	384 KB	Too many tests