oj.uz

Submission #349481

# Submission time Handle Problem Language Result Execution time Memory
349481 2021-01-17T16:19:29 Z ezdp Combo (IOI18_combo) C++14
97 / 100
 60 ms 568 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include<bits/stdc++.h>
#include<combo.h>
#include<ext/pb_ds/assoc_container.hpp>

#define endl '\n'
#define pb push_back
#define fr first
#define sc second
#define ll long long int
#define ld long double
#define bit(idx) idx&(-idx)
#define bin(x) bitset<32>(x)
#define all(A) A.begin(), A.end()
#define de(x) cout << #x << " = " << x << endl;
#define row vector<ll>
#define row_matrix vector<ll>
#define matrix vector<row_matrix>
#define ordered_set_T ll

using namespace std;
using namespace __gnu_pbds;

typedef tree<ordered_set_T, null_type, less<ordered_set_T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
/// find_by_order(x) -> x-th element in the set
/// order_of_key(x)  -> how many elements are smaller than x
/// insert(x)		 -> inserts x into the set

string guess_sequence(int N){
	string ans, qry;
	ll tmp = press("AB");
	if(tmp){
		tmp = press("A");
		if(tmp) ans += 'A';
		else 	ans += 'B';
	}
	else{
		tmp = press("X");
		if(tmp) ans += 'X';
		else 	ans += 'Y';
	}
	
	if(N == 1) return ans;
	
	vector<char> v;
	if(ans != "A") v.pb('A'); 
	if(ans != "B") v.pb('B');
	if(ans != "X") v.pb('X');
	if(ans != "Y") v.pb('Y');
	
	for(int i = 1; i + 1 < N; i ++){
		qry = ans; qry += v[0];
		qry += ans; qry += v[1]; qry += v[0];
		qry += ans; qry += v[1]; qry += v[1];
		qry += ans; qry += v[1]; qry += v[2];
		tmp = press(qry);
		if(tmp == ans.size() + 0) ans += v[2];
		if(tmp == ans.size() + 1) ans += v[0];
		if(tmp == ans.size() + 2) ans += v[1];
	}
	
	qry = ans; qry += v[0];
	tmp = press(qry);
	if(tmp == N) return qry;
	
	qry = ans; qry += v[1];
	tmp = press(qry);
	if(tmp == N) return qry;
	
	qry = ans; qry += v[2];
	tmp = press(qry);
	if(tmp == N) return qry;
}
/**

*/

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:59:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   if(tmp == ans.size() + 0) ans += v[2];
      |      ~~~~^~~~~~~~~~~~~~~~~
combo.cpp:60:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   if(tmp == ans.size() + 1) ans += v[0];
      |      ~~~~^~~~~~~~~~~~~~~~~
combo.cpp:61:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   if(tmp == ans.size() + 2) ans += v[1];
      |      ~~~~^~~~~~~~~~~~~~~~~
