제출 #1155448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1155448		Ludissey	경찰관과 강도 (BOI14_coprobber)	C++20	60 / 100	580 ms	327680 KiB

coprobber

#include "coprobber.h"
#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
using namespace std;

vector<vector<int>> neigh;
vector<vector<vector<int>>> visited;
vector<vector<int>> nxt;
int pos=0;

int dfs(int p, int b, bool t){
    if(p==b) return 2;
    if(visited[p][b][t]>0) return visited[p][b][t];
    visited[p][b][t]=1;
    if(t){
        int mx=0;
        int mxI=0;
        for (auto np : neigh[p])
        {
            int d=dfs(np, b, false);
            if(d>mx) {mx=d; mxI=np; }
        }
        int d=dfs(p, b, false);
        if(d>mx) {mx=d; mxI=p; }

        nxt[p][b]=mxI;
        return visited[p][b][t]=mx;
    }else{
        int mn=2;
        for (auto nb : neigh[b])
        {
            int d=dfs(p, nb, true);
            if(d<mn) {mn=d; }
        }
        return visited[p][b][t]=mn;
    }

}

int start(int N, bool A[MAX_N][MAX_N])
{
    visited.resize(N,vector<vector<int>>(N,vector<int>(2,0)));
    neigh.resize(N);
    nxt.resize(N,vector<int>(N,0));
    for (int i = 0; i < N; i++)
    {
        for (int j = i+1; j < N; j++)
        {
            if(A[i][j]) { neigh[i].push_back(j); neigh[j].push_back(i); }
        }
    }
    queue<pair<pair<int,int>,bool>> queue;
    vector<vector<int>> cnt(N,vector<int>(N,0));
    for (int i = 0; i < N; i++) {
        queue.push({{i,i},true});
        queue.push({{i,i},false});
    }
    while(!queue.empty()){
        int p=queue.front().first.first;
        int b=queue.front().first.second;
        int t=queue.front().second;
        queue.pop();
        if(visited[p][b][t]) continue;
        visited[p][b][t]=1;
        if(!t){
            for (auto u : neigh[b])
            {
                cnt[p][u]++;
                if(cnt[p][u]==sz(neigh[u])) {
                    queue.push({{p,u},true});
                }
            }
        }else{
            for (auto u : neigh[p])
            {
                if(!visited[u][b][false]) nxt[u][b]=p;
                queue.push({{u,b},false});
            }
            if(!visited[p][b][false]) nxt[p][b]=p;
            queue.push({{p,b},false});
        }
    }
    for (int i = 0; i < N; i++)
    {
        bool b=true;
        for (int j = 0; j < N; j++)
        {
            if(!visited[i][j][1]) b=false;
        }
        if(b){
            pos=i;
            return i;
        }
    }
    return -1;
}

int nextMove(int R)
{
    return pos=nxt[pos][R];
}

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