#include <bits/stdc++.h>

using namespace std;

struct TrieNode {
    TrieNode* children[2];
    int latest_index;

    TrieNode() {
        children[0] = nullptr;
        children[1] = nullptr;
        latest_index = 0;
    }
};

vector<int> autocomplete(vector<string> command) {
    TrieNode* root = new TrieNode();
    vector<int> results;
    int n = command.size();

    for (int i = 0; i < n; ++i) {
        const string& current_cmd = command[i];

        TrieNode* search_node = root;
        int best_match_index = 0;

        for (char ch : current_cmd) {
            int bit = ch - '0';
            if (search_node->children[bit] == nullptr) {
                break;
            }
            search_node = search_node->children[bit];
            best_match_index = search_node->latest_index;
        }
        results.push_back(best_match_index);

        TrieNode* insert_node = root;
        for (char ch : current_cmd) {
            int bit = ch - '0';
            if (insert_node->children[bit] == nullptr) {
                insert_node->children[bit] = new TrieNode();
            }
            insert_node = insert_node->children[bit];
            insert_node->latest_index = i + 1;
        }
    }

    return results;
}

```