제출 #1205791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1205791		Adeeb_obedo	콤보 (IOI18_combo)	C++20	30 / 100	10 ms	532 KiB

combo

#include<bits/stdc++.h>
#define int long long
#define ld   double
#define _1 first
#define _2 second
#define yes cout<<"Yes\n"
#define nah cout<<"No\n"
#define FFF ios_base::sync_with_stdio(0);cin.tie(0);
#define ipr pair<int,int>
#define ret return
#define intt int32_t
#define mid ((l+r)/2)
#define pb push_back
#define lll __int128
#include "combo.h"
using namespace std;
int tst, ts;
intt mo = 1e9+7, dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0};
int mul( int x, int y ) {
    ret ( ( x % mo ) * ( y % mo ) ) % mo;
    ret x*y;
}
int pwo( int x, int y ) {
    int res = 1;
    for( int i = 63; i + 1; i-- )
        res = mul( res, res * ( ( 1ll << i )&y ? x : 1 ) );
    ret res;
}
int dvii( int x, int y ) {
    ret mul( x, pwo( y, mo - 2 ) );
}
int oo( char x ) {
    ret ( int )x - '0';
}
int lgg( int x, int y ) {
    int u = 0;
    while( x ) {
        u++;
        x /= y;
    }
    ret u;
}
int mun( int x, int y ) {
    while( x < y )x += mo;
    ret ( x - y ) % mo;
}
int add( int x, int y ) {
    ret x + y - ( mo * ( x + y >= mo ) );
    ret x + y;
}
int lcm( int x, int y ) {
    ret ( x * y ) / __gcd( x, y );
}
#define endl '\n';
const int M =1007, N = 2e5 + 7, N2 = 5e3 + 7, inf = 2e18 + 7;
int n;
string guess_sequence(intt Nn){
	n=Nn;
	srand(time(0));
	string s="",x="ABXY";
	if(press("AB"))
		s+=(press("A")?'A':'B');
	else
		s+=(press("X")?'X':'Y');
	for(int i=0;i<4;i++)
        if(x[i]==s[0])
            swap(x[i],x[3]);
	while(s.size()<n){
		int o=rand()%3;
		swap(x[o],x[2]);
		string as=s+x[0],bs=as+s+x[1];
		//cout<<as<<'\n'<<bs<<'\n'<<press(as)<<" "<<press(bs)<<" "<<bs.size()<<" "<<as.size()<<endl;
		if(press(bs)==as.size())
			s+=((press(as)==as.size())?x[0]:x[1]);
		else
			s+=x[2];
	}
//	cout<<n<<endl;
	ret s;
}
/*
void solve(){


}
intt main() {
	FFF
   // freopen("fcolor.in", "r", stdin);
   // freopen("fcolor.out", "w", stdout);
	tst = 1;
	//cin >> tst;
    for ( ts = 1; ts <= tst; ts++ ){
		solve();
   }
}
*/

• Subtask 1: 5 / 5
• Subtask 2: 25 / 95