oj.uz

Submission #80316

# Submission time Handle Problem Language Result Execution time Memory
80316 2018-10-20T04:26:54 Z qkxwsm Combo (IOI18_combo) C++14
97 / 100
 57 ms 624 KB 
#include "combo.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
    unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM; x += 11400714819323198485ull;
        x = (x ^ (x >> 30)) * 13787848793156543929ull;
        x = (x ^ (x >> 27)) * 10723151780598845931ull;
        return x ^ (x >> 31);
    }
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
T nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
#define sz(x) ((int) (x.size()))

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll

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

char ch[3];

string guess_sequence(int N)
{
	string ans = "";
	int lol1 = press("A"), lol2 = press("B"), lol3 = press("X");
	if (lol1 == 1)
	{
		ch[0] = 'B'; ch[1] = 'X'; ch[2] = 'Y';
		ans += 'A';
	}
	else if (lol2 == 1)
	{
		ch[0] = 'A'; ch[1] = 'X'; ch[2] = 'Y';
		ans += 'B';
	}
	else if (lol3 == 1)
	{
		ch[0] = 'A'; ch[1] = 'B'; ch[2] = 'Y';
		ans += 'X';
	}
	else
	{
		ch[0] = 'A'; ch[1] = 'B'; ch[2] = 'X';
		ans += 'Y';
	}
	while(ans.length() < N - 1)
	{
		string t = ans + ch[0] + ch[0] + ans + ch[0] + ch[1] + ans + ch[1] + ch[0];
		int x = press(t);
		if (x == ans.length() + 0)
		{
			ans += ch[2];
			continue;
		}
		else if (x == ans.length() + 1)
		{
			t = ans + ch[1] + ch[2];
			x = press(t);
			//ac, bb, bc
			if (x == ans.length() + 0)
			{
				ans += ch[0]; ans += ch[2];
			}
			else if (x == ans.length() + 1)
			{
				ans += ch[1]; ans += ch[1];
			}
			else if (x == ans.length() + 2)
			{
				ans += ch[1]; ans += ch[2];
			}
		}
		else if (x == ans.length() + 2)
		{
			//aa, ab, ba
			t = ans + ch[0] + ch[0];
			x = press(t);
			if (x == ans.length() + 0)
			{
				ans += ch[1]; ans += ch[0];
			}
			else if (x == ans.length() + 1)
			{
				ans += ch[0]; ans += ch[1];
			}
			else if (x == ans.length() + 2)
			{
				ans += ch[0]; ans += ch[0];
			}
		}
	}
	if (ans.length() == N - 1)
	{
		string t = ans + ch[0];
		lol1 = press(t);
		t = ans + ch[1];
		lol2 = press(t);
		if (lol1 == ans.length() + 1) ans += ch[0];
		else if (lol2 == ans.length() + 1) ans += ch[1];
		else ans += ch[2];
	}
	return ans;
}

Compilation message

combo.cpp:11:14: warning: unnecessary parentheses in declaration of 'rd' [-Wparentheses]
   11 | random_device(rd);
      |              ^
combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:116:21: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  116 |  while(ans.length() < N - 1)
      |        ~~~~~~~~~~~~~^~~~~~~
combo.cpp:120:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |   if (x == ans.length() + 0)
      |       ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:125:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |   else if (x == ans.length() + 1)
      |            ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:130:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |    if (x == ans.length() + 0)
      |        ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:134:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |    else if (x == ans.length() + 1)
      |             ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:138:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |    else if (x == ans.length() + 2)
      |             ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:143:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |   else if (x == ans.length() + 2)
      |            ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:148:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |    if (x == ans.length() + 0)
      |        ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:152:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |    else if (x == ans.length() + 1)
      |             ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:156:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  156 |    else if (x == ans.length() + 2)
      |             ~~^~~~~~~~~~~~~~~~~~~
combo.cpp:162:19: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  162 |  if (ans.length() == N - 1)
      |      ~~~~~~~~~~~~~^~~~~~~~
combo.cpp:168:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |   if (lol1 == ans.length() + 1) ans += ch[0];
      |       ~~~~~^~~~~~~~~~~~~~~~~~~
combo.cpp:169:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  169 |   else if (lol2 == ans.length() + 1) ans += ch[1];
      |            ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
