답안 #314115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
314115	2020-10-18T12:37:20 Z	Lemur95	콤보 (IOI18_combo)	C++17	5 / 100	1 ms	260 KB

combo

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define x first
#define y second
#define ld long double
#define ll long long

using namespace std;

int n;
string s;

int press(string p);

/*int press(string p) {
  int ans = 0;
  for(int i = 0; i < p.size(); i++) {
    for(int j = i; j < i + s.size() && j < p.size(); j++) {
      if(p[j] == s[j - i])
        ans = max(ans, j - i + 1);
      else
        break;
    }
  }
  return ans;
}*/

string guess_sequence(int n) {
  string s, t;
  if(press("AB")) {
    if(press("A")) {
      s += 'A';
      t = "BXY";
    } else {
      s += 'B';
      t = "AXY";
    }
  } else {
    if(press("X")) {
      s += 'X';
      t = "ABY";
    } else {
      s += 'Y';
      t = "ABX";
    }
  }
  for(int i = 1; i < n - 1; i++) {
    int ans = press(s + t[0] + s + t[1] + t[0] + s + t[1] + t[1] + s + t[1] + t[2]) - s.size();
    if(ans == 0)
      s += t[2];
    else if(ans == 1)
      s += t[0];
    else
      s += t[1];
  }
  if(press(s + t[0] + s + t[1]) - s.size()) {
    if(press(s + t[0]) - s.size())
      s += t[0];
    else
      s += t[1];
  } else
    s += t[2];
  return s;
}

/*int main() {
  ios_base :: sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  cin >> n >> s;
  string ans = guess_sequence(n);
  if(ans == s)
    cout << "Accepted!";
  else
    cout << "Wrong answer, output = " << ans;
  return 0;
}
*/

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Correct	1 ms	200 KB	Output is correct
4	Correct	1 ms	200 KB	Output is correct
5	Correct	0 ms	200 KB	Output is correct
6	Correct	0 ms	200 KB	Output is correct
7	Correct	1 ms	200 KB	Output is correct
8	Correct	0 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	0 ms	200 KB	Output is correct
12	Correct	1 ms	200 KB	Output is correct
13	Correct	1 ms	200 KB	Output is correct
14	Correct	1 ms	200 KB	Output is correct
15	Correct	1 ms	200 KB	Output is correct
16	Correct	1 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	260 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	0 ms	200 KB	Output is correct
26	Correct	0 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	0 ms	200 KB	Output is correct
33	Correct	0 ms	200 KB	Output is correct
34	Correct	0 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

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