oj.uz

Submission #775346

# Submission time Handle Problem Language Result Execution time Memory
775346 2023-07-06T09:53:34 Z anha3k25cvp Martian DNA (IOI16_dna) C++14
100 / 100
 10 ms 384 KB 
#include <bits/stdc++.h>
#include "dna.h"

using namespace std;

string del(string S, int len) {
    string T;
    for (int i = 0; i + len < S.size(); i ++)
        T += S[i];
    return T;
}

string analyse(int n, int t) {
    int lo = 0, hi = n;
    while (lo < hi) {
        int mid = (lo + hi + 1) / 2;
        string S;
        for (int i = 1; i <= mid; i ++)
            S += '0';
        int val = make_test(S);
        if (val)
            lo = mid;
        else
            hi = mid - 1;
    }
    string ans;
    for (int i = 1; i <= lo; i ++)
        ans += '0';
    int check = 1, l = lo, cnt = lo;
    n -= l;
    while (1) {
        if (check) {
            string S = ans;
            S += '1';
            int add_right = make_test(S);
            if (!add_right) {
                if (cnt < l) {
                    ans += '0';
                    cnt ++;
                    n --;
                    continue;
                }
                lo = 0; hi = l;
                while (lo < hi) {
                    int mid = (lo + hi) / 2;
                    S = del(ans, mid);
                    int val = make_test(S);
                    if (val)
                        hi = mid;
                    else
                        lo = mid + 1;
                }
                ans = del(ans, lo);
                n += lo;
                if (!n)
                    break;
                check = 0;
            }
            else {
                ans += '1';
                n --;
                cnt = 0;
            }
        }
        else {
            n --;
            string S = "1";
            S += ans;
            int add_left = make_test(S);
            if (add_left)
                ans = '1' + ans;
            else
                ans = '0' + ans;
            if (!n)
                break;
        }
    }
    return ans;
}

Compilation message

dna.cpp: In function 'std::string del(std::string, int)':
dna.cpp:8:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0; i + len < S.size(); i ++)
      |                     ~~~~~~~~^~~~~~~~~~
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

# Verdict Execution time Memory 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 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 252 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory 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 0 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 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 0 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 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 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 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory 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 0 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 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 7 ms 340 KB Output is correct
23 Correct 8 ms 340 KB Output is correct
24 Correct 8 ms 376 KB Output is correct
25 Correct 10 ms 340 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 7 ms 340 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 6 ms 340 KB Output is correct
38 Correct 8 ms 356 KB Output is correct
39 Correct 4 ms 340 KB Output is correct