답안 #83812 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83812	2018-11-10T22:06:04 Z	AdrienVannson	콤보 (IOI18_combo)	C++17	94 / 100	88 ms	928 KB

combo

#include <bits/stdc++.h>

#include "combo.h"

using namespace std;

const int NB_MAX_CARACTERES = 2000;

string res = "";
vector<char> possibles[NB_MAX_CARACTERES];


string guess_sequence (int nbCaracteres)
{
    srand(42);

    if (press("AB") > 0) {
        res += press("A") ? 'A' : 'B';
    }
    else {
        res += press("X") ? 'X' : 'Y';
    }

    if (nbCaracteres == 1) {
        return res;
    }

    possibles[0].push_back(res[0]);

    for (int iCaractere=1; iCaractere<nbCaracteres; iCaractere++) {
        for (char c : "ABXY") {
            if (c != res[0] && c != 0) {
                possibles[iCaractere].push_back(c);
            }
        }
    }

    while ((int)res.size() < nbCaracteres) {
        /*static int iter = 0;
        if (iter++ > 20) break;*/


        vector<string> mots;
        mots.push_back(res);

        while ((int)mots[0].size() < nbCaracteres) {
            const int iCaractere = mots[0].size();

            random_shuffle(possibles[iCaractere].begin(), possibles[iCaractere].end());


            vector<string> nouveauxMots;

            for (const string &mot : mots) {
                nouveauxMots.push_back(mot + possibles[iCaractere][0]);

                if (possibles[iCaractere].size() == 3) {
                    nouveauxMots.push_back(mot + possibles[iCaractere][1]);
                }
            }

            if ((int)nouveauxMots[0].size() * (int)nouveauxMots.size() <= 4*nbCaracteres) {
                mots = nouveauxMots;
            }
            else {
                break;
            }
        }

        /*cerr << "-----------------------" << endl;
        for (int i=0; i<nbCaracteres; i++) {
            cerr << "(";
            for (char p : possibles[i]) {
                cerr << p << " ";
            }
            cerr << ") ";
        }
        cerr << endl;*/

        string requete;
        for (string mot : mots) {
            requete += mot;
        }

        const int reponse = press(requete);
        //cerr << requete << " --> " << reponse << endl;

        // Caractères valides
        bool estValide = true;

        for (int iCaractere=res.size(); iCaractere<reponse; iCaractere++) {
            if (possibles[iCaractere].size() >= 2) {
                possibles[iCaractere].pop_back();
            }

            if (possibles[iCaractere].size() == 1 && estValide) {
                res += possibles[iCaractere][0];
            }
            else {
                estValide = false;
            }
        }

        // Dernier caractère, si il est invalide
        if (reponse < nbCaracteres && (int)mots[0].size() > reponse) {
            while (possibles[reponse].size() > 1) {
                possibles[reponse].erase(possibles[reponse].begin());
            }
        }
    }

    return res;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	2 ms	328 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	2 ms	328 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	1 ms	328 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	328 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	1 ms	328 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	328 KB	Output is correct
23	Correct	1 ms	328 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	328 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	1 ms	328 KB	Output is correct
28	Correct	1 ms	328 KB	Output is correct
29	Correct	2 ms	328 KB	Output is correct
30	Correct	1 ms	328 KB	Output is correct
31	Correct	2 ms	328 KB	Output is correct
32	Correct	1 ms	328 KB	Output is correct
33	Correct	1 ms	328 KB	Output is correct
34	Correct	1 ms	328 KB	Output is correct
35	Correct	1 ms	328 KB	Output is correct
36	Correct	1 ms	328 KB	Output is correct

Subtask #2
89.0 / 95.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Partially correct	2 ms	248 KB	Output is partially correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Partially correct	1 ms	328 KB	Output is partially correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Partially correct	1 ms	328 KB	Output is partially correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	2 ms	328 KB	Output is correct
14	Partially correct	1 ms	328 KB	Output is partially correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	1 ms	328 KB	Output is correct
17	Correct	65 ms	744 KB	Output is correct
18	Correct	64 ms	744 KB	Output is correct
19	Correct	58 ms	704 KB	Output is correct
20	Correct	62 ms	712 KB	Output is correct
21	Correct	66 ms	784 KB	Output is correct
22	Correct	2 ms	328 KB	Output is correct
23	Correct	2 ms	328 KB	Output is correct
24	Correct	2 ms	328 KB	Output is correct
25	Correct	2 ms	328 KB	Output is correct
26	Correct	3 ms	328 KB	Output is correct
27	Correct	4 ms	328 KB	Output is correct
28	Correct	4 ms	328 KB	Output is correct
29	Correct	4 ms	328 KB	Output is correct
30	Correct	4 ms	328 KB	Output is correct
31	Correct	4 ms	400 KB	Output is correct
32	Correct	49 ms	708 KB	Output is correct
33	Correct	75 ms	728 KB	Output is correct
34	Correct	57 ms	764 KB	Output is correct
35	Correct	56 ms	732 KB	Output is correct
36	Correct	56 ms	700 KB	Output is correct
37	Correct	70 ms	772 KB	Output is correct
38	Correct	58 ms	736 KB	Output is correct
39	Correct	65 ms	848 KB	Output is correct
40	Correct	71 ms	712 KB	Output is correct
41	Correct	53 ms	704 KB	Output is correct
42	Correct	70 ms	792 KB	Output is correct
43	Correct	67 ms	788 KB	Output is correct
44	Correct	54 ms	788 KB	Output is correct
45	Correct	53 ms	756 KB	Output is correct
46	Correct	46 ms	704 KB	Output is correct
47	Correct	71 ms	780 KB	Output is correct
48	Correct	64 ms	708 KB	Output is correct
49	Correct	70 ms	820 KB	Output is correct
50	Correct	70 ms	692 KB	Output is correct
51	Correct	72 ms	812 KB	Output is correct
52	Correct	73 ms	748 KB	Output is correct
53	Correct	66 ms	748 KB	Output is correct
54	Correct	76 ms	852 KB	Output is correct
55	Correct	75 ms	772 KB	Output is correct
56	Correct	67 ms	792 KB	Output is correct
57	Correct	71 ms	804 KB	Output is correct
58	Correct	57 ms	820 KB	Output is correct
59	Correct	64 ms	784 KB	Output is correct
60	Correct	49 ms	928 KB	Output is correct
61	Correct	68 ms	828 KB	Output is correct
62	Correct	69 ms	808 KB	Output is correct
63	Correct	61 ms	800 KB	Output is correct
64	Correct	79 ms	752 KB	Output is correct
65	Correct	85 ms	820 KB	Output is correct
66	Correct	76 ms	820 KB	Output is correct
67	Correct	78 ms	704 KB	Output is correct
68	Correct	70 ms	712 KB	Output is correct
69	Correct	88 ms	716 KB	Output is correct
70	Correct	59 ms	720 KB	Output is correct
71	Correct	67 ms	864 KB	Output is correct
72	Correct	87 ms	820 KB	Output is correct
73	Correct	69 ms	736 KB	Output is correct
74	Correct	74 ms	832 KB	Output is correct
75	Correct	59 ms	764 KB	Output is correct
76	Correct	73 ms	776 KB	Output is correct
77	Correct	61 ms	700 KB	Output is correct
78	Partially correct	1 ms	328 KB	Output is partially correct
79	Correct	2 ms	328 KB	Output is correct
80	Partially correct	2 ms	444 KB	Output is partially correct
81	Correct	1 ms	328 KB	Output is correct
82	Partially correct	2 ms	328 KB	Output is partially correct
83	Partially correct	2 ms	344 KB	Output is partially correct
84	Correct	2 ms	340 KB	Output is correct
85	Correct	2 ms	328 KB	Output is correct
86	Correct	2 ms	328 KB	Output is correct
87	Correct	2 ms	328 KB	Output is correct
88	Correct	2 ms	328 KB	Output is correct
89	Partially correct	1 ms	328 KB	Output is partially correct
90	Correct	1 ms	328 KB	Output is correct
91	Correct	1 ms	264 KB	Output is correct
92	Correct	2 ms	328 KB	Output is correct
93	Correct	1 ms	340 KB	Output is correct
94	Correct	2 ms	328 KB	Output is correct
95	Partially correct	2 ms	328 KB	Output is partially correct
96	Correct	2 ms	344 KB	Output is correct
97	Correct	2 ms	328 KB	Output is correct
98	Correct	3 ms	328 KB	Output is correct
99	Correct	2 ms	340 KB	Output is correct
100	Correct	2 ms	328 KB	Output is correct
101	Correct	2 ms	328 KB	Output is correct
102	Correct	2 ms	328 KB	Output is correct
103	Correct	3 ms	328 KB	Output is correct
104	Correct	2 ms	328 KB	Output is correct
105	Correct	2 ms	328 KB	Output is correct
106	Correct	2 ms	328 KB	Output is correct
107	Correct	2 ms	328 KB	Output is correct
108	Correct	1 ms	340 KB	Output is correct
109	Correct	1 ms	328 KB	Output is correct
110	Correct	2 ms	260 KB	Output is correct
111	Correct	1 ms	328 KB	Output is correct
112	Correct	1 ms	328 KB	Output is correct
113	Correct	1 ms	328 KB	Output is correct
114	Partially correct	1 ms	328 KB	Output is partially correct
115	Correct	2 ms	328 KB	Output is correct
116	Correct	2 ms	328 KB	Output is correct
117	Correct	2 ms	328 KB	Output is correct
118	Correct	2 ms	340 KB	Output is correct
119	Correct	2 ms	328 KB	Output is correct
120	Correct	1 ms	328 KB	Output is correct
121	Correct	2 ms	328 KB	Output is correct
122	Correct	2 ms	328 KB	Output is correct
123	Correct	2 ms	328 KB	Output is correct

답안 #83812

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 89.0 / 95.0

Subtask #1
5.0 / 5.0

Subtask #2
89.0 / 95.0