oj.uz

답안 #432800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
432800 2021-06-18T13:26:21 Z amunduzbaev Martian DNA (IOI16_dna) C++14
100 / 100
 14 ms 384 KB 
#include "dna.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include "bits/stdc++.h"
using namespace std;

#define sz(x) (int)x.size()

//~ int n;

string make_str(int bit, int len){
	string ss;
	for(int i=0;i<len;i++) ss = ss + char(bit + '0');
	return ss;
}

bool ask(int bit, int len) { return make_test(make_str(bit, len)); }

/*

00110
10110
11011

*/

string analyse(int N, int t) {
	//~ n = N;
	int n = N;
	int l = 1, r = n;
	int bit = 1;
	if(!make_test("1")) bit = 0;
	while(l < r){
		int m = (l + r + 1)>>1;
		if(ask(bit, m)) l = m;
		else r = m - 1;
	}
	
	int len = l;
	string ss;
	for(int i=0;i<len;i++) ss = ss + char(bit + '0'); 
	
	//~ cout<<ss<<"\n";
	
	if(make_test(string(ss + char((bit ^ 1) + '0')))){
		int last = 0;
		ss += char((bit ^ 1) + '0');
		while(sz(ss) < n && last <= len){
			if(make_test(string(ss + char((bit ^ 1) + '0')))) ss += char((bit ^ 1) + '0'), last = 0;
			else ss += char(bit + '0'), last++;
		} 
		
		//~ cout<<ss<<"\n";
		
		int l = 0, r = 0;
		while(!ss.empty() && ss.back() == char(bit + '0')) ss.pop_back(), r++;
		//~ if(r > len) r = len;
		
		//~ cout<<ss<<"\n";
		
		//~ int l = 0, r = len;
		while(l + 1 < r){
			int m = (l + r)>>1;
			if(make_test(string(ss + make_str(bit, m)))) l = m;
			else r = m;
		} 
		
		if(make_test(string(ss + make_str(bit, r)))) ss += make_str(bit, r);
		else ss += make_str(bit, l);
		
		//~ cout<<ss<<"\n";
	}
	
	while(sz(ss) < n){
		if(make_test(string(char((bit ^ 1) + '0') + ss))) ss = char((bit ^ 1) + '0') + ss;
		else ss = char(bit + '0') + ss;
	} return ss;
}

/*

00000
00001
00010
00011
00100
00101
00

*/

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 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 1 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 1 ms 204 KB Output is correct
9 Correct 0 ms 204 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 0 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 0 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

# 결과 실행 시간 메모리 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 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 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 0 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
64.0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 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 1 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 0 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 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 11 ms 332 KB Output is correct
23 Correct 13 ms 332 KB Output is correct
24 Correct 13 ms 332 KB Output is correct
25 Correct 14 ms 372 KB Output is correct
26 Correct 12 ms 384 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 6 ms 332 KB Output is correct
33 Correct 11 ms 384 KB Output is correct
34 Correct 11 ms 380 KB Output is correct
35 Correct 8 ms 336 KB Output is correct
36 Correct 9 ms 332 KB Output is correct
37 Correct 10 ms 364 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 6 ms 332 KB Output is correct