oj.uz

답안 #403968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403968 2021-05-13T16:01:42 Z Iwanttobreakfree Martian DNA (IOI16_dna) C++
36 / 100
 160 ms 1348 KB 
#include "dna.h"
#include <string>
#include <cstdlib>
#include <set>
using namespace std;
string analyse(int n, int t){
	int k;
	string str,prueba;
	bool first=false,posz,poso;
	set<string> s;
	while(true){
		
	poso=posz=true;
	if(str.length()==n)return str;
	if(!first){
		
	prueba=str+'0';
	k=prueba.length();	
	for(string x:s){
		int m=x.length();
			if(prueba.substr(k-m,m)==x){
				posz=false;
			}
	}
	
	if(make_test(str+'0')&&posz){
		str+='0';
		continue;
	}
	else if(posz)s.insert(str+'0');
	
	prueba=str+'1';
	k=prueba.length();
	for(string x:s){
		int m=x.length();
			if(prueba.substr(k-m,m)==x){
				poso=false;
			}
	}
	
	if(make_test(str+'1')&&poso){
		str+='1';
		continue;
	}
	else if(poso)s.insert(str+'1');
	first=true;
}

	if(first){
		
	prueba='0'+str;
	k=prueba.length();
	for(string x:s){
		int m=x.length();
			if(prueba.substr(0,m)==x){
				posz=false;
			}
	}
	
	if(make_test('0'+str)&&posz){
		str='0'+str;
		continue;
	}
	else if(posz)s.insert('0'+str);
	
	prueba='1'+str;
	k=prueba.length();
	for(string x:s){
		int m=x.length();
			if(prueba.substr(0,m)==x){
				poso=false;
			}
	}
	
	if(make_test('1'+str)&&poso){
		str='1'+str;
		continue;
	}
	else if(poso)s.insert('1'+str);
	}
}
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:14:17: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   14 |  if(str.length()==n)return str;
      |     ~~~~~~~~~~~~^~~
grader.cpp: In function 'bool make_test(std::string)':
grader.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for (int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~
grader.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for (int i = 1; i <= ss.size(); i++) {
      |                  ~~^~~~~~~~~~~~
grader.cpp:28:13: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   if (pr[i] == p.size()) {

Subtask #1
11.0 / 11.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 204 KB Output is correct
22 Incorrect 77 ms 832 KB Too many tests
23 Incorrect 75 ms 712 KB Too many tests
24 Incorrect 73 ms 668 KB Too many tests
25 Incorrect 77 ms 708 KB Too many tests
26 Incorrect 72 ms 708 KB Too many tests
27 Incorrect 11 ms 412 KB Too many tests
28 Incorrect 12 ms 332 KB Too many tests
29 Correct 7 ms 332 KB Output is correct
30 Incorrect 15 ms 332 KB Too many tests
31 Incorrect 160 ms 1348 KB Too many tests
32 Correct 7 ms 332 KB Output is correct
33 Incorrect 64 ms 732 KB Too many tests
34 Incorrect 65 ms 712 KB Too many tests
35 Incorrect 65 ms 716 KB Too many tests
36 Incorrect 46 ms 524 KB Too many tests
37 Incorrect 56 ms 684 KB Too many tests
38 Incorrect 58 ms 1160 KB Too many tests
39 Incorrect 57 ms 820 KB Too many tests