oj.uz

답안 #524105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524105 2022-02-08T16:10:03 Z RaresFelix Martian DNA (IOI16_dna) C++17
0 / 100
 12 ms 376 KB 
#include "dna.h"

#include <cstdlib>

using namespace std;

string analyse(int n, int t) {
    string primsol = "";
    for (int i = 1; i <= n; ++i)
        if (make_test(primsol + "0"))
            primsol += "0";
        else
            primsol += "1";
    int st = 1, dr = n, mij;
    while (st < dr) {
        mij = (st + dr + 1) / 2;
        if (make_test(primsol.substr(0, mij))) st = mij;
        else dr = mij - 1;
    }
    primsol = primsol.substr(0, mij);
    for (int i = 1; i <= n - primsol.size(); ++i)
        if (make_test("0" + primsol)) primsol = "0" + primsol;
        else primsol = "1" + primsol;
    return primsol;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:21:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for (int i = 1; i <= n - primsol.size(); ++i)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~
dna.cpp:20:36: warning: 'mij' may be used uninitialized in this function [-Wmaybe-uninitialized]
   20 |     primsol = primsol.substr(0, mij);
      |                                    ^
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
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 292 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Wrong DNA
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Wrong DNA
8 Incorrect 1 ms 204 KB Wrong DNA
9 Correct 0 ms 204 KB Output is correct
10 Incorrect 1 ms 204 KB Wrong DNA
11 Incorrect 1 ms 204 KB Wrong DNA
12 Correct 1 ms 204 KB Output is correct
13 Incorrect 0 ms 204 KB Wrong DNA
14 Correct 1 ms 284 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Incorrect 1 ms 204 KB Wrong DNA
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 280 KB Output is correct
20 Incorrect 0 ms 204 KB Wrong DNA
21 Incorrect 1 ms 204 KB Wrong DNA
22 Correct 0 ms 292 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Incorrect 0 ms 204 KB Wrong DNA

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Wrong DNA
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 288 KB Wrong DNA
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Incorrect 1 ms 204 KB Wrong DNA
11 Correct 1 ms 204 KB Output is correct
12 Incorrect 1 ms 204 KB Wrong DNA
13 Incorrect 0 ms 204 KB Wrong DNA
14 Incorrect 1 ms 204 KB Wrong DNA
15 Incorrect 1 ms 204 KB Wrong DNA
16 Incorrect 0 ms 204 KB Wrong DNA
17 Incorrect 1 ms 204 KB Wrong DNA
18 Incorrect 1 ms 204 KB Wrong DNA
19 Incorrect 1 ms 204 KB Wrong DNA
20 Incorrect 1 ms 204 KB Wrong DNA
21 Incorrect 1 ms 204 KB Wrong DNA
22 Correct 1 ms 204 KB Output is correct
23 Incorrect 1 ms 332 KB Wrong DNA
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 Incorrect 1 ms 204 KB Wrong DNA
28 Incorrect 1 ms 204 KB Wrong DNA
29 Incorrect 1 ms 204 KB Wrong DNA
30 Incorrect 1 ms 204 KB Wrong DNA
31 Incorrect 1 ms 288 KB Wrong DNA
32 Incorrect 1 ms 204 KB Wrong DNA
33 Correct 1 ms 204 KB Output is correct
34 Incorrect 1 ms 204 KB Wrong DNA

Subtask #3
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 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Wrong DNA
6 Correct 0 ms 296 KB Output is correct
7 Incorrect 0 ms 204 KB Wrong DNA
8 Correct 1 ms 292 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Incorrect 1 ms 204 KB Wrong DNA
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Incorrect 0 ms 204 KB Wrong DNA
14 Correct 0 ms 204 KB Output is correct
15 Incorrect 1 ms 204 KB Wrong DNA
16 Incorrect 1 ms 204 KB Wrong DNA
17 Incorrect 0 ms 204 KB Wrong DNA
18 Incorrect 1 ms 292 KB Wrong DNA
19 Incorrect 1 ms 204 KB Wrong DNA
20 Incorrect 1 ms 204 KB Wrong DNA
21 Incorrect 1 ms 204 KB Wrong DNA
22 Incorrect 8 ms 348 KB Wrong DNA
23 Incorrect 11 ms 332 KB Wrong DNA
24 Incorrect 11 ms 372 KB Wrong DNA
25 Incorrect 12 ms 332 KB Wrong DNA
26 Incorrect 12 ms 376 KB Wrong DNA
27 Correct 6 ms 332 KB Output is correct
28 Incorrect 6 ms 332 KB Wrong DNA
29 Correct 5 ms 288 KB Output is correct
30 Correct 8 ms 284 KB Output is correct
31 Correct 7 ms 332 KB Output is correct
32 Incorrect 5 ms 332 KB Wrong DNA
33 Incorrect 11 ms 288 KB Wrong DNA
34 Incorrect 10 ms 376 KB Wrong DNA
35 Incorrect 8 ms 288 KB Wrong DNA
36 Incorrect 10 ms 332 KB Wrong DNA
37 Incorrect 10 ms 292 KB Wrong DNA
38 Correct 6 ms 332 KB Output is correct
39 Incorrect 9 ms 372 KB Wrong DNA