Submission #90232

#	Time	Username	Problem	Language	Result	Execution time	Memory
90232		nikolapesic2802	Cop and Robber (BOI14_coprobber)	C++14	100 / 100	493 ms	37240 KiB

coprobber

#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;
#define pb push_back
vector<vector<int> > graph(MAX_N);
int value[MAX_N][MAX_N][2],nxt[MAX_N][MAX_N],degree[MAX_N][MAX_N],pos=0;
vector<vector<int> > todo;
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])
                graph[i].pb(j);
    for(int i=0;i<N;i++)
    {
        for(int j=0;j<N;j++)
        {
            if(i==j)
            {
                todo.pb({i,j,0});
                todo.pb({i,j,1});
                value[i][j][0]=1;
                value[i][j][1]=1;
                continue;
            }
            degree[i][j]+=graph[j].size();
        }
    }
    while(todo.size())
    {
        vector<vector<int> > futuretodo;
        for(auto d:todo){
            int x=d[0],y=d[1],z=d[2];
            if(z==1)
            {
                int i=x,j=y,k=0;
                if(value[i][j][k]==0)
                {
                    value[i][j][k]=1;
                    nxt[i][j]=x;
                    futuretodo.pb({i,j,k});
                }
                for(auto p:graph[x])
                {
                    i=p;j=y;k=0;
                    if(value[i][j][k]==0)
                    {
                        value[i][j][k]=1;
                        nxt[i][j]=x;
                        futuretodo.pb({i,j,k});
                    }
                }
            }
            else
            {
                for(auto p:graph[y])
                {
                    int i=x,j=p,k=1;
                    if(value[i][j][k]==0)
                    {
                        degree[i][j]--;
                        if(degree[i][j]==0)
                        {
                            value[i][j][k]=1;
                            futuretodo.pb({i,j,k});
                        }
                    }
                }
            }
        }
        todo=futuretodo;
    }
    bool t=true;
    for(int i=1;i<N;i++)
        if(value[0][i][0]!=1)
            t=false;
    if(t){
        for(int i=0;i<N;i++)
            for(int j=0;j<N;j++)
                assert(value[i][j][0]==1&&value[i][j][1]==1);
        return 0;
    }
    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: 40 / 40