oj.uz

Submission #339597

# Submission time Handle Problem Language Result Execution time Memory
339597 2020-12-25T16:56:46 Z ogibogi2004 Combo (IOI18_combo) C++14
5 / 100
 2 ms 256 KB 
#include "combo.h"
#include<bits/stdc++.h>
using namespace std;
string guess_sequence(int N) {
  /*string p = "";
  for (int i = 0; i < 4 * N; ++i) {
    p += 'A';
  }
  int coins = press(p);
  string S = "";
  for (int i = 0; i < N; ++i) {
    S += 'A';
  }
  return S;*/
  string p="";
  string s="";
  vector<char>v;
  p="AB";
  int xd=press(p);
  if(xd==0)
  {
	  xd=press("X");
	  if(xd==0)s+="Y";
	  else s+="X";
  }
  else
  {
	  xd=press("A");
	  if(xd==0)s+="B";
	  else s+="A";
  }
  if(s[0]!='A')v.push_back('A');
  if(s[0]!='X')v.push_back('X');
  if(s[0]!='Y')v.push_back('Y');
  if(s[0]!='B')v.push_back('B');
  for(int i=1;i+1<N;i++)
  {
	  p="";
	  p+=s;p+=v[0];
	  p+=s;p+=v[1];p+=v[0];
	  p+=s;p+=v[1];p+=v[1];
	  p+=s;p+=v[1];p+=v[2];
	  xd=press(p);
	  if(xd==s.size())
	  {
		  s+=v[2];
	  }
	  else if(xd==s.size()+1)
	  {
		  s+=v[0];
	  }
	  else
	  {
		  s+=v[1];
	  }
  }
  p=s;
  p+=v[0];
  xd=press(p);
  if(xd==N)return p;
  p=s;
  p+=v[1];
  xd=press(p);
  if(xd==N)return p;
  p=s;
  p+=v[2];
  return p;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:44:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |    if(xd==s.size())
      |       ~~^~~~~~~~~~
combo.cpp:48:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |    else if(xd==s.size()+1)
      |            ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 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 1 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 0 ms 200 KB Output is correct
9 Correct 1 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 2 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 1 ms 220 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 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 0 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 0 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 0 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 1 ms 256 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 -