oj.uz

답안 #979907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979907 2024-05-11T15:41:27 Z NoMercy Martian DNA (IOI16_dna) C++17
11 / 100
 65 ms 760 KB 
#include "dna.h"

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

using namespace std;

string analyse(int n, int t) {
    string res;
    int ind = 1;
    while ((int)res.size() < n) {
        int lo = 0 , hi = n - (int)res.size() , best = -1;
        while (lo <= hi) {
            int mid = (lo + hi) / 2;
            string tmp = res;
            for (int i = 0;i <= mid;i ++) {
                tmp += (ind + '0');
            }
            if (make_test(tmp) == true) {
                lo = mid + 1;
                best = mid;
            } else {
                hi = mid - 1;
            }
        }
        if (best == -1) {
            break;
        }
        for (int i = 0;i <= best;i ++) {
            res += (ind + '0');
        }
        ind = 1 - ind;
    }
    ind = 0;
    while ((int)res.size() < n) {
        int lo = 0 , hi = n - (int)res.size() , best = -1;
        while (lo <= hi) {
            int mid = (lo + hi) / 2;
            string tmp;
            for (int i = 0;i <= mid;i ++) {
                tmp += (ind + '0');
            }
            for (int i = 0;i < res.size();i ++) {
                tmp += res[i];
            }
            if (make_test(tmp) == true) {
                lo = mid + 1;
                best = mid;
            } else {
                hi = mid - 1;
            }
        }
        if (best == -1) {
            break;
        }
        for (int i = 0;i <= best;i ++) {
            res = char(ind + '0') + res;
        }
        ind = 1 - ind;
    }
    return res;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:43:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |             for (int i = 0;i < res.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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 432 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 1 ms 348 KB Output is correct
20 Correct 0 ms 440 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
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 1 ms 432 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 432 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 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 544 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 1 ms 348 KB Too many tests
18 Incorrect 1 ms 432 KB Too many tests
19 Correct 1 ms 348 KB Output is correct
20 Incorrect 1 ms 348 KB Too many tests
21 Incorrect 1 ms 348 KB Too many tests
22 Incorrect 1 ms 348 KB Too many tests
23 Incorrect 1 ms 348 KB Too many tests
24 Correct 0 ms 432 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Incorrect 1 ms 348 KB Too many tests
29 Incorrect 1 ms 348 KB Too many tests
30 Incorrect 1 ms 348 KB Too many tests
31 Incorrect 1 ms 348 KB Too many tests
32 Incorrect 1 ms 348 KB Too many tests
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 440 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 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 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 Incorrect 33 ms 348 KB Too many tests
23 Incorrect 36 ms 520 KB Too many tests
24 Incorrect 37 ms 464 KB Too many tests
25 Incorrect 36 ms 344 KB Too many tests
26 Incorrect 33 ms 348 KB Too many tests
27 Incorrect 47 ms 492 KB Too many tests
28 Incorrect 48 ms 760 KB Too many tests
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 61 ms 344 KB Too many tests
34 Incorrect 58 ms 348 KB Too many tests
35 Incorrect 59 ms 512 KB Too many tests
36 Incorrect 65 ms 604 KB Too many tests
37 Incorrect 59 ms 548 KB Too many tests
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct