답안 #972909

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
972909	2024-05-01T10:11:53 Z	tamir1	콤보 (IOI18_combo)	C++17	5 / 100	1 ms	420 KB

combo

#include "combo.h"
#include <bits/stdc++.h>
using namespace std;
std::string guess_sequence(int N) {
  string S,u;
  vector<string> v;
  if(press("A")){
  	S = "A";
  	u="BXY";
  	v={"BB","BX","BY","X"};
  }
  else if(press("B")){
  	S = "B";
  	u="AXY";
  	v={"AA","AX","AY","X"};
  }
  else if(press("X")){
  	S = "X";
  	u="ABY";
  	v={"AA","AB","AY","B"};
  }
  else{
  	S = "Y";
  	u="ABX";
  	v={"AA","AB","AX","B"};
  }
  string p(N*4,S[0]);
  for(int i=1;i<N-1;i++){
  	p[i]=u[0];
  	p[i+1]=u[0];
  	p[N+i]=u[0];
  	p[N+i+1]=u[1];
  	p[2*N+i]=u[0];
  	p[2*N+i+1]=u[2];
  	p[3*N+i]=u[1];
	//cout << p << "\n";
	int coin=press(p)-i;
	//cout << coin << "\n";
	p[i]=u[2-coin];
	p[N+i]=u[2-coin];
	p[2*N+i]=u[2-coin];
	p[3*N+i]=u[2-coin];
	S+=u[2-coin];
  }
  if(press(S+u[0])==N) S+=u[0];
  else if(press(S+u[1])==N) S+=u[1];
  else if(press(S+u[2])==N) S+=u[2];
  return S;
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 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	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 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	0 ms	420 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 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	1 ms	344 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 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	0 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct

Subtask #2

0 / 95.0

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