Submission #1204004

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204004		12345678	경찰관과 강도 (BOI14_coprobber)	C++17	0 / 100	171 ms	327680 KiB

coprobber

#include "coprobber.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=505;

int in[nx], out[nx], pa[nx], t, cur;
vector<int> d[nx];

void dfs(int u, int p)
{
    pa[u]=p;
    in[u]=++t;
    for (auto v:d[u]) if (v!=p) dfs(v, u);
    out[u]=t;
}

int start(int N, bool A[MAX_N][MAX_N])
{
    for (int i=0; i<N; i++) for (int j=0; j<N; j++) if (A[i][j]) d[i].push_back(j), d[j].push_back(i);
    dfs(0, 0);
    return 0;
}

int nextMove(int R)
{
    for (auto v:d[cur]) if (v!=pa[cur]&&in[v]<=in[R]&&out[R]<=out[v]) return v;
    return 0;
}

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