combo.cpp:32:9: warning: control reaches end of non-void function [-Wreturn-type]
   32 |  string ans, qry;
      |         ^~~

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 1 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 256 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 0 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 2 ms 240 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 2 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 252 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 200 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 256 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 Correct 1 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Partially correct 1 ms 200 KB Output is partially correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Partially correct 1 ms 200 KB Output is partially correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Partially correct 1 ms 200 KB Output is partially correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Partially correct 1 ms 200 KB Output is partially correct
17 Correct 40 ms 384 KB Output is correct
18 Correct 34 ms 464 KB Output is correct
19 Correct 24 ms 396 KB Output is correct
20 Partially correct 40 ms 340 KB Output is partially correct
21 Correct 35 ms 568 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Partially correct 1 ms 200 KB Output is partially correct
24 Correct 2 ms 200 KB Output is correct
25 Correct 2 ms 312 KB Output is correct
26 Correct 3 ms 296 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Partially correct 2 ms 296 KB Output is partially correct
30 Partially correct 1 ms 292 KB Output is partially correct
31 Correct 5 ms 308 KB Output is correct
32 Correct 40 ms 340 KB Output is correct
33 Partially correct 36 ms 336 KB Output is partially correct
34 Correct 35 ms 336 KB Output is correct
35 Correct 39 ms 340 KB Output is correct
36 Partially correct 44 ms 340 KB Output is partially correct
37 Correct 24 ms 344 KB Output is correct
38 Correct 29 ms 344 KB Output is correct
39 Correct 60 ms 352 KB Output is correct
40 Correct 34 ms 336 KB Output is correct
41 Partially correct 31 ms 340 KB Output is partially correct
42 Partially correct 30 ms 340 KB Output is partially correct
43 Correct 19 ms 344 KB Output is correct
44 Correct 28 ms 336 KB Output is correct
45 Correct 32 ms 336 KB Output is correct
46 Correct 30 ms 340 KB Output is correct
47 Partially correct 30 ms 340 KB Output is partially correct
48 Correct 29 ms 340 KB Output is correct
49 Correct 29 ms 340 KB Output is correct
50 Correct 24 ms 356 KB Output is correct
51 Correct 19 ms 340 KB Output is correct
52 Partially correct 35 ms 336 KB Output is partially correct
53 Correct 15 ms 344 KB Output is correct
54 Correct 37 ms 336 KB Output is correct
55 Correct 19 ms 448 KB Output is correct
56 Correct 36 ms 380 KB Output is correct
57 Correct 21 ms 444 KB Output is correct
58 Correct 23 ms 424 KB Output is correct
59 Correct 28 ms 428 KB Output is correct
60 Correct 35 ms 448 KB Output is correct
61 Correct 39 ms 344 KB Output is correct
62 Partially correct 28 ms 568 KB Output is partially correct
63 Partially correct 24 ms 472 KB Output is partially correct
64 Partially correct 28 ms 452 KB Output is partially correct
65 Partially correct 23 ms 432 KB Output is partially correct
66 Partially correct 24 ms 336 KB Output is partially correct
67 Correct 20 ms 340 KB Output is correct
68 Partially correct 34 ms 336 KB Output is partially correct
69 Correct 33 ms 340 KB Output is correct
70 Partially correct 26 ms 340 KB Output is partially correct
71 Partially correct 38 ms 464 KB Output is partially correct
72 Correct 27 ms 340 KB Output is correct
73 Partially correct 37 ms 392 KB Output is partially correct
74 Correct 18 ms 336 KB Output is correct
75 Correct 34 ms 456 KB Output is correct
76 Partially correct 34 ms 340 KB Output is partially correct
77 Correct 36 ms 336 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Partially correct 1 ms 200 KB Output is partially correct
81 Partially correct 1 ms 200 KB Output is partially correct
82 Partially correct 1 ms 200 KB Output is partially 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 Partially correct 1 ms 200 KB Output is partially correct
87 Partially correct 1 ms 200 KB Output is partially correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 1 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 0 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 1 ms 200 KB Output is correct
96 Correct 1 ms 200 KB Output is correct
97 Partially correct 1 ms 200 KB Output is partially correct
98 Partially correct 1 ms 200 KB Output is partially correct
99 Partially correct 2 ms 200 KB Output is partially correct
100 Correct 1 ms 200 KB Output is correct
101 Correct 1 ms 288 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 Partially correct 1 ms 200 KB Output is partially correct
109 Partially correct 1 ms 200 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 Correct 1 ms 200 KB Output is correct
114 Correct 1 ms 200 KB Output is correct
115 Partially correct 1 ms 200 KB Output is partially correct
116 Correct 1 ms 200 KB Output is correct
117 Partially correct 1 ms 200 KB Output is partially correct
118 Correct 1 ms 200 KB Output is correct
119 Partially correct 1 ms 200 KB Output is partially 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 200 KB Output is correct