oj.uz

Submission #594485

# Submission time Handle Problem Language Result Execution time Memory
594485 2022-07-12T14:10:11 Z yutabi Combo (IOI18_combo) C++14
100 / 100
 78 ms 564 KB 
#include "combo.h"


#include <vector>




std::string guess_sequence(int N)
{
    char start='A';

    char buttons[]={'A','B','X'};

    std::vector <char> ans;

    std::string query="";

    query="AB";

    if(press(query)>0)
    {
        query="A";

        if(press(query)>0)
        {
            start='A';
        }

        else
        {
            start='B';
        }
    }

    else
    {
        query="X";

        if(press(query)>0)
        {
            start='X';
        }

        else
        {
            start='Y';
        }
    }

    if(buttons[0]==start)
    {
        std::swap(buttons[0],buttons[1]);
    }

    if(buttons[1]==start)
    {
        std::swap(buttons[2],buttons[1]);
    }

    if(buttons[2]==start)
    {
        buttons[2]='Y';
    }

    //cout << start << ' ' << buttons[0] << ' ' << buttons[1] << ' ' << buttons[2] << endl;

    ans.clear();
    ans.push_back(start);

    for(int i=1;i<N-1;i++)
    {
        query="";

        for(int j=0;j<ans.size();j++)
        {
            query+=ans[j];
        }

        query+=buttons[0];
        query+=buttons[0];

        for(int j=0;j<ans.size();j++)
        {
            query+=ans[j];
        }

        query+=buttons[0];
        query+=buttons[1];

        for(int j=0;j<ans.size();j++)
        {
            query+=ans[j];
        }

        query+=buttons[0];
        query+=buttons[2];

        for(int j=0;j<ans.size();j++)
        {
            query+=ans[j];
        }

        query+=buttons[1];

        //cout << query << endl;

        int res=press(query);

        if(res==i)
        {
            ans.push_back(buttons[2]);
        }

        if(res==i+1)
        {
            ans.push_back(buttons[1]);
        }

        if(res==i+2)
        {
            ans.push_back(buttons[0]);
        }
    }

    query="";

    for(int i=0;i<ans.size();i++)
    {
        query+=ans[i];
    }

    query+=buttons[0];

    if(N!=1)
    {


        if(press(query)==N)
        {
            ans.push_back(buttons[0]);
        }

        else
        {
            query="";

            for(int i=0;i<ans.size();i++)
            {
                query+=ans[i];
            }

            query+=buttons[1];

            if(press(query)==N)
            {
                ans.push_back(buttons[1]);
            }

            else
            {
                ans.push_back(buttons[2]);
            }
        }
    }

    std::string S="";

    for(int i=0;i<ans.size();i++)
    {
        S+=ans[i];
    }

    return S;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:75:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         for(int j=0;j<ans.size();j++)
      |                     ~^~~~~~~~~~~
combo.cpp:83:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for(int j=0;j<ans.size();j++)
      |                     ~^~~~~~~~~~~
combo.cpp:91:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for(int j=0;j<ans.size();j++)
      |                     ~^~~~~~~~~~~
combo.cpp:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         for(int j=0;j<ans.size();j++)
      |                     ~^~~~~~~~~~~
combo.cpp:128:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     for(int i=0;i<ans.size();i++)
      |                 ~^~~~~~~~~~~
combo.cpp:148:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |             for(int i=0;i<ans.size();i++)
      |                         ~^~~~~~~~~~~
combo.cpp:169:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  169 |     for(int i=0;i<ans.size();i++)
      |                 ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 64 ms 324 KB Output is correct
18 Correct 74 ms 328 KB Output is correct
19 Correct 73 ms 368 KB Output is correct
20 Correct 78 ms 436 KB Output is correct
21 Correct 60 ms 348 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 284 KB Output is correct
25 Correct 2 ms 284 KB Output is correct
26 Correct 2 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 3 ms 208 KB Output is correct
31 Correct 2 ms 208 KB Output is correct
32 Correct 71 ms 328 KB Output is correct
33 Correct 66 ms 440 KB Output is correct
34 Correct 73 ms 328 KB Output is correct
35 Correct 68 ms 496 KB Output is correct
36 Correct 69 ms 428 KB Output is correct
37 Correct 64 ms 324 KB Output is correct
38 Correct 70 ms 328 KB Output is correct
39 Correct 63 ms 324 KB Output is correct
40 Correct 64 ms 420 KB Output is correct
41 Correct 66 ms 424 KB Output is correct
42 Correct 69 ms 456 KB Output is correct
43 Correct 69 ms 512 KB Output is correct
44 Correct 67 ms 564 KB Output is correct
45 Correct 64 ms 452 KB Output is correct
46 Correct 68 ms 432 KB Output is correct
47 Correct 68 ms 460 KB Output is correct
48 Correct 71 ms 332 KB Output is correct
49 Correct 66 ms 328 KB Output is correct
50 Correct 65 ms 320 KB Output is correct
51 Correct 58 ms 400 KB Output is correct
52 Correct 67 ms 332 KB Output is correct
53 Correct 65 ms 328 KB Output is correct
54 Correct 67 ms 436 KB Output is correct
55 Correct 64 ms 392 KB Output is correct
56 Correct 63 ms 440 KB Output is correct
57 Correct 65 ms 408 KB Output is correct
58 Correct 57 ms 424 KB Output is correct
59 Correct 65 ms 328 KB Output is correct
60 Correct 62 ms 404 KB Output is correct
61 Correct 66 ms 460 KB Output is correct
62 Correct 64 ms 440 KB Output is correct
63 Correct 63 ms 388 KB Output is correct
64 Correct 64 ms 344 KB Output is correct
65 Correct 64 ms 324 KB Output is correct
66 Correct 57 ms 324 KB Output is correct
67 Correct 67 ms 416 KB Output is correct
68 Correct 62 ms 408 KB Output is correct
69 Correct 64 ms 324 KB Output is correct
70 Correct 67 ms 556 KB Output is correct
71 Correct 68 ms 336 KB Output is correct
72 Correct 63 ms 332 KB Output is correct
73 Correct 67 ms 452 KB Output is correct
74 Correct 65 ms 328 KB Output is correct
75 Correct 63 ms 424 KB Output is correct
76 Correct 66 ms 536 KB Output is correct
77 Correct 59 ms 360 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 0 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 1 ms 208 KB Output is correct
101 Correct 0 ms 208 KB Output is correct
102 Correct 1 ms 208 KB Output is correct
103 Correct 1 ms 208 KB Output is correct
104 Correct 1 ms 208 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 0 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 0 ms 208 KB Output is correct
109 Correct 1 ms 208 KB Output is correct
110 Correct 0 ms 208 KB Output is correct
111 Correct 0 ms 208 KB Output is correct
112 Correct 1 ms 208 KB Output is correct
113 Correct 1 ms 208 KB Output is correct
114 Correct 1 ms 208 KB Output is correct
115 Correct 0 ms 208 KB Output is correct
116 Correct 0 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 1 ms 208 KB Output is correct
119 Correct 1 ms 208 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 208 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct