oj.uz

답안 #882290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882290 2023-12-03T01:29:05 Z pirhosig Martian DNA (IOI16_dna) C++17
100 / 100
 10 ms 608 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;



string analyse(int n, int t)
{
    string res;
    if (n < 500)
    {
        bool forward = true;
        for (int i = 0; i < n; ++i)
        {
            if (forward)
            {
                if (make_test(res + '0')) res += '0';
                else if (make_test(res + '1')) res += '1';
                else forward = false;
            }
            if (!forward)
            {
                res.insert(0, 1, '0');
                if (!make_test(res)) res[0] = '1';
            }
        }
    }
    else
    {
        int len = 0;
        int val = 0;
        while (val < n) {
            if (rand() % 2) {
                res.append("0");
                if (make_test(res)) len = val;
                else res.back() = '1';
            }
            else {
                res.append("1");
                if (make_test(res)) len = val;
                else res.back() = '0';
            }
            val++;
            if (val - len == 11) {
                bool full = true;
                while (len < val) {
                    int mid = (len + val + 1) / 2;
                    if (make_test(res.substr(0, mid))) len = mid;
                    else {
                        for (int i = 0; i <= val - mid; ++i) res.pop_back();
                        val = mid - 1;
                        goto end;
                    }
                }
            }
        }
        end:
        while (len < val) {
            int mid = (len + val + 1) / 2;
            if (make_test(res.substr(0, mid))) len = mid;
            else {
                for (int i = 0; i <= val - mid; ++i) res.pop_back();
                val = mid - 1;
            }
        }
        while (len < n) {
            res.insert(0, 1, '0');
            if (!make_test(res)) res[0] = '1';
            len++;
        }
    }

    return res;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:45:22: warning: unused variable 'full' [-Wunused-variable]
   45 |                 bool full = true;
      |                      ^~~~
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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
64.0 / 64.0

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