oj.uz

Submission #857009

# Submission time Handle Problem Language Result Execution time Memory
857009 2023-10-05T08:02:14 Z chrispham258 Combo (IOI18_combo) C++17
100 / 100
 14 ms 1984 KB 
/* Pham Ngoc Tho aka Chis Pham                           */
/* [Author : Pham Ngoc Tho] - THPT Chuyen Nguyen Du      */
/* [ 2024 - 12TH GO VOI 24 ] - From Nguyen Du with love  */

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include<bits/stdc++.h>
#include<combo.h>
using namespace std;

#define oo 0x3f
#define ff first
#define ss second
#define endl "\n"
#define ins insert
#define chis id<<1
#define pham (id<<1) + 1
#define sqr(x) ((x) * 1ll * (x))
#define gcd(a, b) __gcd(a, b)
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(),x.rend()
#define repu(i, x, n) for(int i = x; i <= n; ++i)
#define repd(i, n, x) for(int i = n; i >= x; --i)
#define reset(x, val) memset(x, val, sizeof(x))

typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;

template<class T> bool getbit(T val, int i) { return (val >> i) & 1; }
template<class T> int cntbit(T val)        { return val == 0 ? 0 : cntbit(val >> 1) + (val & 1); }
template<class T> ll fpow(T a, const T b) { ll res = 1, x = a, y = b; while(y){if(y & 1)res *= x; x = x * x; y>>=1;}; return res; }
template<class T> ll modfpow(T a, T b, const T &m) { ll res = 1, x = a, y = b; x %= m; while(y){if(y & 1){res *= x; res %= m;}; x = x * x; x %= m; y >>= 1; } return res % m; }
template<class T> T lcm(T &a, T &b) { return a / gcd(a, b) * b; }
 
const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;

inline char gc() { static char buf[1 << 23]; static size_t bc, be; if(bc >= be){ buf[0] = 0, bc = 0; be = fread(buf, 1, sizeof(buf), stdin); } return buf[bc++]; }
ll readLL() { ll a, c; while ((a = gc()) < 20); if (a == '-') return -readLL(); while ((c = gc()) >= 48) a = a * 10 + c - 480; return a - 48; }
int readInt() { int a, c; while ((a = gc()) < 10); if (a == '-') return -readInt(); while ((c = gc()) >= 48) a = a * 10 + c - 480; return a - 48; }

mt19937 RND(time(nullptr));
ll rnd(ll l, ll r)
{
  assert(l <= r);ll L = l, R = r;
  ll aft = (L + RND() * 1LL % (R - L + 1));
  return aft;
}

#define TASK "name"
#define FILE "DEBUG"
void setIO()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);
}

template<class T> T multi(const T &a, const T &b) { T res = (a*b)%mod; return res;}
template<class T> bool umax(T &a, T b) { if(a < b){ a = b; return 1;} else return 0;}
template<class T> bool umin(T &a, T b) { if(a > b){ a = b; return 1;} else return 0;}

const int NmX = 1e5 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

// int press(string s){
//   cout<<s<<endl;
//   int val;cin>>val;return val;
// }
string guess_sequence(int N){
  string c[] = {"A", "B", "X", "Y"};
  string ans = "", temp = "";

  if(press("AB")){
    if(press("A")) ans += 'A';
    else ans += 'B';
  }else if(press("X")) ans += 'X';
  else ans += 'Y';  

  repu(i, 0, 3) if(ans != c[i]) temp += c[i];
  // cout <<temp<<endl;
  repu(i, 1, N - 2){
    string s = ans + temp[0] + temp[0] + ans + temp[0] + temp[1] + ans + temp[0] + temp[2] + ans + temp[1];
    int len = press(s);
    if(len == i + 2) ans += temp[0];
    else if(len == i + 1) ans += temp[1];
    else ans += temp[2];
  }

  if(N >= 2){
    if(press(ans + temp[0]) == N){
      ans += temp[0];
    }else if(press(ans + temp[1]) ==N){
      ans += temp[1];
    }else ans += temp[2];
  }
  return ans;
}

