oj.uz

Submission #316809

# Submission time Handle Problem Language Result Execution time Memory
316809 2020-10-28T05:28:10 Z seedkin Combo (IOI18_combo) C++11
100 / 100
 43 ms 624 KB 
#include "combo.h"

std::string guess_sequence(int N) {
  char map[200][3];
  map['A'][0] = 'B';
  map['A'][1] = 'X';
  map['A'][2] = 'Y';

  map['X'][0] = 'A';
  map['X'][1] = 'B';
  map['X'][2] = 'Y';

  map['B'][0] = 'A';
  map['B'][1] = 'X';
  map['B'][2] = 'Y';

  map['Y'][0] = 'A';
  map['Y'][1] = 'X';
  map['Y'][2] = 'B';

  std::string p = "";
  int coins;
  std::string S = "";
  char first;
  if(N == 1) {

    p = 'A';
    coins = press(p);
    if(coins) return p;
    p = 'B';
    coins = press(p);
    if(coins) return p;
    p = 'X';
    coins = press(p);
    if(coins) return p;
    p = 'Y';
    return p;

  } else if (N == 2) {

    p = "AB";
    coins = press(p);
    if(coins == 2) {
      S = "AB";
      return S;
    } else if (coins == 1) {
      p = "A";
      coins = press(p);
      if(coins) {
        S="A";
        first = 'A';
      } else {
        S="B";
        first = 'B';
      }
    } else {
      p = "X";
      coins = press(p);
      if(coins) {
        S="X";
        first = 'X';
      } else {
        S="Y";
        first = 'Y';
      }
    }

    p = S + 'A' + S + 'B';
    coins = press(p);
    if(coins == 2) {
      p = S +'A';
      coins = press(p);
      if(coins == 2) {
        S += 'A';
      } else {
        S += 'B';
      }
    } else if (coins == 1) {
      p = S+'X';
      coins = press(p);
      if(coins == 2) {
        S += 'X';
      } else {
        S += 'Y';
      }
    }

    return S;

  } else {

    p = "AB";
    coins = press(p);
    if (coins >= 1) {
      p = "A";
      coins = press(p);
      if(coins) {
        S="A";
        first = 'A';
      } else {
        S="B";
        first = 'B';
      }
    } else {
      p = "X";
      coins = press(p);
      if(coins) {
        S="X";
        first = 'X';
      } else {
        S="Y";
        first = 'Y';
      }
    }

    int len = 1;
    // printf("first: %c\n",first);
    for(; len < N-1; len++) {
      p = S + map[first][0];
      p += S + map[first][1] + map[first][0];
      p += S + map[first][1] + map[first][1];
      p += S + map[first][1] + map[first][2];

      coins = press(p);

      if(coins == len) {
        S += map[first][2];
      } else if (coins == len+1) {
        S += map[first][0];
      } else {
        S += map[first][1];
      }
    }

    p = S + 'A' + S + 'B';
    coins = press(p);
    if(coins == N) {
      p = S +'A';
      coins = press(p);
      if(coins == N) {
        S += 'A';
      } else {
        S += 'B';
      }
    } else if (coins == N-1) {
      p = S+'X';
      coins = press(p);
      if(coins == N) {
        S += 'X';
      } else {
        S += 'Y';
      }
    }

    return S;

  }
  
  return S;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:119:19: warning: array subscript has type 'char' [-Wchar-subscripts]
  119 |       p = S + map[first][0];
      |                   ^~~~~
combo.cpp:120:20: warning: array subscript has type 'char' [-Wchar-subscripts]
  120 |       p += S + map[first][1] + map[first][0];
      |                    ^~~~~
combo.cpp:120:36: warning: array subscript has type 'char' [-Wchar-subscripts]
  120 |       p += S + map[first][1] + map[first][0];
      |                                    ^~~~~
combo.cpp:121:20: warning: array subscript has type 'char' [-Wchar-subscripts]
  121 |       p += S + map[first][1] + map[first][1];
      |                    ^~~~~
combo.cpp:121:36: warning: array subscript has type 'char' [-Wchar-subscripts]
  121 |       p += S + map[first][1] + map[first][1];
      |                                    ^~~~~
combo.cpp:122:20: warning: array subscript has type 'char' [-Wchar-subscripts]
  122 |       p += S + map[first][1] + map[first][2];
      |                    ^~~~~
combo.cpp:122:36: warning: array subscript has type 'char' [-Wchar-subscripts]
  122 |       p += S + map[first][1] + map[first][2];
      |                                    ^~~~~
combo.cpp:127:18: warning: array subscript has type 'char' [-Wchar-subscripts]
  127 |         S += map[first][2];
      |                  ^~~~~
combo.cpp:129:18: warning: array subscript has type 'char' [-Wchar-subscripts]
  129 |         S += map[first][0];
      |                  ^~~~~
combo.cpp:131:18: warning: array subscript has type 'char' [-Wchar-subscripts]
  131 |         S += map[first][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 0 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 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 0 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 0 ms 200 KB Output is correct
14 Correct 0 ms 200 KB Output is correct
15 Correct 0 ms 200 KB Output is correct
16 Correct 1 ms 200 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 2 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 2 ms 200 KB Output is correct
25 Correct 2 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 0 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 1 ms 200 KB Output is correct
34 Correct 2 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
95.0 / 95.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 1 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 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 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 38 ms 468 KB Output is correct
18 Correct 36 ms 536 KB Output is correct
19 Correct 26 ms 372 KB Output is correct
20 Correct 28 ms 588 KB Output is correct
21 Correct 31 ms 368 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 2 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 2 ms 200 KB Output is correct
31 Correct 3 ms 200 KB Output is correct
32 Correct 35 ms 468 KB Output is correct
33 Correct 43 ms 548 KB Output is correct
34 Correct 33 ms 624 KB Output is correct
35 Correct 31 ms 376 KB Output is correct
36 Correct 30 ms 508 KB Output is correct
37 Correct 28 ms 440 KB Output is correct
38 Correct 28 ms 532 KB Output is correct
39 Correct 34 ms 484 KB Output is correct
40 Correct 41 ms 496 KB Output is correct
41 Correct 27 ms 588 KB Output is correct
42 Correct 29 ms 452 KB Output is correct
43 Correct 33 ms 596 KB Output is correct
44 Correct 41 ms 488 KB Output is correct
45 Correct 24 ms 476 KB Output is correct
46 Correct 37 ms 516 KB Output is correct
47 Correct 23 ms 600 KB Output is correct
48 Correct 23 ms 460 KB Output is correct
49 Correct 33 ms 480 KB Output is correct
50 Correct 31 ms 448 KB Output is correct
51 Correct 25 ms 404 KB Output is correct
52 Correct 37 ms 472 KB Output is correct
53 Correct 32 ms 476 KB Output is correct
54 Correct 35 ms 468 KB Output is correct
55 Correct 31 ms 364 KB Output is correct
56 Correct 31 ms 424 KB Output is correct
57 Correct 38 ms 484 KB Output is correct
58 Correct 30 ms 372 KB Output is correct
59 Correct 33 ms 432 KB Output is correct
60 Correct 29 ms 440 KB Output is correct
61 Correct 32 ms 460 KB Output is correct
62 Correct 38 ms 404 KB Output is correct
63 Correct 32 ms 408 KB Output is correct
64 Correct 18 ms 364 KB Output is correct
65 Correct 26 ms 468 KB Output is correct
66 Correct 28 ms 468 KB Output is correct
67 Correct 23 ms 424 KB Output is correct
68 Correct 36 ms 464 KB Output is correct
69 Correct 34 ms 476 KB Output is correct
70 Correct 36 ms 560 KB Output is correct
71 Correct 20 ms 368 KB Output is correct
72 Correct 35 ms 552 KB Output is correct
73 Correct 32 ms 468 KB Output is correct
74 Correct 26 ms 456 KB Output is correct
75 Correct 33 ms 476 KB Output is correct
76 Correct 31 ms 520 KB Output is correct
77 Correct 31 ms 468 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 200 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 0 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct
92 Correct 1 ms 200 KB Output is correct
93 Correct 1 ms 200 KB Output is correct
94 Correct 1 ms 200 KB Output is correct
95 Correct 1 ms 200 KB Output is correct
96 Correct 1 ms 200 KB Output is correct
97 Correct 1 ms 200 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 1 ms 200 KB Output is correct
100 Correct 1 ms 276 KB Output is correct
101 Correct 1 ms 200 KB Output is correct
102 Correct 1 ms 200 KB Output is correct
103 Correct 1 ms 200 KB Output is correct
104 Correct 1 ms 200 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 1 ms 200 KB Output is correct
107 Correct 1 ms 200 KB Output is correct
108 Correct 1 ms 200 KB Output is correct
109 Correct 1 ms 200 KB Output is correct
110 Correct 0 ms 200 KB Output is correct
111 Correct 0 ms 200 KB Output is correct
112 Correct 1 ms 200 KB Output is correct
113 Correct 0 ms 200 KB Output is correct
114 Correct 0 ms 200 KB Output is correct
115 Correct 1 ms 200 KB Output is correct
116 Correct 1 ms 200 KB Output is correct
117 Correct 1 ms 200 KB Output is correct
118 Correct 1 ms 200 KB Output is correct
119 Correct 1 ms 200 KB Output is correct
120 Correct 1 ms 200 KB Output is correct
121 Correct 1 ms 200 KB Output is correct
122 Correct 1 ms 200 KB Output is correct
123 Correct 2 ms 276 KB Output is correct