oj.uz

답안 #471459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
471459 2021-09-09T11:55:21 Z flappybird Martian DNA (IOI16_dna) C++14
100 / 100
 16 ms 420 KB 
#include "dna.h"

#include <bits/stdc++.h>
using namespace std;
typedef int ll;

std::string analyse(int N, int t) {
	string s;
	ll l, r;
	l = 0, r = N + 1;
	while (r - l > 1) {
		ll mid = (l + r) / 2;
		string q;
		for (ll i = 1; i <= mid; i++) q.push_back('1');
		if (make_test(q)) l = mid;
		else r = mid;
	}
	ll i;
	if (l == 0) {
		for (i = 1; i <= N; i++) s.push_back('0');
		return s;
	}
	for (i = 1; i <= l; i++) s.push_back('1');
	ll streak = 0;
	while (1) {
		s.insert(s.begin(), '0');
		if (make_test(s)) streak = 0;
		else {
			streak++;
			if (streak > l) {
				for (i = 0; i <= l; i++) s.erase(s.begin());
				ll low, high;
				low = 0, high = l + 1;
				while (high - low > 1) {
					ll mid = (low + high) / 2;
					for (i = 1; i <= mid; i++) s.insert(s.begin(), '1');
					if (make_test(s)) low = mid;
					else high = mid;
					for (i = 1; i <= mid; i++) s.erase(s.begin());
				}
				for (i = 1; i <= low; i++) s.insert(s.begin(), '1');
				break;
			}
			else {
				s.erase(s.begin());
				s.insert(s.begin(), '1');
			}
		}
	}
	while (s.size() < N) {
		s.push_back('0');
		if (!make_test(s)) s[s.size() - 1] = '1';
	}
	return s;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:50:18: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |  while (s.size() < N) {
      |         ~~~~~~~~~^~~
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 288 KB Output is correct
5 Correct 1 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 0 ms 204 KB Output is correct
9 Correct 1 ms 296 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 0 ms 204 KB Output is correct
14 Correct 1 ms 288 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 292 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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 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 288 KB Output is correct
20 Correct 1 ms 288 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 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 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 288 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 296 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 9 ms 376 KB Output is correct
23 Correct 11 ms 348 KB Output is correct
24 Correct 11 ms 332 KB Output is correct
25 Correct 11 ms 332 KB Output is correct
26 Correct 8 ms 352 KB Output is correct
27 Correct 8 ms 332 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 16 ms 332 KB Output is correct
31 Correct 16 ms 332 KB Output is correct
32 Correct 6 ms 292 KB Output is correct
33 Correct 7 ms 376 KB Output is correct
34 Correct 9 ms 332 KB Output is correct
35 Correct 7 ms 364 KB Output is correct
36 Correct 7 ms 336 KB Output is correct
37 Correct 7 ms 420 KB Output is correct
38 Correct 12 ms 360 KB Output is correct
39 Correct 11 ms 296 KB Output is correct