답안 #975603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975603	2024-05-05T14:22:26 Z	yeediot	콤보 (IOI18_combo)	C++17	5 / 100	1 ms	344 KB

combo

#include "combo.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
string guess_sequence(int n){
    string s;
    vector<char>v={'A','B','X','Y'};
    string temp="AB";
    int res=press(temp);
    if(res>0){
        temp="A";
        res=press(temp);
        if(!res)swap(v[0],v[1]);
    }
    else{
        temp="X";
        res=press(temp);
        if(res)swap(v[0],v[2]);
        else swap(v[0],v[3]);
    }
    s+=v[0];
    for(int i=1;i+1<n;i++){
        temp=s+v[1]+v[1]+s+v[1]+v[2]+s+v[1]+v[3]+s+v[3];
        res=press(temp);
        if(res==i+2)s+=v[1];
        else if(res==i+1)s+=v[3];
        else s+=v[2];
    }
    if(press(s+v[1])==n)s+=v[1];
    else if(press(s+v[2])==n)s+=v[2];
    else s+=v[3];
    return s;
}
 /*
 input:
 
 */















 

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	1 ms	344 KB	Output is correct

Subtask #2

0 / 95.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Wrong Answer: wrong guess.
2	Halted	0 ms	0 KB	-