oj.uz

Submission #919586

# Submission time Handle Problem Language Result Execution time Memory
919586 2024-02-01T07:50:46 Z Khanhcsp2 Combo (IOI18_combo) C++14
100 / 100
 12 ms 2068 KB 
#include "combo.h"
#include <bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
//#define int long long
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
//const int N=1e5+11;
//namespace {
//
//constexpr int MAX_N = 2000;
//constexpr int MAX_NUM_MOVES = 8000;
//
//int N;
//std::string S;
//
//int num_moves;
//
//void wrong_answer(const char *MSG) {
//  printf("Wrong Answer: %s\n", MSG);
//  exit(0);
//}
//
//}  // namespace
//
//int press(std::string p) {
//  if (++num_moves > MAX_NUM_MOVES) {
//    wrong_answer("too many moves");
//  }
//  int len = p.length();
//  if (len > 4 * N) {
//    wrong_answer("invalid press");
//  }
//  for (int i = 0; i < len; ++i) {
//    if (p[i] != 'A' && p[i] != 'B' && p[i] != 'X' && p[i] != 'Y') {
//      wrong_answer("invalid press");
//    }
//  }
//  int coins = 0;
//  for (int i = 0, j = 0; i < len; ++i) {
//    if (j < N && S[j] == p[i]) {
//      ++j;
//    } else if (S[0] == p[i]) {
//      j = 1;
//    } else {
//      j = 0;
//    }
//    coins = std::max(coins, j);
//  }
//  return coins;
//}
string guess_sequence(int n)
{
    string s="ABXY", ans="";
    int ch, pos;
    ch=press("AB");
    if(ch)
    {
        int v=press("A");
        if(v) pos=0;
        else pos=1;
    }
    else
    {
        int v=press("X");
        if(v) pos=2;
        else pos=3;
    }
    ans+=s[pos];
    if(n==1) return ans;
    swap(s[pos], s[3]);
    for(int i=1;i<n-1;i++)
    {
        string tmp=ans+s[0]+s[0]+ans+s[0]+s[1]+ans+s[0]+s[2]+ans+s[1];
//        cout << tmp << el;
        int l=press(tmp);
//        cout << l << el;
        if(l==i+2) ans+=s[0];
        else if(l==i+1) ans+=s[1];
        else ans+=s[2];
    }
//    cout << ans << el;
    if(press(ans+s[0])==n) return ans+s[0];
    else if(press(ans+s[1])==n) return ans+s[1];
    else return ans+s[2];
}
//int main() {
//  cin >> S;
//  N = S.length();
//
//  num_moves = 0;
//  std::string answer = guess_sequence(N);
//  if (answer != S) {
//    wrong_answer("wrong guess");
//    exit(0);
//  }
//  printf("Accepted: %d\n", num_moves);
//  return 0;
//}

Subtask #1
5.0 / 5.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 0 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 1 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 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 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 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 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 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 1 ms 500 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 1 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 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 0 ms 344 KB Output is correct
17 Correct 11 ms 1712 KB Output is correct
18 Correct 11 ms 1548 KB Output is correct
19 Correct 12 ms 1632 KB Output is correct
20 Correct 10 ms 1228 KB Output is correct
21 Correct 11 ms 1400 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 436 KB Output is correct
24 Correct 1 ms 428 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 448 KB Output is correct
28 Correct 1 ms 444 KB Output is correct
29 Correct 1 ms 696 KB Output is correct
30 Correct 1 ms 440 KB Output is correct
31 Correct 2 ms 440 KB Output is correct
32 Correct 10 ms 1684 KB Output is correct
33 Correct 11 ms 1572 KB Output is correct
34 Correct 10 ms 1440 KB Output is correct
35 Correct 11 ms 1180 KB Output is correct
36 Correct 10 ms 1460 KB Output is correct
37 Correct 10 ms 1060 KB Output is correct
38 Correct 10 ms 1748 KB Output is correct
39 Correct 10 ms 840 KB Output is correct
40 Correct 10 ms 1672 KB Output is correct
41 Correct 10 ms 964 KB Output is correct
42 Correct 10 ms 1480 KB Output is correct
43 Correct 10 ms 1304 KB Output is correct
44 Correct 9 ms 876 KB Output is correct
45 Correct 10 ms 1076 KB Output is correct
46 Correct 10 ms 1184 KB Output is correct
47 Correct 11 ms 1208 KB Output is correct
48 Correct 11 ms 1644 KB Output is correct
49 Correct 10 ms 1384 KB Output is correct
50 Correct 10 ms 1452 KB Output is correct
51 Correct 11 ms 1768 KB Output is correct
52 Correct 11 ms 1276 KB Output is correct
53 Correct 10 ms 1568 KB Output is correct
54 Correct 10 ms 1008 KB Output is correct
55 Correct 10 ms 1276 KB Output is correct
56 Correct 11 ms 1304 KB Output is correct
57 Correct 11 ms 1364 KB Output is correct
58 Correct 10 ms 2068 KB Output is correct
59 Correct 10 ms 1268 KB Output is correct
60 Correct 10 ms 972 KB Output is correct
61 Correct 11 ms 1220 KB Output is correct
62 Correct 12 ms 1228 KB Output is correct
63 Correct 11 ms 1328 KB Output is correct
64 Correct 10 ms 1484 KB Output is correct
65 Correct 11 ms 1312 KB Output is correct
66 Correct 10 ms 1184 KB Output is correct
67 Correct 11 ms 1700 KB Output is correct
68 Correct 10 ms 1640 KB Output is correct
69 Correct 10 ms 1676 KB Output is correct
70 Correct 10 ms 1336 KB Output is correct
71 Correct 10 ms 1228 KB Output is correct
72 Correct 10 ms 1120 KB Output is correct
73 Correct 10 ms 1192 KB Output is correct
74 Correct 10 ms 1204 KB Output is correct
75 Correct 10 ms 1216 KB Output is correct
76 Correct 11 ms 1444 KB Output is correct
77 Correct 12 ms 1568 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 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 1 ms 688 KB Output is correct
85 Correct 1 ms 436 KB Output is correct
86 Correct 1 ms 432 KB Output is correct
87 Correct 1 ms 440 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 0 ms 436 KB Output is correct
95 Correct 1 ms 436 KB Output is correct
96 Correct 0 ms 432 KB Output is correct
97 Correct 0 ms 440 KB Output is correct
98 Correct 0 ms 436 KB Output is correct
99 Correct 1 ms 432 KB Output is correct
100 Correct 1 ms 440 KB Output is correct
101 Correct 0 ms 440 KB Output is correct
102 Correct 0 ms 436 KB Output is correct
103 Correct 1 ms 432 KB Output is correct
104 Correct 1 ms 440 KB Output is correct
105 Correct 0 ms 440 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 512 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 1 ms 544 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 440 KB Output is correct
119 Correct 0 ms 436 KB Output is correct
120 Correct 0 ms 432 KB Output is correct
121 Correct 1 ms 436 KB Output is correct
122 Correct 0 ms 440 KB Output is correct
123 Correct 1 ms 432 KB Output is correct