92.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Partially correct 1 ms 200 KB Output is partially correct
6 Partially correct 1 ms 200 KB Output is partially correct
7 Partially correct 1 ms 200 KB Output is partially correct
8 Partially correct 1 ms 256 KB Output is partially correct
9 Partially correct 1 ms 200 KB Output is partially correct
10 Partially correct 1 ms 200 KB Output is partially correct
11 Partially correct 1 ms 200 KB Output is partially correct
12 Partially correct 1 ms 200 KB Output is partially correct
13 Partially correct 1 ms 292 KB Output is partially correct
14 Partially correct 1 ms 200 KB Output is partially correct
15 Partially correct 1 ms 200 KB Output is partially correct
16 Partially correct 1 ms 200 KB Output is partially correct
17 Partially correct 28 ms 336 KB Output is partially correct
18 Partially correct 30 ms 356 KB Output is partially correct
19 Partially correct 43 ms 460 KB Output is partially correct
20 Partially correct 47 ms 344 KB Output is partially correct
21 Partially correct 43 ms 344 KB Output is partially correct
22 Correct 1 ms 200 KB Output is correct
23 Partially correct 1 ms 200 KB Output is partially correct
24 Partially correct 1 ms 308 KB Output is partially correct
25 Correct 2 ms 304 KB Output is correct
26 Partially correct 2 ms 200 KB Output is partially correct
27 Partially correct 3 ms 200 KB Output is partially correct
28 Correct 4 ms 200 KB Output is correct
29 Correct 4 ms 308 KB Output is correct
30 Partially correct 3 ms 312 KB Output is partially correct
31 Partially correct 4 ms 308 KB Output is partially correct
32 Partially correct 36 ms 344 KB Output is partially correct
33 Partially correct 36 ms 340 KB Output is partially correct
34 Partially correct 40 ms 340 KB Output is partially correct
35 Partially correct 57 ms 340 KB Output is partially correct
36 Correct 36 ms 336 KB Output is correct
37 Partially correct 30 ms 336 KB Output is partially correct
38 Partially correct 31 ms 396 KB Output is partially correct
39 Partially correct 33 ms 456 KB Output is partially correct
40 Partially correct 39 ms 336 KB Output is partially correct
41 Partially correct 36 ms 340 KB Output is partially correct
42 Partially correct 20 ms 340 KB Output is partially correct
43 Correct 38 ms 340 KB Output is correct
44 Partially correct 43 ms 344 KB Output is partially correct
45 Correct 16 ms 396 KB Output is correct
46 Correct 34 ms 416 KB Output is correct
47 Correct 31 ms 624 KB Output is correct
48 Partially correct 34 ms 356 KB Output is partially correct
49 Correct 29 ms 340 KB Output is correct
50 Correct 18 ms 340 KB Output is correct
51 Partially correct 31 ms 344 KB Output is partially correct
52 Partially correct 24 ms 336 KB Output is partially correct
53 Partially correct 36 ms 464 KB Output is partially correct
54 Partially correct 24 ms 340 KB Output is partially correct
55 Partially correct 34 ms 460 KB Output is partially correct
56 Partially correct 28 ms 340 KB Output is partially correct
57 Partially correct 30 ms 344 KB Output is partially correct
58 Partially correct 34 ms 452 KB Output is partially correct
59 Partially correct 34 ms 340 KB Output is partially correct
60 Partially correct 29 ms 344 KB Output is partially correct
61 Partially correct 36 ms 344 KB Output is partially correct
62 Partially correct 41 ms 440 KB Output is partially correct
63 Partially correct 30 ms 348 KB Output is partially correct
64 Partially correct 25 ms 340 KB Output is partially correct
65 Partially correct 40 ms 344 KB Output is partially correct
66 Partially correct 33 ms 400 KB Output is partially correct
67 Partially correct 24 ms 452 KB Output is partially correct
68 Correct 38 ms 344 KB Output is correct
69 Partially correct 14 ms 340 KB Output is partially correct
70 Partially correct 30 ms 336 KB Output is partially correct
71 Partially correct 39 ms 364 KB Output is partially correct
72 Partially correct 36 ms 340 KB Output is partially correct
73 Correct 22 ms 336 KB Output is correct
74 Correct 28 ms 340 KB Output is correct
75 Correct 30 ms 460 KB Output is correct
76 Correct 37 ms 340 KB Output is correct
77 Correct 37 ms 448 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Partially correct 1 ms 256 KB Output is partially correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 1 ms 240 KB Output is correct
82 Partially correct 2 ms 244 KB Output is partially correct
83 Partially correct 2 ms 200 KB Output is partially correct
84 Correct 1 ms 200 KB Output is correct
85 Partially correct 1 ms 200 KB Output is partially correct
86 Correct 2 ms 200 KB Output is correct
87 Correct 2 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Partially correct 1 ms 200 KB Output is partially correct
90 Partially correct 2 ms 200 KB Output is partially correct
91 Partially correct 1 ms 200 KB Output is partially correct
92 Correct 1 ms 200 KB Output is correct
93 Partially correct 1 ms 200 KB Output is partially correct
94 Correct 1 ms 200 KB Output is correct
95 Partially correct 1 ms 200 KB Output is partially correct
96 Partially correct 2 ms 200 KB Output is partially correct
97 Partially correct 1 ms 200 KB Output is partially correct
98 Partially correct 3 ms 200 KB Output is partially correct
99 Partially correct 2 ms 328 KB Output is partially correct
100 Partially correct 1 ms 304 KB Output is partially correct
101 Correct 2 ms 200 KB Output is correct
102 Partially correct 2 ms 200 KB Output is partially correct
103 Correct 2 ms 268 KB Output is correct
104 Partially correct 1 ms 200 KB Output is partially correct
105 Correct 2 ms 200 KB Output is correct
106 Partially correct 2 ms 200 KB Output is partially correct
107 Correct 1 ms 200 KB Output is correct
108 Partially correct 1 ms 200 KB Output is partially correct
109 Partially correct 1 ms 292 KB Output is partially correct
110 Partially correct 1 ms 200 KB Output is partially correct
111 Partially correct 1 ms 200 KB Output is partially correct
112 Partially correct 1 ms 200 KB Output is partially correct
113 Partially correct 1 ms 200 KB Output is partially correct
114 Partially correct 1 ms 200 KB Output is partially correct
115 Partially correct 1 ms 200 KB Output is partially correct
116 Partially correct 2 ms 200 KB Output is partially correct
117 Partially correct 1 ms 200 KB Output is partially correct
118 Partially correct 2 ms 200 KB Output is partially correct
119 Partially correct 2 ms 200 KB Output is partially correct
120 Partially correct 1 ms 288 KB Output is partially correct
121 Partially correct 2 ms 200 KB Output is partially correct
122 Partially correct 2 ms 200 KB Output is partially correct
123 Partially correct 2 ms 304 KB Output is partially correct