oj.uz

답안 #786924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786924 2023-07-18T14:48:22 Z PagodePaiva Martian DNA (IOI16_dna) C++14
11 / 100
 10 ms 388 KB 
#include "dna.h"
#include <bits/stdc++.h>
#include <cstdlib>
#define pb push_back
#define all(v) v.begin(), v.end()

using namespace std;
string res;
string per;

string analyse(int n, int t) {

    int con = 0;

    // frente

    while(res.size() < n){
        // cout << ":)\n";
        string aux;
        aux = per;
        aux.pb('1');

        if(aux.size() > n and con == 0){
            break;
        }

        else if(con > 0 and aux.size() > n){
            for(int i = 0;i < con;i++){
                if(res.size() == n) break;
                res.pb('0');
                if(!make_test(res)){
                    res.pop_back();
                    break;
                }
            }
            break;
        }

        if(make_test(aux)){
            res = aux;
            per = aux;
            con = 0;
        }

        else{
            aux.pop_back();
            aux.pb('0');
            per = aux;
            con++;
            if(con >= 20){
                for(int i = 0;i < con;i++){
                    res.pb('0');
                    if(!make_test(res)){
                        res.pop_back();
                        break;
                    }
                }
                break;
            }
        }
    }

    // bunda

    while(res.size() < n){
        reverse(all(res));
        res.pb('0');
        reverse(all(res));

        if(!make_test(res)){
            reverse(all(res));
            res.pop_back();
            res.pb('1');
            reverse(all(res));
        }
    }

    return res;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:17:22: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   17 |     while(res.size() < n){
      |           ~~~~~~~~~~~^~~
dna.cpp:23:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |         if(aux.size() > n and con == 0){
      |            ~~~~~~~~~~~^~~
dna.cpp:27:40: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |         else if(con > 0 and aux.size() > n){
      |                             ~~~~~~~~~~~^~~
dna.cpp:29:31: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |                 if(res.size() == n) break;
      |                    ~~~~~~~~~~~^~~~
dna.cpp:65:22: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |     while(res.size() < n){
      |           ~~~~~~~~~~~^~~
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 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 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 272 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
11 Correct 1 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 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 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 Incorrect 0 ms 212 KB Wrong DNA
28 Correct 0 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 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Incorrect 0 ms 212 KB Wrong DNA

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 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 1 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 8 ms 340 KB Output is correct
23 Correct 10 ms 340 KB Output is correct
24 Correct 10 ms 364 KB Output is correct
25 Correct 10 ms 340 KB Output is correct
26 Correct 8 ms 380 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 5 ms 340 KB Output is correct
32 Incorrect 9 ms 352 KB Wrong DNA
33 Correct 8 ms 364 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 7 ms 340 KB Output is correct
36 Correct 7 ms 340 KB Output is correct
37 Correct 6 ms 340 KB Output is correct
38 Correct 7 ms 340 KB Output is correct
39 Incorrect 7 ms 388 KB Wrong DNA