oj.uz

Submission #423541

# Submission time Handle Problem Language Result Execution time Memory
423541 2021-06-11T09:05:18 Z victoriad Martian DNA (IOI16_dna) C++14
36 / 100
 26 ms 360 KB 
#include "dna.h"
#include <vector>
#include <cstdlib>
using namespace std;
std::string analyse(int n, int t) {
    vector<string>r;
	string s;
	string pr;
	int x=0;
	pr.push_back('0');
	if(make_test(pr)){
		x++;
		bool final=false;
		bool principio=false;
		s=pr;
		while(x<n){
			pr=s;
			if(!final){
			pr.push_back('0');
			bool b=true;
			bool h=false;
			for(int i=0;i<r.size();i++){
				h=false;
				for(int k=0;k<r.size();k++){
					if(r[i][r.size()-1-k]!=pr[pr.size()-1-k]){
						h=true;
						break;
					}
				}
				if(!h){
					b=false;
					break;
				}
			}
			if(b)b=make_test(pr);
			if(b){
				s=pr;
				x++;
			}
			else{
				if(h)
				r.push_back(pr);
				pr.pop_back();
				pr.push_back('1');
				bool b=true;
				h=false;
				for(int i=0;i<r.size();i++){
				 h=false;
				for(int k=0;k<r.size();k++){
					if(r[i][r.size()-1-k]!=pr[pr.size()-1-k]){
						h=true;
						break;
					}
				}
				if(!h){
					b=false;
					break;
				}
					}
				if(b)b=make_test(pr);
				if(b){
					s=pr;
					x++;
				}
				else{
					if(h)
					r.push_back(pr);
					final=true;
				}
			}
			}
			if(!principio){
				string p;
				p.push_back('0');
				for(int i=0;i<s.size();i++)p.push_back(s[i]);
				bool b=true;
				bool h=false;
				for(int i=0;i<r.size();i++){
				 h=false;
				for(int k=0;k<r.size();k++){
					if(r[i][k]!=p[k]){
						h=true;
						break;
					}
				}
				if(!h){
					b=false;
					break;
				}
				}
				if(b)b=make_test(p);
				if(b){
					s=p;
					x++;
				}
				else{
					if(h)
					r.push_back(p);
					p[0]='1';
					bool b=true;
					for(int i=0;i<r.size();i++){
					 h=false;
					for(int k=0;k<r.size();k++){
					if(r[i][k]!=p[k]){
						h=true;
						break;
					}
					}
					if(!h){
					b=false;
					break;
					}
					}
					if(b)b=make_test(p);
					if(b){
						s=p;
						x++;
					}
					else{
						if(h)
						r.push_back(p);
						principio=true;
					}
				}

			}
			
		}
	}
	else{
		for(int i=0;i<n;i++)s.push_back('1');
	}
	return s;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:22:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |    for(int i=0;i<r.size();i++){
      |                ~^~~~~~~~~
dna.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int k=0;k<r.size();k++){
      |                 ~^~~~~~~~~
dna.cpp:47:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for(int i=0;i<r.size();i++){
      |                 ~^~~~~~~~~
dna.cpp:49:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for(int k=0;k<r.size();k++){
      |                 ~^~~~~~~~~
dna.cpp:75:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i=0;i<s.size();i++)p.push_back(s[i]);
      |                 ~^~~~~~~~~
dna.cpp:78:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int i=0;i<r.size();i++){
      |                 ~^~~~~~~~~
dna.cpp:80:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for(int k=0;k<r.size();k++){
      |                 ~^~~~~~~~~
dna.cpp:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |      for(int i=0;i<r.size();i++){
      |                  ~^~~~~~~~~
dna.cpp:103:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |      for(int k=0;k<r.size();k++){
      |                  ~^~~~~~~~~
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

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 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 0 ms 204 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 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 0 ms 204 KB Output is correct
26 Correct 1 ms 204 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

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 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 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Incorrect 13 ms 320 KB Too many tests
23 Incorrect 16 ms 332 KB Too many tests
24 Incorrect 24 ms 360 KB Too many tests
25 Incorrect 26 ms 312 KB Too many tests
26 Incorrect 25 ms 360 KB Too many tests
27 Incorrect 11 ms 332 KB Too many tests
28 Incorrect 12 ms 336 KB Too many tests
29 Correct 8 ms 336 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Incorrect 14 ms 344 KB Too many tests
32 Correct 7 ms 332 KB Output is correct
33 Incorrect 13 ms 304 KB Too many tests
34 Incorrect 14 ms 360 KB Too many tests
35 Incorrect 10 ms 332 KB Too many tests
36 Incorrect 10 ms 356 KB Too many tests
37 Incorrect 15 ms 352 KB Too many tests
38 Incorrect 11 ms 332 KB Too many tests
39 Incorrect 16 ms 356 KB Too many tests