답안 #124717

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124717	2019-07-03T18:45:00 Z	mohammedehab2002	Martian DNA (IOI16_dna)	C++11	100 / 100	17 ms	400 KB

dna

#include "dna.h"
using namespace std;
string analyse(int n,int t)
{
	int st=0,en=n;
	while (st!=en)
	{
		int mid=(st+en+1)/2;
		if (make_test(string(mid,'0')))
		st=mid;
		else
		en=mid-1;
	}
	string ans=string(st,'0');
	int cur=st;
	while (cur<=st)
	{
		if (make_test(ans+"1"))
		{
			ans+="1";
			cur=0;
		}
		else
		{
			ans+="0";
			cur++;
		}
	}
	st=0;
	en=ans.size()-1;
	while (st!=en)
	{
		int mid=(st+en+1)/2;
		if (make_test(ans.substr(0,mid)))
		st=mid;
		else
		en=mid-1;
	}
	ans=ans.substr(0,st);
	while (ans.size()!=n)
	{
		if (make_test("0"+ans))
		ans="0"+ans;
		else
		ans="1"+ans;
	}
	return ans;
}

Compilation message

dna.cpp: In function 'std::__cxx11::string analyse(int, int)':
dna.cpp:40:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (ans.size()!=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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	252 KB	Output is correct
5	Correct	10 ms	256 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	252 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	256 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	380 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct

Subtask #3

64.0 / 64.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	6 ms	400 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	3 ms	256 KB	Output is correct
22	Correct	14 ms	376 KB	Output is correct
23	Correct	15 ms	376 KB	Output is correct
24	Correct	14 ms	376 KB	Output is correct
25	Correct	17 ms	376 KB	Output is correct
26	Correct	17 ms	376 KB	Output is correct
27	Correct	9 ms	376 KB	Output is correct
28	Correct	9 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	8 ms	376 KB	Output is correct
31	Correct	8 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	11 ms	376 KB	Output is correct
34	Correct	11 ms	376 KB	Output is correct
35	Correct	10 ms	376 KB	Output is correct
36	Correct	10 ms	376 KB	Output is correct
37	Correct	10 ms	376 KB	Output is correct
38	Correct	13 ms	376 KB	Output is correct
39	Correct	9 ms	376 KB	Output is correct