oj.uz

Submission #925939

# Submission time Handle Problem Language Result Execution time Memory
925939 2024-02-12T11:12:19 Z HuyQuang_re_Zero Combo (IOI18_combo) C++14
100 / 100
 13 ms 2044 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
//#define N 505
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define IDB pair <db,int>
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x)
using namespace std;
#include "combo.h"
//#define press(s) IR.cal(s)
struct Interactive
{
    int n;
    string s;
    void Init(int _n)
    {
        n=_n;
        cin>>s;
    }
    int cal(string a)
    {
        for(int i=n;i>=1;i--)
            if(a.find(s.substr(0,i))!=a.npos)
                return i;
        return 0;
    }
} IR;
string guess_sequence(int n)
{
    if(n==1)
    {
        if(press("A")) return "A";
        if(press("B")) return "B";
        if(press("X")) return "X";
        return "Y";
    }
    string s;
    int k=press("BXBY");
    if(k==0) s="A";
    else if(k==1)
    {
        k=press("BAX");
        if(k==0) s="Y";
        else if(k==1) s="X";
        else s="B";
    }
    else s=(press("B") ? "B" : "X");

    string t;
    if(s=="A") t="BXY";
    else if(s=="B") t="XYA";
    else if(s=="X") t="YAB";
    else t="ABX";
    for(int i=2;i<n;i++)
    {
        string now="";
        now+=s; now+=t[0];
        now+=s; now+=t[1]; now+=t[0];
        now+=s; now+=t[1]; now+=t[1];
        now+=s; now+=t[1]; now+=t[2];
        k=press(now);
        if(k==s.size()) s+=t[2];
        else if(k==s.size()+2) s+=t[1];
        else s+=t[0];
    }
    if(press(s+t[0])==n) s+=t[0];
    else if(press(s+t[1])==n) s+=t[1];
    else s+=t[2];
    return s;
}

/*
int main()
{
    freopen("combo.inp","r",stdin);
    freopen("combo.out","w",stdout);
    int n;
    cin>>n;
    IR.Init(n);
    cout<<guess_sequense(n);
}
*/

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:72:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         if(k==s.size()) s+=t[2];
      |            ~^~~~~~~~~~
combo.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         else if(k==s.size()+2) s+=t[1];
      |                 ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 11 ms 1492 KB Output is correct
18 Correct 12 ms 1376 KB Output is correct
19 Correct 13 ms 1148 KB Output is correct
20 Correct 12 ms 1332 KB Output is correct
21 Correct 11 ms 1388 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 436 KB Output is correct
24 Correct 1 ms 436 KB Output is correct
25 Correct 1 ms 444 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 1 ms 704 KB Output is correct
29 Correct 1 ms 440 KB Output is correct
30 Correct 1 ms 436 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 11 ms 1516 KB Output is correct
33 Correct 9 ms 1400 KB Output is correct
34 Correct 10 ms 944 KB Output is correct
35 Correct 11 ms 1704 KB Output is correct
36 Correct 10 ms 1552 KB Output is correct
37 Correct 13 ms 1204 KB Output is correct
38 Correct 10 ms 1520 KB Output is correct
39 Correct 11 ms 1716 KB Output is correct
40 Correct 10 ms 1312 KB Output is correct
41 Correct 10 ms 1152 KB Output is correct
42 Correct 10 ms 1480 KB Output is correct
43 Correct 11 ms 1536 KB Output is correct
44 Correct 10 ms 1484 KB Output is correct
45 Correct 10 ms 1328 KB Output is correct
46 Correct 10 ms 1740 KB Output is correct
47 Correct 13 ms 1288 KB Output is correct
48 Correct 10 ms 2044 KB Output is correct
49 Correct 11 ms 1112 KB Output is correct
50 Correct 10 ms 1748 KB Output is correct
51 Correct 10 ms 1000 KB Output is correct
52 Correct 10 ms 900 KB Output is correct
53 Correct 10 ms 1284 KB Output is correct
54 Correct 11 ms 1512 KB Output is correct
55 Correct 10 ms 1236 KB Output is correct
56 Correct 11 ms 1392 KB Output is correct
57 Correct 10 ms 1240 KB Output is correct
58 Correct 10 ms 1468 KB Output is correct
59 Correct 12 ms 1480 KB Output is correct
60 Correct 10 ms 1076 KB Output is correct
61 Correct 10 ms 1616 KB Output is correct
62 Correct 10 ms 1228 KB Output is correct
63 Correct 10 ms 1396 KB Output is correct
64 Correct 11 ms 1464 KB Output is correct
65 Correct 11 ms 1724 KB Output is correct
66 Correct 11 ms 952 KB Output is correct
67 Correct 10 ms 896 KB Output is correct
68 Correct 11 ms 960 KB Output is correct
69 Correct 10 ms 1108 KB Output is correct
70 Correct 12 ms 1300 KB Output is correct
71 Correct 10 ms 1460 KB Output is correct
72 Correct 10 ms 1216 KB Output is correct
73 Correct 9 ms 1148 KB Output is correct
74 Correct 11 ms 1324 KB Output is correct
75 Correct 10 ms 1260 KB Output is correct
76 Correct 11 ms 1240 KB Output is correct
77 Correct 11 ms 1172 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 436 KB Output is correct
86 Correct 0 ms 432 KB Output is correct
87 Correct 1 ms 432 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 1 ms 440 KB Output is correct
96 Correct 1 ms 436 KB Output is correct
97 Correct 0 ms 440 KB Output is correct
98 Correct 1 ms 596 KB Output is correct
99 Correct 0 ms 436 KB Output is correct
100 Correct 0 ms 432 KB Output is correct
101 Correct 1 ms 436 KB Output is correct
102 Correct 1 ms 436 KB Output is correct
103 Correct 1 ms 436 KB Output is correct
104 Correct 0 ms 440 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 0 ms 432 KB Output is correct
120 Correct 0 ms 428 KB Output is correct
121 Correct 0 ms 436 KB Output is correct
122 Correct 1 ms 688 KB Output is correct
123 Correct 1 ms 436 KB Output is correct