oj.uz

답안 #978005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978005 2024-05-08T16:02:34 Z canadavid1 콤보 (IOI18_combo) C++17
100 / 100
 15 ms 2028 KB 
#include "combo.h"

#include <random>
#include <algorithm>
#include <utility>
#include <iostream>
#include <vector>
int press2(std::string s)
{
    // std::cout << s << std::endl;
    return press(s);
}
std::string guess_sequence(int N) {
    std::mt19937 rng(12345);
    std::string S;
    if(press2("AB")) if(press2("A")) S = "A";
                    else S = "B";
    else            if(press2("X")) S = "X";
                    else S = "Y";
    
    std::vector<char> o;
    for(char i : "ABXY") if (S[0]!=i) o.push_back(i);
    std::vector<char> o2 = o;
    if(false) for(;S.size()*6+14<=4*N;)
    {
        //std::shuffle(o.begin(),o.end(),rng);
        //std::shuffle(o2.begin(),o2.end(),rng);
        //std::cerr << o << " " << o2 << "\n";
        std::string guess =   S + o[0] 
                            + S + o[1] + o2[0] + S + o[1] + o2[1] 
                            + S + o[1] + o2[2] + o[0]
                            + S + o[1] + o2[2] + o[1]
                            + S + o[1] + o2[2] + o[2];
        switch(press2(guess)-S.size())
        {
            case 0:S.push_back(o[2]);break;
            case 1:S.push_back(o[0]);break;
            case 2:S.push_back(o[1]);break;
            case 3:
                S.push_back(o[1]);
                S.push_back(o2[2]);
                break;
            default:
                break;
        }
    }
    for(;S.size()<N-1;)
    {
        std::string guess =   S + o[0] 
                            + S + o[1] + o2[0] + S + o[1] + o2[1] + S + o[1] + o2[2];
        switch(press2(guess)-S.size())
        {
            case 0:S.push_back(o[2]);break;
            case 1:S.push_back(o[0]);break;
            case 2:S.push_back(o[1]);break;
            default:
                break;
        }
    }
    if(N==1) return S;
    if(press2(S+o[0])==N) S.push_back(o[0]);
    else if (press2(S+o[1])==N) S.push_back(o[1]);
    else S.push_back(o[2]);
    return S;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:24:33: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |     if(false) for(;S.size()*6+14<=4*N;)
      |                    ~~~~~~~~~~~~~^~~~~
combo.cpp:47:18: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |     for(;S.size()<N-1;)
      |          ~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 356 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 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 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 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 596 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct

Subtask #2
95.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 0 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 0 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 12 ms 1496 KB Output is correct
18 Correct 11 ms 2028 KB Output is correct
19 Correct 11 ms 1404 KB Output is correct
20 Correct 11 ms 1716 KB Output is correct
21 Correct 13 ms 1388 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 436 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 444 KB Output is correct
26 Correct 1 ms 452 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 1 ms 448 KB Output is correct
29 Correct 1 ms 444 KB Output is correct
30 Correct 1 ms 696 KB Output is correct
31 Correct 1 ms 952 KB Output is correct
32 Correct 11 ms 1640 KB Output is correct
33 Correct 12 ms 1424 KB Output is correct
34 Correct 10 ms 1136 KB Output is correct
35 Correct 10 ms 1196 KB Output is correct
36 Correct 13 ms 1508 KB Output is correct
37 Correct 11 ms 1408 KB Output is correct
38 Correct 13 ms 1588 KB Output is correct
39 Correct 13 ms 1780 KB Output is correct
40 Correct 15 ms 1968 KB Output is correct
41 Correct 11 ms 1112 KB Output is correct
42 Correct 12 ms 1680 KB Output is correct
43 Correct 11 ms 1228 KB Output is correct
44 Correct 11 ms 1192 KB Output is correct
45 Correct 12 ms 1748 KB Output is correct
46 Correct 11 ms 1404 KB Output is correct
47 Correct 13 ms 1688 KB Output is correct
48 Correct 12 ms 1604 KB Output is correct
49 Correct 12 ms 1252 KB Output is correct
50 Correct 10 ms 1288 KB Output is correct
51 Correct 12 ms 1508 KB Output is correct
52 Correct 12 ms 1460 KB Output is correct
53 Correct 11 ms 1376 KB Output is correct
54 Correct 11 ms 1620 KB Output is correct
55 Correct 10 ms 1116 KB Output is correct
56 Correct 11 ms 1372 KB Output is correct
57 Correct 11 ms 1448 KB Output is correct
58 Correct 10 ms 1928 KB Output is correct
59 Correct 12 ms 1332 KB Output is correct
60 Correct 13 ms 1408 KB Output is correct
61 Correct 12 ms 1472 KB Output is correct
62 Correct 10 ms 920 KB Output is correct
63 Correct 10 ms 1248 KB Output is correct
64 Correct 11 ms 1220 KB Output is correct
65 Correct 13 ms 1596 KB Output is correct
66 Correct 11 ms 1720 KB Output is correct
67 Correct 12 ms 1600 KB Output is correct
68 Correct 10 ms 1220 KB Output is correct
69 Correct 12 ms 1400 KB Output is correct
70 Correct 11 ms 1504 KB Output is correct
71 Correct 12 ms 1416 KB Output is correct
72 Correct 11 ms 1480 KB Output is correct
73 Correct 10 ms 992 KB Output is correct
74 Correct 11 ms 1396 KB Output is correct
75 Correct 11 ms 1588 KB Output is correct
76 Correct 11 ms 976 KB Output is correct
77 Correct 12 ms 1164 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 340 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 0 ms 436 KB Output is correct
84 Correct 1 ms 436 KB Output is correct
85 Correct 1 ms 436 KB Output is correct
86 Correct 0 ms 436 KB Output is correct
87 Correct 0 ms 440 KB Output is correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 436 KB Output is correct
94 Correct 0 ms 436 KB Output is correct
95 Correct 0 ms 432 KB Output is correct
96 Correct 0 ms 436 KB Output is correct
97 Correct 1 ms 692 KB Output is correct
98 Correct 1 ms 436 KB Output is correct
99 Correct 1 ms 436 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 1 ms 596 KB Output is correct
102 Correct 0 ms 432 KB Output is correct
103 Correct 1 ms 440 KB Output is correct
104 Correct 1 ms 432 KB Output is correct
105 Correct 0 ms 436 KB Output is correct
106 Correct 1 ms 432 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 1 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 0 ms 440 KB Output is correct
118 Correct 0 ms 436 KB Output is correct
119 Correct 1 ms 432 KB Output is correct
120 Correct 1 ms 440 KB Output is correct
121 Correct 0 ms 436 KB Output is correct
122 Correct 0 ms 436 KB Output is correct
123 Correct 1 ms 432 KB Output is correct