1182.cpp

class Solution {
public:
    vector<int> shortestDistanceColor(vector<int>& colors, vector<vector<int>>& queries) {
        int n = colors.size();
        vector<vector<int>> color_dist(3, vector<int>(n, n));
        
        for (int c = 0; c < 3; ++c) {
            for (int i = 0, d = n; i < n; ++i) {
                color_dist[c][i] = min(color_dist[c][i], ++d);
                if (c == colors[i] - 1) color_dist[c][i] = d = 0;
            }
            for (int i = n - 1, d = n; i >= 0; --i) {
                color_dist[c][i] = min(color_dist[c][i], ++d);
                if (c == colors[i] - 1) color_dist[c][i] = d = 0;
            }
        }
        
        vector<int> result(queries.size());
        for (int i = 0; i < queries.size(); ++i) {
            result[i] = color_dist[queries[i][1] - 1][queries[i][0]];
            if (result[i] >= n) result[i] = -1;
        }
        
        return result;
    }
};