oj.uz

Submission #980602

# Submission time Handle Problem Language Result Execution time Memory
980602 2024-05-12T09:16:39 Z NoMercy Martian DNA (IOI16_dna) C++17
100 / 100
 10 ms 604 KB 
#include "dna.h"

#include <cstdlib>
#include <bits/stdc++.h>

using namespace std;

string analyse(int n, int t) {
    string res;
    
    int lo = 1, hi = n, best = 0;
    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        string tmp = res;
        for (int i = 0;i < mid;i ++) {
            tmp += '0';
        }
        if (make_test(tmp) == true) {
            lo = mid + 1;
            best = mid;
        } else {
            hi = mid - 1;
        }
    }
    for (int i = 0;i < best;i ++) {
        res += '0';
    }
    int cnt = 0 , sz = best;
    while (res.size() < n && cnt <= sz) {
        if (make_test(res + '1') == true) {
            cnt = 0;
            res += '1';
        } else {
            cnt ++;
            res += '0';
        }
    }
    lo = 1, hi = cnt, best = 0;
    while (cnt --) {
        res.pop_back();
    }
    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        string tmp = res;
        for (int i = 0;i < mid;i ++) {
            tmp += '0';
        }
        if (make_test(tmp) == true) {
            lo = mid + 1;
            best = mid;
        } else {
            hi = mid - 1;
        }
    }
    for (int i = 0;i < best;i ++) {
        res += '0';
    }
    cnt = 0;
    while (res.size() < n && cnt <= sz) {
        if (make_test('1' + res) == true) {
            cnt = 0;
            res = '1' + res;
        } else {
            cnt ++;
            res = '0' + res;
        }
    }
    lo = 1, hi = cnt, best = 0;
    reverse(res.begin() , res.end());
    while (cnt --) {
        res.pop_back();
    }
    reverse(res.begin() , res.end());
    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        string tmp = res;
        for (int i = 0;i < mid;i ++) {
            tmp = '0' + tmp;
        }
        if (make_test(tmp) == true) {
            lo = mid + 1;
            best = mid;
        } else {
            hi = mid - 1;
        }
    }
    for (int i = 0;i < best;i ++) {
        res = '0' + res;
    }
    
    return res;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:29:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |     while (res.size() < n && cnt <= sz) {
      |            ~~~~~~~~~~~^~~
dna.cpp:59:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |     while (res.size() < n && cnt <= sz) {
      |            ~~~~~~~~~~~^~~
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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 1 ms 544 KB Output is correct
7 Correct 0 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 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 432 KB Output is correct
33 Correct 1 ms 432 KB Output is correct
34 Correct 1 ms 348 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 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 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 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 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 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 7 ms 348 KB Output is correct
23 Correct 8 ms 516 KB Output is correct
24 Correct 7 ms 604 KB Output is correct
25 Correct 10 ms 348 KB Output is correct
26 Correct 9 ms 348 KB Output is correct
27 Correct 5 ms 520 KB Output is correct
28 Correct 5 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 5 ms 348 KB Output is correct
31 Correct 5 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 7 ms 348 KB Output is correct
34 Correct 7 ms 492 KB Output is correct
35 Correct 6 ms 432 KB Output is correct
36 Correct 6 ms 524 KB Output is correct
37 Correct 6 ms 496 KB Output is correct
38 Correct 4 ms 348 KB Output is correct
39 Correct 8 ms 348 KB Output is correct