Submission #684731

#TimeUsernameProblemLanguageResultExecution timeMemory
684731NeltCombo (IOI18_combo)C++17
10 / 100
78 ms448 KiB
#include "combo.h" #include <bits/stdc++.h> /* DEFINES */ #define F first #define S second #define ll long long #define ull unsigned long long #define ld long double #define npos ULLONG_MAX #define INF LLONG_MAX #define vv(a) vector<a> #define pp(a, b) pair<a, b> #define pq(a) priority_queue<a> #define qq(a) queue<a> #define ss(a) set<a> #define mm(a, b) map<a, b> #define ump(a, b) unordered_map<a, b> #define sync \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define elif else if #define endl "\n" #define allc(a) begin(a), end(a) #define all(a) a, a + sizeof(a) / sizeof(a[0]) #define pb push_back #define logi(a) __lg(a) #define sqrt(a) sqrtl(a) #define mpr make_pair #define ins insert using namespace std; using namespace __cxx11; typedef char chr; typedef basic_string<chr> str; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); str guess_sequence(int n) { str p; str dx = "AXYB"; for (ll i = 0; i < n; i++) { for (ll k = 0; k < 4; k++) { p += dx[k]; if (press(p) == i + 1) break; p.pop_back(); } } return p; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...