Submission #1053114

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053114		kachim2	Cop and Robber (BOI14_coprobber)	C++17	16 / 100	26 ms	1716 KiB

coprobber

#include "coprobber.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> graph;
int start(int N, bool A[MAX_N][MAX_N])
{
    graph.resize(N);
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(A[i][j]) graph[i].push_back(j);
        }
    }
    return 0;
}
int cpos = 0;
bool dfs(int r, int v, int p){
    if(v==r) return true;
    for(auto i : graph[v]){
        if(i!=p)
        if(dfs(r, i, v)) return true;
    }
    return false;
}
int nextMove(int R)
{
    for(auto i : graph[cpos]){
        if(dfs(R, i, cpos)){
            cpos = i;
            return i;
        }
    }
    return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 0 / 14
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40