제출 #873582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
873582		sleepntsheep	경찰관과 강도 (BOI14_coprobber)	C++17	0 / 100	1 ms	4440 KiB

coprobber

#include "coprobber.h"
#include <tuple>
#include <array>
#include <queue>
#include <string.h>

int N, G[MAX_N][MAX_N][2], C[MAX_N][MAX_N][2], deg[MAX_N], at;
bool (*A)[MAX_N];

int start(int N, bool A[MAX_N][MAX_N])
{
    ::N = N, ::A = A;
    memset(G, -1, sizeof G);
    std::queue<std::tuple<int, int, int, int>> q;
    for (int i = 0; i < N; ++i) G[i][i][0] = G[i][i][1] = 0, q.emplace(i, i, 0, 0), q.emplace(i, i, 1, 0);
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) deg[i] += A[i][j];

    for (; q.size(); )
    {
        auto [u, v, t, g] = q.front();
        q.pop();
        if (t) /* robber, was cop */
        {
            for (auto k = 0; k < N; ++k)
            {
                if (!A[u][k]) continue;
                if (!g && G[k][v][0] == -1)
                {
                    q.emplace(k, v, 0, G[k][v][!t] = 0);
                }
                else
                {
                }
            }
        }
        else /* was robber */
        {
            for (auto k = 0; k < N; ++k)
            {
                if (!A[v][k]) continue;
                if (!g) 
                {
                    if (++C[u][k][0] == deg[k])
                    {
                        q.emplace(u, k, !t, G[u][k][!t] = 0);
                    }
                }
                else if (G[u][k][!t] == -1)
                {
                    q.emplace(u, k, !t, G[u][k][!t] = 1);
                }
            }
        }
    }

    for (int i = 0; i < N; ++i)
    {
        int losing = 0;
        for (int j = 0; j < N; ++j)
            losing += !!G[i][j][0];
        if (!losing) return at = i;
    }
    return -1;
}

int nextMove(int R)
{
    if (!G[at][R][1]) return at;
    for (int j = 0; j < N; ++j)
        if (A[at][j] && !G[j][R][1]) return j;
    return -1;
}

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