oj.uz

Submission #493072

# Submission time Handle Problem Language Result Execution time Memory
493072 2021-12-10T04:30:34 Z _adis Combo (IOI18_combo) C++14
100 / 100
 50 ms 584 KB 
/*input

*/
/*inhuman strength
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx,avx2")
*/
#include<bits/stdc++.h>
#include "combo.h"
#define foR(i,a,b) for(int i=a;i<=b;i++)
#define roF(i,a,b) for(int i=a;i>=b;i--)
#define _ff exit(0);
#define Sort(i,a,b) sort(i+a,i+a+b)
#define SORT(i,a,b) sort(i+a,i+a+b,greater<int>())
#define code_chef for(int i=1,x=0;i<=100000;i++){x++;cerr<<x;}
#define TLE cerr<<"\n" <<  1.0*clock()/CLOCKS_PER_SEC << "\n";
#define F first
#define S second
#define sperm(a) next_permutation(a.begin(),a.end());
#define all(a) a.begin(),a.end()
#define nxhieu_speed cin.tie(0)->sync_with_stdio(false);
#define i2 pair<int,int>
#define getbit(x,i) ((x>>(i))&1)
#define batbit(x,i) (x|(1ll<<(i)))
#define tatbit(x,i) (x&~(1<<(i)))
#define RTE cout<<-1;_ff
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) {return l + rng() % (r - l + 1);}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
struct Triple
{
	int Fi;
	int Se;
	int Th;
};
bool operator >(Triple A, Triple B)
{
	if (A.Fi == B.Fi && A.Se == B.Se) return (A.Th > B.Th);
	if (A.Fi == B.Fi && A.Se != B.Se) return (A.Se > B.Se);
	return (A.Fi > B.Fi);
}
bool operator <(Triple A, Triple B)
{
	if (A.Fi == B.Fi && A.Se == B.Se) return (A.Th < B.Th);
	if (A.Fi == B.Fi && A.Se != B.Se) return (A.Se < B.Se);
	return (A.Fi < B.Fi);
}
bool operator ==(Triple A, Triple B)
{
	return (A.Fi == B.Fi && A.Se == B.Se && A.Th == B.Th);
}
int Money;
string guess_sequence(int n)
{
	string s = "";
	Money = press("AB");

	vector<char> S;

	if (Money >= 1)
	{
		Money = press("A");


		if (Money == 1)
		{
			S.push_back('B');
			S.push_back('X');
			S.push_back('Y');
			s = s + 'A';
		}
		else
		{
			S.push_back('A');
			S.push_back('X');
			S.push_back('Y');
			s = s + 'B';
		}
	}
	else {
		Money = press("X");


		if (Money == 1)
		{
			s = s + 'X';
			S.push_back('B');
			S.push_back('A');
			S.push_back('Y');
		}
		else
		{
			s = s + 'Y';
			S.push_back('B');
			S.push_back('X');
			S.push_back('A');
		}
	}
	for (int i = 2; i < n; ++i)
	{
		Money = press( s + S[0] + s + S[1] + S[0] + s + S[1] + S[1] + s + S[1] + S[2] );
		if (Money == s.size() + 1) s = s + S[0];
		else if (Money == s.size() + 2) s = s + S[1];
		else s = s + S[2];
	}
	if (s.size() != n)
	{
		Money = press(s + S[0]);
		if (Money == n) s = s + S[0];
		else
		{
			Money = press(s + S[1]);
			if (Money == n) s = s + S[1];
			else s = s + S[2];
		}
	}
	return s;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:104:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |   if (Money == s.size() + 1) s = s + S[0];
      |       ~~~~~~^~~~~~~~~~~~~~~
combo.cpp:105:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |   else if (Money == s.size() + 2) s = s + S[1];
      |            ~~~~~~^~~~~~~~~~~~~~~
combo.cpp:108:15: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  108 |  if (s.size() != n)
      |      ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 3 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 0 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 276 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 0 ms 200 KB Output is correct
15 Correct 0 ms 200 KB Output is correct
16 Correct 2 ms 200 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 0 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 5 ms 200 KB Output is correct
25 Correct 3 ms 200 KB Output is correct
26 Correct 0 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 0 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 200 KB Output is correct
34 Correct 1 ms 200 KB Output is correct
35 Correct 0 ms 200 KB Output is correct
36 Correct 1 ms 200 KB Output is correct

Subtask #2
95.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 0 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 0 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 4 ms 200 KB Output is correct
13 Correct 0 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 16 ms 380 KB Output is correct
18 Correct 30 ms 404 KB Output is correct
19 Correct 23 ms 376 KB Output is correct
20 Correct 33 ms 452 KB Output is correct
21 Correct 41 ms 380 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 3 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 2 ms 200 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 2 ms 328 KB Output is correct
29 Correct 4 ms 304 KB Output is correct
30 Correct 2 ms 320 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 30 ms 380 KB Output is correct
33 Correct 21 ms 376 KB Output is correct
34 Correct 47 ms 384 KB Output is correct
35 Correct 29 ms 376 KB Output is correct
36 Correct 26 ms 476 KB Output is correct
37 Correct 48 ms 384 KB Output is correct
38 Correct 28 ms 468 KB Output is correct
39 Correct 23 ms 384 KB Output is correct
40 Correct 50 ms 380 KB Output is correct
41 Correct 46 ms 380 KB Output is correct
42 Correct 14 ms 380 KB Output is correct
43 Correct 27 ms 436 KB Output is correct
44 Correct 35 ms 376 KB Output is correct
45 Correct 32 ms 376 KB Output is correct
46 Correct 33 ms 500 KB Output is correct
47 Correct 36 ms 488 KB Output is correct
48 Correct 36 ms 416 KB Output is correct
49 Correct 27 ms 520 KB Output is correct
50 Correct 31 ms 560 KB Output is correct
51 Correct 32 ms 548 KB Output is correct
52 Correct 27 ms 492 KB Output is correct
53 Correct 14 ms 444 KB Output is correct
54 Correct 25 ms 488 KB Output is correct
55 Correct 25 ms 440 KB Output is correct
56 Correct 15 ms 464 KB Output is correct
57 Correct 20 ms 480 KB Output is correct
58 Correct 28 ms 404 KB Output is correct
59 Correct 27 ms 472 KB Output is correct
60 Correct 27 ms 480 KB Output is correct
61 Correct 25 ms 464 KB Output is correct
62 Correct 24 ms 380 KB Output is correct
63 Correct 30 ms 460 KB Output is correct
64 Correct 27 ms 476 KB Output is correct
65 Correct 29 ms 384 KB Output is correct
66 Correct 20 ms 528 KB Output is correct
67 Correct 27 ms 464 KB Output is correct
68 Correct 30 ms 412 KB Output is correct
69 Correct 27 ms 376 KB Output is correct
70 Correct 25 ms 584 KB Output is correct
71 Correct 22 ms 420 KB Output is correct
72 Correct 24 ms 496 KB Output is correct
73 Correct 25 ms 380 KB Output is correct
74 Correct 24 ms 412 KB Output is correct
75 Correct 29 ms 380 KB Output is correct
76 Correct 21 ms 500 KB Output is correct
77 Correct 25 ms 428 KB Output is correct
78 Correct 0 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 0 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 200 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 0 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct
92 Correct 1 ms 200 KB Output is correct
93 Correct 1 ms 200 KB Output is correct
94 Correct 1 ms 200 KB Output is correct
95 Correct 2 ms 200 KB Output is correct
96 Correct 1 ms 200 KB Output is correct
97 Correct 1 ms 200 KB Output is correct
98 Correct 1 ms 296 KB Output is correct
99 Correct 2 ms 200 KB Output is correct
100 Correct 1 ms 200 KB Output is correct
101 Correct 1 ms 200 KB Output is correct
102 Correct 1 ms 200 KB Output is correct
103 Correct 1 ms 200 KB Output is correct
104 Correct 1 ms 200 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 1 ms 200 KB Output is correct
107 Correct 1 ms 200 KB Output is correct
108 Correct 1 ms 200 KB Output is correct
109 Correct 1 ms 200 KB Output is correct
110 Correct 0 ms 200 KB Output is correct
111 Correct 1 ms 200 KB Output is correct
112 Correct 1 ms 200 KB Output is correct
113 Correct 1 ms 200 KB Output is correct
114 Correct 1 ms 200 KB Output is correct
115 Correct 1 ms 200 KB Output is correct
116 Correct 1 ms 200 KB Output is correct
117 Correct 1 ms 200 KB Output is correct
118 Correct 0 ms 296 KB Output is correct
119 Correct 1 ms 200 KB Output is correct
120 Correct 1 ms 200 KB Output is correct
121 Correct 1 ms 200 KB Output is correct
122 Correct 1 ms 200 KB Output is correct
123 Correct 1 ms 300 KB Output is correct