Submission #290038

#	Time	Username	Problem	Language	Result	Execution time	Memory
290038		Tangent	Combo (IOI18_combo)	C++17	0 / 100	1 ms	200 KiB

combo

#include <bits/stdc++.h>
#include "combo.h"

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// find_by_order(), order_of_key()

typedef long long ll;
typedef long double dd;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<dd, dd> pdd;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<dd> vdd;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vdd> vvdd;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef vector<vpdd> vvpdd;
typedef vector<bool> vb;

const int inf = 1 << 30;

#define rep(i, n) for (ll i = 0; i < n; i++)
#define ffor(i, a, b) for(ll i = a; i < b; i++)
#define forin(x, a) for (auto &x: a)
#define all(x) x.begin(), x.end()

#ifdef TEST
#define dbg(x) cout << #x << ": " << x << '\n';
#define dbgc(x) cout << #x << ":"; forin(a, x) { cout << " " << a; } cout << endl;
#define tassert(x) assert(x);
#else
#define dbg(x)
#define dbgc(x)
#define tassert(x)
#endif


std::string guess_sequence(int N) {
  char first;
  string rem;
  if (press("AB") > 0) {
	  if (press("A") > 0) {
	  	first = 'A';
	  	rem = "BXY";
	  } else {
	  	first = 'B';
	  	rem = "AXY";
	  }
  } else {
	  if (press("X") > 0) {
	  	first = 'X';
	  	rem = "ABY";
	  } else {
	  	first = 'Y';
	  	rem = "ABX";
	  }
  }
  string res;
  res += first;
  while (res.size() < N) {
  	if (res.size() == N - 1) {
  		if (press(res + rem.at(0)) == N) {
  			res += rem.at(0);
  		} else if (press(res + rem.at(1)) == N) {
  			res += rem.at(1);
  		} else {
  			res += rem.at(2);
  		}
  	} else {
  		int l = press(res + rem.at(0) + res + rem.at(1) + rem.at(0) + res + rem.at(1) + rem.at(1) + res + rem.at(1) + rem.at(2));
  		if (l == res.size()) {
  			res += rem.at(2);
  		} else if (l == res.size() + 1) {
  			res += rem.at(0);
  		} else {
  			res += rem.at(1);
  		}
  	}
  	cout << res << '\n';
  }
  return res;
}

Compilation message (stderr)

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:71:21: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |   while (res.size() < N) {
      |          ~~~~~~~~~~~^~~
combo.cpp:72:19: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |    if (res.size() == N - 1) {
      |        ~~~~~~~~~~~^~~~~~~~
combo.cpp:82:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     if (l == res.size()) {
      |         ~~^~~~~~~~~~~~~
combo.cpp:84:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     } else if (l == res.size() + 1) {
      |                ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95