Submission #339219

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
339219	2020-12-24T20:59:26 Z	Kerim	Combo (IOI18_combo)	C++17	5 / 100	1 ms	200 KB

combo

#include "combo.h"
#include "bits/stdc++.h"
using namespace std;
/*
namespace {

constexpr int MAX_N = 2000;
constexpr int MAX_NUM_MOVES = 8000;

int N;
std::string S;

int num_moves;

void wrong_answer(const char *MSG) {
  printf("Wrong Answer: %s\n", MSG);
  exit(0);
}

}  // namespace

int press(std::string p) {
  if (++num_moves > MAX_NUM_MOVES) {
    wrong_answer("too many moves");
  }
  int len = p.length();
  if (len > 4 * N) {
    wrong_answer("invalid press");
  }
  for (int i = 0; i < len; ++i) {
    if (p[i] != 'A' && p[i] != 'B' && p[i] != 'X' && p[i] != 'Y') {
      wrong_answer("invalid press");
    }
  }
  int coins = 0;
  for (int i = 0, j = 0; i < len; ++i) {
    if (j < N && S[j] == p[i]) {
      ++j;
    } else if (S[0] == p[i]) {
      j = 1;
    } else {
      j = 0;
    }
    coins = std::max(coins, j);
  }
  return coins;
}
*/
string tmp="ABXY";
string guess_sequence(int N) {
	string ans="T",avl;
	for(int i=0;i<4;i++){
		ans[0]=tmp[i];
		if(press(ans))
			break;
	}
	for(int i=0;i<4;i++)
		if(ans[0]!=tmp[i])
			avl+=tmp[i];
	tmp=avl;
	for(int i=2;i<N;i++){
		string cur;
		cur+=ans+tmp[0];
		cur+=ans+tmp[1]+tmp[0];
		cur+=ans+tmp[1]+tmp[1];
		cur+=ans+tmp[1]+tmp[2];
		int val=press(cur);
		if(val==i)
			ans+=tmp[0];	
		else if(val>i)
			ans+=tmp[1];
		else
			ans+=tmp[2];
	}
	for(int i=0;i<3;i++)
		if(press(ans+tmp[i])==N)
			return ans+tmp[i];
	return "";
}
/*
int main() {
	freopen("file.in","r",stdin);
  char buffer[MAX_N + 1];
  if (scanf("%s", buffer) != 1) {
    fprintf(stderr, "Error while reading input\n");
    exit(1);
  }
  S = buffer;
  N = S.length();

  num_moves = 0;
  std::string answer = guess_sequence(N);
  if (answer != S) {
    wrong_answer("wrong guess");
    exit(0);
  }
  printf("Accepted: %d\n", num_moves);
  return 0;
}
*/

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Correct	0 ms	200 KB	Output is correct
4	Correct	0 ms	200 KB	Output is correct
5	Correct	0 ms	200 KB	Output is correct
6	Correct	1 ms	200 KB	Output is correct
7	Correct	1 ms	200 KB	Output is correct
8	Correct	1 ms	200 KB	Output is correct
9	Correct	0 ms	200 KB	Output is correct
10	Correct	1 ms	200 KB	Output is correct
11	Correct	1 ms	200 KB	Output is correct
12	Correct	0 ms	200 KB	Output is correct
13	Correct	1 ms	200 KB	Output is correct
14	Correct	0 ms	200 KB	Output is correct
15	Correct	1 ms	200 KB	Output is correct
16	Correct	0 ms	200 KB	Output is correct
17	Correct	0 ms	200 KB	Output is correct
18	Correct	0 ms	200 KB	Output is correct
19	Correct	1 ms	200 KB	Output is correct
20	Correct	1 ms	200 KB	Output is correct
21	Correct	1 ms	200 KB	Output is correct
22	Correct	1 ms	200 KB	Output is correct
23	Correct	1 ms	200 KB	Output is correct
24	Correct	1 ms	200 KB	Output is correct
25	Correct	1 ms	200 KB	Output is correct
26	Correct	1 ms	200 KB	Output is correct
27	Correct	1 ms	200 KB	Output is correct
28	Correct	1 ms	200 KB	Output is correct
29	Correct	1 ms	200 KB	Output is correct
30	Correct	1 ms	200 KB	Output is correct
31	Correct	1 ms	200 KB	Output is correct
32	Correct	1 ms	200 KB	Output is correct
33	Correct	0 ms	200 KB	Output is correct
34	Correct	1 ms	200 KB	Output is correct
35	Correct	1 ms	200 KB	Output is correct
36	Correct	1 ms	200 KB	Output is correct

Subtask #2

0 / 95.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	200 KB	Wrong Answer: wrong guess.
2	Halted	0 ms	0 KB	-