제출 #199601

#제출 시각아이디문제언어결과실행 시간메모리
199601zaneyu콤보 (IOI18_combo)C++14
100 / 100
53 ms576 KiB
#include<combo.h> #include<bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; #pragma GCC optimize("unroll-loops,no-stack-protector") //order_of_key #of elements less than x // find_by_order kth element typedef long long int ll; #define ld double #define pii pair<ll,ll> #define f first #define s second #define pb push_back #define REP(i,n) for(int i=0;i<n;i++) #define REP1(i,n) for(int i=1;i<=n;i++) #define FILL(n,x) memset(n,x,sizeof(n)) #define ALL(_a) _a.begin(),_a.end() #define sz(x) (int)x.size() const ll maxn=1e5+5; const ll maxlg=__lg(maxn)+2; const ll INF64=4e18; const int INF=0x3f3f3f3f; const ll MOD=998244353; const ld PI=acos(-1); const ld eps=1e-9; #define lowb(x) x&(-x) #define MNTO(x,y) x=min(x,(__typeof__(x))y) #define MXTO(x,y) x=max(x,(__typeof__(x))y) #define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end())))) #define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin()) ll mult(ll a,ll b){ return (a*b)%MOD; } ll mypow(ll a,ll b){ if(b<=0) return 1; ll res=1LL; while(b){ if(b&1) res=mult(res,a); a=mult(a,a); b>>=1; } return res; } string guess_sequence(int n){ string ans=""; int pv=0; char a,b,c,d; if(press("AB")){ a='A',b='B',c='X',d='Y'; if(press("B")) swap(a,b); } else{ a='X',b='Y',c='A',d='B'; if(press("Y")) swap(a,b); } ans+=a; if(n==1) return ans; REP(i,n-2){ int z=press(ans+b+ans+c+b+ans+c+c+ans+c+d); if(z==i+1) ans+=d; else if(z==i+2) ans+=b; else ans+=c; } if(press(ans+b)==n) ans+=b; else if(press(ans+c)==n) ans+=c; else ans+=d; return ans; }

컴파일 시 표준 에러 (stderr) 메시지

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:49:7: warning: unused variable 'pv' [-Wunused-variable]
   49 |   int pv=0;
      |       ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...