oj.uz

Submission #846987

# Submission time Handle Problem Language Result Execution time Memory
846987 2023-09-08T20:28:07 Z lbm364dl Combo (IOI18_combo) C++14
100 / 100
 13 ms 1796 KB 
//#include <bits/stdc++.h>
#include <iostream>
#include "combo.h"
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <queue>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;

#ifdef LOCAL
#define show(x) cerr << #x" = " << (x) << "\n"
#else
#define show(x) 0
#endif

#define pb push_back
#define pp pop_back
#define mp make_pair
#define fst first
#define snd second
#define FOR(var, from, to) for(int var = from; var < int(to); ++var)
#define all(x) x.begin(), x.end()
#define rev(x) x.rbegin(), x.rend()
#define sz(x) int(x.size())
#define vec(x) vector<x>
#define INF 2000000000

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// use unique second element of pair to work as multiset
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
const ll mod = 1000000007, mod2 = 998244353;

template<typename T, typename U> ostream &operator<<(ostream &os, pair<T,U> p){os << "(" << p.fst << "," << p.snd << ")"; return os;}
template<typename T, typename U> istream &operator>>(istream &is, pair<T,U> &p){is >> p.fst >> p.snd; return is;}
template<typename T> istream &operator>>(istream &is, vector<T> &v){FOR(i, 0, v.size()) is >> v[i]; return is;}
template<typename T> ostream &operator<<(ostream &os, vector<T> v){for(T x : v) os << x << " "; return os;}
template<typename T> ostream &operator<<(ostream &os, set<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T> ostream &operator<<(ostream &os, multiset<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T, typename U> ostream &operator<<(ostream &os, map<T,U> m){for(auto x : m) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_set s){for(int x : s) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_multiset s){for(pii x : s) os << x.fst << " "; return os;} 
ll mod_pow(ll a, ll b, ll m){ ll sol = 1; while(b){ if(b&1){ sol = (sol*a)%m; b--; }else{ a = (a*a)%m; b/=2; } } return sol;}
ll rem(ll a, ll b){ ll res = a%b; return res < 0 ? res+b : res; }

string guess_sequence(int n){
	string abxy = "ABXY";
	int f;
	string s;
	if(press("AB") > 0){
		if(press("A") > 0) s = "A", f = 0;
		else s = "B", f = 1;
	}else{
		if(press("X") > 0) s = "X", f = 2;
		else s = "Y", f = 3;
	}
	if(n == 1) return s;
	FOR(i, 2, n){
		string t;
		t += s;
		t.pb(abxy[(f+2)%4]);
		t += s;
		t.pb(abxy[(f+3)%4]);
		t.pb(abxy[(f+1)%4]);
		t += s;
		t.pb(abxy[(f+3)%4]);
		t.pb(abxy[(f+2)%4]);
		t += s;
		t.pb(abxy[(f+3)%4]);
		t.pb(abxy[(f+3)%4]);
		int ret = press(t);
		if(ret == sz(s)) s.pb(abxy[(f+1)%4]);
		else if(ret == sz(s)+1) s.pb(abxy[(f+2)%4]);
		else s.pb(abxy[(f+3)%4]);
		show(s);
	}
	if(press(s+"A"+s+"B") > sz(s)){
		if(press(s+"A") > sz(s)) s.pb('A');
		else s.pb('B');
	}else{
		if(press(s+"X") > sz(s)) s.pb('X');
		else s.pb('Y');
	}
	return s;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:17:17: warning: statement has no effect [-Wunused-value]
   17 | #define show(x) 0
      |                 ^
combo.cpp:81:3: note: in expansion of macro 'show'
   81 |   show(s);
      |   ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 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 1 ms 544 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 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 1 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 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 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 596 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 10 ms 1480 KB Output is correct
18 Correct 11 ms 1456 KB Output is correct
19 Correct 11 ms 1096 KB Output is correct
20 Correct 10 ms 1284 KB Output is correct
21 Correct 10 ms 1556 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 692 KB Output is correct
24 Correct 1 ms 436 KB Output is correct
25 Correct 1 ms 692 KB Output is correct
26 Correct 1 ms 440 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 1 ms 444 KB Output is correct
29 Correct 1 ms 448 KB Output is correct
30 Correct 1 ms 436 KB Output is correct
31 Correct 1 ms 440 KB Output is correct
32 Correct 10 ms 1116 KB Output is correct
33 Correct 10 ms 1212 KB Output is correct
34 Correct 10 ms 1264 KB Output is correct
35 Correct 10 ms 1104 KB Output is correct
36 Correct 12 ms 1528 KB Output is correct
37 Correct 11 ms 1460 KB Output is correct
38 Correct 10 ms 1468 KB Output is correct
39 Correct 10 ms 1056 KB Output is correct
40 Correct 13 ms 1188 KB Output is correct
41 Correct 11 ms 968 KB Output is correct
42 Correct 11 ms 1448 KB Output is correct
43 Correct 10 ms 1436 KB Output is correct
44 Correct 10 ms 1524 KB Output is correct
45 Correct 11 ms 1584 KB Output is correct
46 Correct 10 ms 1796 KB Output is correct
47 Correct 11 ms 1468 KB Output is correct
48 Correct 10 ms 740 KB Output is correct
49 Correct 10 ms 1724 KB Output is correct
50 Correct 10 ms 1632 KB Output is correct
51 Correct 10 ms 1200 KB Output is correct
52 Correct 10 ms 1340 KB Output is correct
53 Correct 11 ms 1616 KB Output is correct
54 Correct 11 ms 1220 KB Output is correct
55 Correct 12 ms 1496 KB Output is correct
56 Correct 10 ms 1724 KB Output is correct
57 Correct 10 ms 1540 KB Output is correct
58 Correct 10 ms 1728 KB Output is correct
59 Correct 11 ms 1316 KB Output is correct
60 Correct 10 ms 1728 KB Output is correct
61 Correct 10 ms 1388 KB Output is correct
62 Correct 12 ms 1448 KB Output is correct
63 Correct 10 ms 976 KB Output is correct
64 Correct 11 ms 1700 KB Output is correct
65 Correct 10 ms 1340 KB Output is correct
66 Correct 10 ms 1120 KB Output is correct
67 Correct 10 ms 1216 KB Output is correct
68 Correct 11 ms 1476 KB Output is correct
69 Correct 10 ms 1480 KB Output is correct
70 Correct 10 ms 1056 KB Output is correct
71 Correct 10 ms 1140 KB Output is correct
72 Correct 10 ms 1672 KB Output is correct
73 Correct 10 ms 1464 KB Output is correct
74 Correct 10 ms 1168 KB Output is correct
75 Correct 9 ms 1252 KB Output is correct
76 Correct 12 ms 1632 KB Output is correct
77 Correct 11 ms 1244 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 1 ms 436 KB Output is correct
86 Correct 0 ms 436 KB Output is correct
87 Correct 0 ms 436 KB Output is correct
88 Correct 1 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 1 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 436 KB Output is correct
96 Correct 1 ms 432 KB Output is correct
97 Correct 1 ms 432 KB Output is correct
98 Correct 1 ms 432 KB Output is correct
99 Correct 1 ms 444 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 1 ms 436 KB Output is correct
102 Correct 0 ms 440 KB Output is correct
103 Correct 1 ms 436 KB Output is correct
104 Correct 0 ms 436 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 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 1 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 0 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 1 ms 344 KB Output is correct
118 Correct 1 ms 344 KB Output is correct
119 Correct 0 ms 436 KB Output is correct
120 Correct 0 ms 444 KB Output is correct
121 Correct 0 ms 436 KB Output is correct
122 Correct 1 ms 440 KB Output is correct
123 Correct 0 ms 440 KB Output is correct