제출 #316674

#제출 시각아이디문제언어결과실행 시간메모리
316674anakib1콤보 (IOI18_combo)C++17
100 / 100
48 ms640 KiB
#include "combo.h" #include <iostream> #include <cmath> #include <algorithm> #include <stdio.h> #include <cstring> #include <string> #include <cstdlib> #include <vector> #include <bitset> #include <map> #include <chrono> #include <functional> #include <unordered_set> #include <unordered_map> #include <numeric> #include <queue> #include <ctime> #include <stack> #include <set> #include <list> #include <deque> #include <iomanip> #include <sstream> #include <fstream> #include <stdarg.h> #include <utility> #include "combo.h" using namespace std; #define pb push_back #define mp make_pair #define ll long long #define ull unisgned long long #define ld long double #define all(a) a.begin(), a.end() #define SORT(a) sort(all(a)) #define pii pair<int, int> #define tii triple<int, int, int> #define e 1e-7 #define PI acos(-1) #define sz(a) (int)(a.size()) #define inf 1e17 #define vi vector<int> #define F first #define S second #define rng(x) for(int _ = 0; _ < (x); _++) #define rngi(i, x) for(int i = 0; i < (x); i++) #define rngsi(s, i, x) for(int i = (s); i <(x); i++) #define problem "a" template<typename A, typename B, typename C> struct triple { A X; B Y; C Z; triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {} }; template<typename A, typename B, typename C> triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) { return triple<A, B, C>(a, b, c); } template<typename A, typename B, typename C> bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) { if (a.X != b.X) return a.X < b.X; if (a.Y != b.Y) return a.Y < b.Y; return a.Z < b.Z; } template<typename T, typename SS> ostream& operator<<(ostream& ofs, const pair<T, SS>& p) { ofs << "( " << p.F << " , " << p.S << " )"; return ofs; } template<typename T> void print(T a) { for (auto i : a) cout << i << ' '; cout << '\n'; } template<typename T> T max(T a, T b, T c) { return max(a, max(b, c)); } template<typename T> T min(T a, T b, T c) { return min(a, min(b, c)); } template<typename T, typename D> D min(T a) { return *min_element(all(a)); } template<typename T, typename D> D max(T a) { return *max_element(all(a)); } struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; std::string guess_sequence(int n) { vector<char> id{ 'A', 'B','X','Y'}; int f = 3; if (press(string(2 * n, id[0]) + string(2 * n, id[1]))) { if (press(string(1, id[0]))) f = 0; else f = 1; } else { if (press(string(1, id[2]))) f = 2; else f = 3; } string p = string(1, id[f]); if (n == 1) return p; rngi(i, n - 2) { string ask = p + string(1, id[(f + 1) % 4]) + p + string(1, id[(f + 2) % 4]) + string(1, id[(f + 1) % 4]) + p + string(1, id[(f + 2) % 4]) + string(1, id[(f + 2) % 4]) + p + string(1, id[(f + 2) % 4]) + string(1, id[(f + 3) % 4]); int v = press(ask); if (v == sz(p)) p += string(1, id[(f + 3) % 4]); else if (v == sz(p) + 1) p += string(1, id[(f + 1) % 4]); else p += string(1, id[(f + 2) % 4]); } if (press(p + string(1, id[(f + 1) % 4])) == n) p += id[(f + 1) % 4]; else if (press(p + string(1, id[(f + 2) % 4])) == n) p += id[(f + 2) % 4]; else p += id[(f + 3) % 4]; return p; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...