oj.uz

Submission #964330

# Submission time Handle Problem Language Result Execution time Memory
964330 2024-04-16T16:17:30 Z IUA_Hasin Combo (IOI18_combo) C++17
100 / 100
 16 ms 2080 KB 
#include "combo.h"

#include <bits/stdc++.h>
 
#define endl                                "\n"
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define ll                                  long long
 
using namespace std; 

// std::string guess_sequence(int N) {
//   std::string p = "";
//   for (int i = 0; i < 4 * N; ++i) {
//     p += 'A';
//   }
//   int coins = press(p);
//   std::string S = "";
//   for (int i = 0; i < N; ++i) {
//     S += 'A';
//   }
//   return S;
// }


std::string guess_sequence(int N) {
  std::string S = "";
  ll first_char;

  std::string p1 = "AB";
  std::string p2 = "A";
  std::string p3 = "X";
  ll a = press(p1);



  if(a>=1){
    ll b = press(p2);
    if(b==1){
      S += "A";
      first_char = 1;
    } else {
      S += "B";
      first_char = 2;
    }
  } else {
    ll b = press(p3);
    if(b==1){
      S += "X";
      first_char = 3;
    } else {
      S += "Y";
      first_char = 4;
    }
  }

  // cout<<first_char<<endl;;

  ll cnt = 1;

  for(int i=3; i<=N; i++){
    std::string temp_string = "";
    std::string temp_string1 = "";
    std::string temp_string2 = "";
    std::string temp_string3 = "";


    if(first_char==1){
      temp_string1 += S;
      temp_string1 += "BB";
      temp_string2 += S;
      temp_string2 += "BX";
      temp_string3 += S;
      temp_string3 += "BY";
      temp_string += S;
      temp_string += "X";
      temp_string += temp_string1+temp_string2+temp_string3;

      ll aa = press(temp_string);

      if(aa==cnt+2){
        S += "B";
        cnt++;
      } else if(aa==cnt+1){
        S += "X";
        cnt++;
      } else {
        S += "Y";
        cnt++;
      }

    } else if(first_char==2){
      temp_string1 += S;
      temp_string1 += "AA";
      temp_string2 += S;
      temp_string2 += "AX";
      temp_string3 += S;
      temp_string3 += "AY";
      temp_string += S;
      temp_string += "X";
      temp_string += temp_string1+temp_string2+temp_string3;

      ll aa = press(temp_string);

      if(aa==cnt+2){
        S += "A";
        cnt++;
      } else if(aa==cnt+1){
        S += "X";
        cnt++;
      } else {
        S += "Y";
        cnt++;
      }


    } else if(first_char==3){
      temp_string1 += S;
      temp_string1 += "AA";
      temp_string2 += S;
      temp_string2 += "AB";
      temp_string3 += S;
      temp_string3 += "AY";
      temp_string += S;
      temp_string += "Y";
      temp_string += temp_string1+temp_string2+temp_string3;

      ll aa = press(temp_string);

      if(aa==cnt+2){
        S += "A";
        cnt++;
      } else if(aa==cnt+1){
        S += "Y";
        cnt++;
      } else {
        S += "B";
        cnt++;
      }


    } else if(first_char==4){
      temp_string1 += S;
      temp_string1 += "AA";
      temp_string2 += S;
      temp_string2 += "AB";
      temp_string3 += S;
      temp_string3 += "AX";
      temp_string += S;
      temp_string += "X";
      temp_string += temp_string1+temp_string2+temp_string3;

      ll aa = press(temp_string);

      if(aa==cnt+2){
        S += "A";
        cnt++;
      } else if(aa==cnt+1){
        S += "X";
        cnt++;
      } else {
        S += "B";
        cnt++;
      }


    }
    // cout<<temp_string<<endl;
  }

  std::string last2 = "";
  std::string last1 = "";

  if(N==1){
    return S;
  } else {
    if(first_char==1){
      last2 += S;
      last2 += "B";
      last1 += last2;
      last1 += S;
      last1 += "Y";
      last2 += S;
      last2 += "X";

      ll aa = press(last2);
      ll bb = press(last1);

      if(aa==cnt){
        S += "Y";
      } else {
        if(bb==cnt){
          S += "X";
        } else {
          S += "B";
        }
      }


    } else if(first_char==2){
      last2 += S;
      last2 += "A";
      last1 += last2;
      last1 += S;
      last1 += "Y";
      last2 += S;
      last2 += "X";

      ll aa = press(last2);
      ll bb = press(last1);

      if(aa==cnt){
        S += "Y";
      } else {
        if(bb==cnt){
          S += "X";
        } else {
          S += "A";
        }
      }


    } else if(first_char==3){
      last2 += S;
      last2 += "A";
      last1 += last2;
      last1 += S;
      last1 += "Y";
      last2 += S;
      last2 += "B";

      ll aa = press(last2);
      ll bb = press(last1);

      if(aa==cnt){
        S += "Y";
      } else {
        if(bb==cnt){
          S += "B";
        } else {
          S += "A";
        }
      }

    } else if(first_char==4){
      last2 += S;
      last2 += "A";
      last1 += last2;
      last1 += S;
      last1 += "B";
      last2 += S;
      last2 += "X";

      ll aa = press(last2);
      ll bb = press(last1);

      if(aa==cnt){
        S += "B";
      } else {
        if(bb==cnt){
          S += "X";
        } else {
          S += "A";
        }
      }

    }

    // cout<<S<<endl;
    return S;
  }



}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 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 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 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 0 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 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 544 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 340 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 0 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 340 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 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 1516 KB Output is correct
18 Correct 11 ms 1068 KB Output is correct
19 Correct 13 ms 1588 KB Output is correct
20 Correct 13 ms 1764 KB Output is correct
21 Correct 11 ms 1356 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 432 KB Output is correct
24 Correct 0 ms 436 KB Output is correct
25 Correct 1 ms 436 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 436 KB Output is correct
28 Correct 1 ms 440 KB Output is correct
29 Correct 1 ms 692 KB Output is correct
30 Correct 1 ms 436 KB Output is correct
31 Correct 1 ms 700 KB Output is correct
32 Correct 13 ms 1508 KB Output is correct
33 Correct 12 ms 1336 KB Output is correct
34 Correct 11 ms 1448 KB Output is correct
35 Correct 12 ms 1880 KB Output is correct
36 Correct 12 ms 1264 KB Output is correct
37 Correct 14 ms 1544 KB Output is correct
38 Correct 13 ms 1352 KB Output is correct
39 Correct 13 ms 1520 KB Output is correct
40 Correct 14 ms 1132 KB Output is correct
41 Correct 13 ms 1876 KB Output is correct
42 Correct 11 ms 1596 KB Output is correct
43 Correct 12 ms 1816 KB Output is correct
44 Correct 12 ms 1372 KB Output is correct
45 Correct 12 ms 1084 KB Output is correct
46 Correct 11 ms 1096 KB Output is correct
47 Correct 11 ms 1632 KB Output is correct
48 Correct 12 ms 1444 KB Output is correct
49 Correct 11 ms 1692 KB Output is correct
50 Correct 12 ms 1400 KB Output is correct
51 Correct 13 ms 1652 KB Output is correct
52 Correct 12 ms 1388 KB Output is correct
53 Correct 12 ms 1500 KB Output is correct
54 Correct 11 ms 1792 KB Output is correct
55 Correct 16 ms 1616 KB Output is correct
56 Correct 13 ms 1980 KB Output is correct
57 Correct 12 ms 1616 KB Output is correct
58 Correct 12 ms 1984 KB Output is correct
59 Correct 12 ms 1652 KB Output is correct
60 Correct 11 ms 1012 KB Output is correct
61 Correct 14 ms 1844 KB Output is correct
62 Correct 12 ms 1336 KB Output is correct
63 Correct 12 ms 1564 KB Output is correct
64 Correct 15 ms 1364 KB Output is correct
65 Correct 13 ms 1312 KB Output is correct
66 Correct 12 ms 1612 KB Output is correct
67 Correct 15 ms 1548 KB Output is correct
68 Correct 13 ms 1848 KB Output is correct
69 Correct 13 ms 1616 KB Output is correct
70 Correct 12 ms 1468 KB Output is correct
71 Correct 13 ms 1744 KB Output is correct
72 Correct 11 ms 1832 KB Output is correct
73 Correct 14 ms 1752 KB Output is correct
74 Correct 11 ms 1800 KB Output is correct
75 Correct 14 ms 1948 KB Output is correct
76 Correct 13 ms 1644 KB Output is correct
77 Correct 13 ms 2080 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 0 ms 588 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 1 ms 440 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 436 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 1 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 1 ms 344 KB Output is correct
94 Correct 1 ms 592 KB Output is correct
95 Correct 1 ms 440 KB Output is correct
96 Correct 0 ms 436 KB Output is correct
97 Correct 0 ms 436 KB Output is correct
98 Correct 1 ms 436 KB Output is correct
99 Correct 1 ms 440 KB Output is correct
100 Correct 1 ms 432 KB Output is correct
101 Correct 0 ms 432 KB Output is correct
102 Correct 0 ms 440 KB Output is correct
103 Correct 1 ms 432 KB Output is correct
104 Correct 0 ms 436 KB Output is correct
105 Correct 1 ms 588 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 0 ms 344 KB Output is correct
108 Correct 1 ms 340 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 1 ms 428 KB Output is correct
119 Correct 1 ms 440 KB Output is correct
120 Correct 1 ms 432 KB Output is correct
121 Correct 1 ms 600 KB Output is correct
122 Correct 1 ms 436 KB Output is correct
123 Correct 1 ms 432 KB Output is correct