| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1094240 | guymmk | 콤보 (IOI18_combo) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "grader.h"
#include "memory.h"
using namespace std;
using namespace __gnu_pbds;
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("popcnt")
#define int long long
#define ll long long
#define endl '\n'
#define pii pair<int,int>
#define debug(...) printf(__VA_ARGS__)
//#define debug(...)
#define trace(x) cout<<#x<<"="<<x<<endl;
//#define trace(x)
#define vi vector<int>
#define vpii vector<pii >
#define vvi vector<vector<int>
#define umap unordered_map
#define uset unordered_set
#define mk make_pair
#define pb push_back
#define pob pop_back
#define _ <<' '<<
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define read(x) for (auto& zu: (x)) cin >> zu;
static inline void print(const int &x) {
if (x > 9)print(x / 10);
putchar('0' + x % 10);
}
#define F first
#define S second
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define mustawa ios::sync_with_stdio(false);cin.tie(nullptr);
#define mishari main
const int inf=1e9+7;
void fa(bool ok){ cout << (ok ? "YES": "NO") << endl;}
int pw(ll a, ll b, ll mod= 1e9 + 7){
ll result = 1;
while(b) {
if(b&1) {
result = (result*a)%mod;
}
a = (a * a) % mod;
b>>=1;
}
return result;
}
inline void usaco(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}int gcd(int a,int b){
if (b == 0)return a;
return gcd(b, a % b);
}
int lcm(int a, int b){
return (a / gcd(a, b)) * b;
}
//long double log(int base,int x){
// return log2(x)/log(base);
//}
int log(int base,int x){
return ceil(log2(x)/log(base));
}
string guess_sequence(int n){
string g="ABXY";
int x=press("A");
if(x){
string ret="A";
while(x!=n){
for(int i=0;i<4;i++){
if(g[i]!=ret[0]){
x= press(ret+g[i]);
if(x>g.size()){
ret+=g[i];
break;
}
}
}
}cout<<ret<<endl;
}int x=press("B");
if(x){
string ret="B";
while(x!=n){
for(int i=0;i<4;i++){
if(g[i]!=ret[0]){
x= press(ret+g[i]);
if(x>g.size()){
ret+=g[i];
break;
}
}
}
}cout<<ret<<endl;
}int x=press("X");
if(x){
string ret="X";
while(x!=n){
for(int i=0;i<4;i++){
if(g[i]!=ret[0]){
x= press(ret+g[i]);
if(x>g.size()){
ret+=g[i];
break;
}
}
}
}cout<<ret<<endl;
}int x=press("Y");
if(x){
string ret="Y";
while(x!=n){
for(int i=0;i<4;i++){
if(g[i]!=ret[0]){
x= press(ret+g[i]);
if(x>g.size()){
ret+=g[i];
break;
}
}
}
}cout<<ret<<endl;
}
}