oj.uz

답안 #329481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329481 2020-11-21T10:03:14 Z mihai145 Martian DNA (IOI16_dna) C++14
100 / 100
 15 ms 492 KB 
#include "dna.h"

#include <cstdlib>
#include <random>

int failureCt = 19;

std::string analyse(int n, int t) {

    std::string randomSuffix = "";
    int failures = 0;

    while(failures < failureCt && randomSuffix.size() < n) {
        int rnd = rand() % 2;

        if(rnd == 0) {
            bool res = make_test(randomSuffix + '0');
            if(res == true) {
                randomSuffix += '0';
                failures = 0;
            } else {
                randomSuffix += '1';
                failures++;
            }
        } else {
            bool res = make_test(randomSuffix + '1');
            if(res == true) {
                randomSuffix += '1';
                failures = 0;
            } else {
                randomSuffix += '0';
                failures++;
            }
        }
    }

    std::string root = "", rnd = "";

    for(int i = 0; i < (int)randomSuffix.size(); i++) {
        if(i + failures >= (int)randomSuffix.size()) {
            rnd += randomSuffix[i];
        } else {
            root += randomSuffix[i];
        }
    }

    int st = 0, dr = (int)rnd.size(), sol = 0;

    while(st <= dr) {
        int mid = (st + dr) >> 1;

        std::string toQ = root;
        for(int i = 0; i < mid; i++)
            toQ += rnd[i];

        bool res = make_test(toQ);

        if(res == true) {
            sol = mid;
            st = mid + 1;
        } else {
            dr = mid - 1;
        }
    }

    for(int i = 0; i < sol; i++)
        root += rnd[i];

    while((int)root.size() < n) {
        bool res = make_test('0' + root);
        if(res == true) {
            root = '0' + root;
        } else {
            root = '1' + root;
        }
    }

    return root;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:13:55: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     while(failures < failureCt && randomSuffix.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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
64.0 / 64.0

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