Submission #204450

#TimeUsernameProblemLanguageResultExecution timeMemory
204450bogdan_ogorodniy콤보 (IOI18_combo)C++14
5 / 100
168 ms464 KiB
#include <bits/stdc++.h>
#include "combo.h"
using namespace std;
// string need;
// int press(string p) {
//     string s = need + "#" + p;
//     int n = (int) s.length();
//     vector<int> pi (n);
//     for (int i = 1; i < n; ++i) {
//         int j = pi[i - 1];
//         while (j > 0 && s[i] != s[j])
//             j = pi[j - 1];
//         if (s[i] == s[j]) ++j;
//         pi[i] = j;
//     }
//     int ans = 0;
//     for (int i = need.size(); i < s.size(); i++) {
//         ans = max(ans, pi[i]);
//     }  
//     cout << s << '\t' << ans << '\n';
//     return ans;
// }

string make_to(string s, int n) {
    for (int i = s.size(); i <= n; i++) {
        s.push_back(s[0]);
    }
    return s;
}

vector <char> ch = {'A', 'B', 'X', 'Y'};

string guess_sequence(int n) {
    string ans;
    for (int i = 0; i < n; i++) {
        int best = 0;
        string nans;
        for (auto it : ch) {
            string tmp = ans;
            tmp.push_back(it);
            int resp = press(make_to(tmp, n + 2));
            if (resp > best) {
                best = resp;
                nans = tmp;
            }
        }
        ans = nans;
    }
    return ans;
}

// signed main() {
//     cin >> need;
//     cout << guess_sequence(need.size());


//     return 0;
// } 
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...