// main(){
//   cout<< guess_sequence(5);
//   return 0;
// }

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 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 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 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 596 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 0 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 340 KB Output is correct
33 Correct 1 ms 596 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 0 ms 340 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 10 ms 1720 KB Output is correct
18 Correct 11 ms 1676 KB Output is correct
19 Correct 10 ms 1744 KB Output is correct
20 Correct 10 ms 1168 KB Output is correct
21 Correct 10 ms 1500 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 448 KB Output is correct
24 Correct 0 ms 452 KB Output is correct
25 Correct 0 ms 456 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 456 KB Output is correct
29 Correct 1 ms 452 KB Output is correct
30 Correct 1 ms 704 KB Output is correct
31 Correct 1 ms 708 KB Output is correct
32 Correct 11 ms 1364 KB Output is correct
33 Correct 11 ms 1292 KB Output is correct
34 Correct 10 ms 1252 KB Output is correct
35 Correct 10 ms 1360 KB Output is correct
36 Correct 10 ms 1480 KB Output is correct
37 Correct 10 ms 1516 KB Output is correct
38 Correct 10 ms 1284 KB Output is correct
39 Correct 10 ms 1484 KB Output is correct
40 Correct 11 ms 1416 KB Output is correct
41 Correct 11 ms 1336 KB Output is correct
42 Correct 10 ms 1632 KB Output is correct
43 Correct 10 ms 1720 KB Output is correct
44 Correct 12 ms 1660 KB Output is correct
45 Correct 10 ms 1732 KB Output is correct
46 Correct 10 ms 1380 KB Output is correct
47 Correct 10 ms 1700 KB Output is correct
48 Correct 11 ms 1692 KB Output is correct
49 Correct 10 ms 1684 KB Output is correct
50 Correct 10 ms 1004 KB Output is correct
51 Correct 11 ms 1740 KB Output is correct
52 Correct 11 ms 1924 KB Output is correct
53 Correct 10 ms 1424 KB Output is correct
54 Correct 11 ms 1676 KB Output is correct
55 Correct 10 ms 1396 KB Output is correct
56 Correct 11 ms 1664 KB Output is correct
57 Correct 10 ms 1724 KB Output is correct
58 Correct 10 ms 1496 KB Output is correct
59 Correct 10 ms 1376 KB Output is correct
60 Correct 10 ms 1472 KB Output is correct
61 Correct 10 ms 1360 KB Output is correct
62 Correct 10 ms 1216 KB Output is correct
63 Correct 9 ms 1528 KB Output is correct
64 Correct 10 ms 1716 KB Output is correct
65 Correct 10 ms 1556 KB Output is correct
66 Correct 10 ms 1268 KB Output is correct
67 Correct 11 ms 1792 KB Output is correct
68 Correct 10 ms 1984 KB Output is correct
69 Correct 11 ms 1488 KB Output is correct
70 Correct 11 ms 1508 KB Output is correct
71 Correct 11 ms 1772 KB Output is correct
72 Correct 10 ms 1404 KB Output is correct
73 Correct 10 ms 1396 KB Output is correct
74 Correct 10 ms 1264 KB Output is correct
75 Correct 9 ms 1588 KB Output is correct
76 Correct 10 ms 992 KB Output is correct
77 Correct 14 ms 1596 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 444 KB Output is correct
85 Correct 0 ms 448 KB Output is correct
86 Correct 0 ms 448 KB Output is correct
87 Correct 1 ms 448 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 408 KB Output is correct
94 Correct 0 ms 448 KB Output is correct
95 Correct 0 ms 444 KB Output is correct
96 Correct 0 ms 448 KB Output is correct
97 Correct 0 ms 448 KB Output is correct
98 Correct 1 ms 448 KB Output is correct
99 Correct 0 ms 444 KB Output is correct
100 Correct 0 ms 444 KB Output is correct
101 Correct 0 ms 700 KB Output is correct
102 Correct 0 ms 696 KB Output is correct
103 Correct 0 ms 444 KB Output is correct
104 Correct 1 ms 420 KB Output is correct
105 Correct 1 ms 444 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 0 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 1 ms 344 KB Output is correct
114 Correct 1 ms 344 KB Output is correct
115 Correct 1 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 448 KB Output is correct
119 Correct 0 ms 444 KB Output is correct
120 Correct 1 ms 452 KB Output is correct
121 Correct 0 ms 448 KB Output is correct
122 Correct 0 ms 444 KB Output is correct
123 Correct 0 ms 452 KB Output is correct