プログラマランキング

質問する

コード#コード#

#include <string>
#include <vector>

using namespace std;

int solution(int n, vector<vector<int>> results) {
    int answer = 0;
    vector<vector<int>> graph(n , vector<int>(n ,4));
    for (int i = 0; i < n; i++)
        graph[i][i] = 0;

    for (auto i : results){
        graph[i[0]-1][i[1]-1] = 1;
        graph[i[1]-1][i[0]-1] = -1;
    }

    for (int k = 0; k < n; k++){
        for (int i = 0; i < n; i++){
            for (int j = 0; j < n; j++) {
                if (graph[i][j] == 4 && graph[i][k] + graph[k][j] == 2){      
                    graph[i][j] = 1;
                    graph[j][i] = -1;
                }
            }
        }
    }

    for (int i = 0; i < n; i++){
        bool t = true;
        for (int j = 0; j < n; j++){
            if (graph[i][j] == 4){
                t = false;
                break;
            }
        }
        if (t)
            answer++;
    }
    
    return answer;
}

に答える

if (graph[i][j] == 4 && graph[i][k] + graph[k][j] == 2){      
                    graph[i][j] = 1;
                    graph[j][i] = -1;
                }