oj.uz

답안 #794824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794824 2023-07-27T00:07:40 Z bane Martian DNA (IOI16_dna) C++17
36 / 100
 9 ms 488 KB 
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;


string analyse(int n, int t) {

    int oi = 0, io = 0, ii = 0, oo = 0;
    if (n == 1){
        if (make_test("1"))return "1";
        else return "0";
    }
    oi = make_test("01");
    io = make_test("10");
    ii = make_test("11");
    oo = make_test("00");
    string ans = "";
    
    if (oi){
        ans += "01";
        --t;
    }else if(ii){
        --t;
        ans += "11";
    }
    else if(oo){
        ans +="00";
        --t;
    }
    else{
        --t;
         ans += "10";
    }
    while(t > 0 && (int)ans.size() < n){
        string ask1,ask2,ask3,ask4;
        //cout << ans << endl;
        if (ans.size() + 2 <= n){
            if(oi)ask1 = ans + "01";
            else ask1 = "4";

            if(io)ask2 = ans +  "10";
            else ask2 = "4";
            
            if(ii)ask3 = ans +  "11";
            else ask3 = "4";
            
            if(oo)ask4 = ans +  "00";
            else ask4 = "4";
            
            if (ask1 != "4"){
                --t;
                if (make_test(ask1)){
                    ans = ask1;
                    continue;
                }
            }

            if (ask2 != "4"){
                --t;
                if (make_test(ask2)){
                    ans = ask2;
                    continue;
                }
            }

            if (ask3 != "4"){
                --t;
                if (make_test(ask3)){
                    ans = ask3;
                    continue;
                }
            }

            if (ask4 != "4"){
                --t;
                if (make_test(ask4)){
                    ans = ask4;
                    continue;
                }
            }
        }
        //one element to the right
       // cout << "ttt";
        --t;
        if (make_test(ans + '1')){
            ans += '1';
            break;
        }else if (make_test(ans + '0')){
            ans += '0';
        }
        --t;
        break;
    }
    while(t > 0 && (int)ans.size() < n){
     //   cout << t << endl;
        string ask1,ask2,ask3,ask4;
      //  cout << ans << endl;
        if (ans.size() + 2 <= n){
            if(oi)ask1 = "01" + ans;
            else ask1 = "4";

            if(io)ask2 = "10" + ans;
            else ask2 = "4";
            
            if(ii)ask3 = "11" + ans;
            else ask3 = "4";
            
            if(oo)ask4 = "00" + ans;
            else ask4 = "4";
            
            if (ask1 != "4"){--t;
                if (make_test(ask1)){
                    ans = ask1;
                    
                    continue;
                }
            }

            if (ask2 != "4"){--t;
                if (make_test(ask2)){
                    ans = ask2;
                    
                    continue;
                }
            }

            if (ask3 != "4"){--t;
                if (make_test(ask3)){
                    ans = ask3;
                    
                    continue;
                }
            }

            if (ask4 != "4"){--t;
                if (make_test(ask4)){
                    ans = ask4;
                    
                    continue;
                }
            }
        }
        //one element to the right
        --t;
        if (make_test('1' + ans)){
            ans = '1' + ans;
        }else{
            ans = '0' + ans;
        }
        break;
    }
    return ans;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:37:28: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |         if (ans.size() + 2 <= n){
      |             ~~~~~~~~~~~~~~~^~~~
dna.cpp:98:28: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   98 |         if (ans.size() + 2 <= 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 1 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 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 1 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 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

Subtask #2
25.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 1 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 340 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 1 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 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 260 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct

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 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 1 ms 212 KB Output is correct
7 Correct 0 ms 228 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 1 ms 212 KB Output is correct
14 Correct 1 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 1 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 212 KB Output is correct
22 Incorrect 7 ms 484 KB Wrong DNA
23 Incorrect 8 ms 340 KB Wrong DNA
24 Incorrect 8 ms 484 KB Wrong DNA
25 Incorrect 9 ms 340 KB Wrong DNA
26 Incorrect 5 ms 468 KB Wrong DNA
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 6 ms 412 KB Output is correct
32 Correct 6 ms 340 KB Output is correct
33 Correct 5 ms 468 KB Output is correct
34 Correct 5 ms 488 KB Output is correct
35 Correct 4 ms 380 KB Output is correct
36 Correct 5 ms 484 KB Output is correct
37 Correct 4 ms 468 KB Output is correct
38 Incorrect 7 ms 340 KB Wrong DNA
39 Incorrect 6 ms 340 KB Wrong DNA