oj.uz

답안 #677990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677990 2023-01-04T22:34:40 Z Doncho_Bonboncho Martian DNA (IOI16_dna) C++14
11 / 100
 70 ms 528 KB 
#include "dna.h"
#include <bits/stdc++.h>

std::string analyse(int n, int t) {
	std::string nas = "";

	if( !make_test( "0" ) ){
		for( int i=0 ; i<n ; i++ ) nas += '1';
		return nas;
	}
	int l = 0, r = n+1;
	while( l != r-1 ){
		int m = ( l + r ) >> 1;
	//	std::cerr<<m<<"\n";
		std::string curr = "";
		for( int i=0 ; i<m ; i++ ) curr += '0';
		if( make_test( curr ) ) l = m;
		else r = m;
	}
	
	//std::cerr<<" ! "<<l<<"\n";

	for( int i=0 ; i<l ; i++ ) nas += '0';

	//std::cerr<<" ^ "<<nas<<"\n";

	l = 1, r = n+1;
	char add = '1';
	while( l ){
		l = 0, r = n - nas.size() +1;
		while( l != r-1 ){
			int m = ( l + r ) >> 1;
			std::string curr = "";
			for( int i=0 ; i<m ; i++ ) curr += add;
			curr = nas  + curr;
			if( make_test( curr ) ) l = m;
			else r = m;

		}
		for( int i=0 ; i<l ; i++ ) nas += add;
	//	std::cerr<<" ^ "<<nas<<"\n";

		if( add == '1' ) add = '0';
		else add = '1';
	}

	l = 1;
	add = '1';
	while( l ){
		l = 0, r = n - nas.size() +1;
		while( l != r-1 ){
			int m = ( l + r ) >> 1;
			std::string curr = "";
			for( int i=0 ; i<m ; i++ ) curr += add;
			curr = curr + nas;
	//		std::cerr<<" & "<<curr<<"\n";
			if( make_test( curr ) ) l = m;
			else r = m;
		}
	
		for( int i=0 ; i<l ; i++ ) nas = add + nas;
		if( add == '1' ) add = '0';
		else add = '1';
	}

    return nas;
}

Compilation message

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 0 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 300 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 216 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Incorrect 35 ms 400 KB Too many tests
23 Incorrect 36 ms 528 KB Too many tests
24 Incorrect 34 ms 416 KB Too many tests
25 Incorrect 43 ms 392 KB Too many tests
26 Incorrect 43 ms 376 KB Too many tests
27 Incorrect 53 ms 500 KB Too many tests
28 Incorrect 53 ms 376 KB Too many tests
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Incorrect 70 ms 296 KB Too many tests
34 Incorrect 70 ms 424 KB Too many tests
35 Incorrect 64 ms 380 KB Too many tests
36 Incorrect 67 ms 340 KB Too many tests
37 Incorrect 61 ms 376 KB Too many tests
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct