Submission #1075917

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075917		anton	Cop and Robber (BOI14_coprobber)	C++17	0 / 100	1 ms	600 KiB

coprobber

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

using namespace std;

#define pii pair<int, int>
#define P complex<int>
vector<vector<int>> adj;
bool B[MAX_N][MAX_N];
int N;

int W =0;
P cop_pos= {0, 0};
P prev_pos = {-1, -1};
int start(int _N, bool A[MAX_N][MAX_N])
{
    N= _N;
    adj.resize(N);
    for(int i = 0; i<MAX_N; i++){
        for(int j = 0; j<MAX_N; j++){
            B[i][j] = A[i][j];
            if(B[i][j]){
                adj[i].push_back(j);
            }
        }
    }

    for(int i = N-1; i>0; i--){
        if(adj[i].size() == 2){
            W = i+1;
        }
    }
    return -1;
}

int nextMove(int R)
{
    
}

Compilation message (stderr)

coprobber.cpp: In function 'int nextMove(int)':
coprobber.cpp:39:1: warning: no return statement in function returning non-void [-Wreturn-type]
   39 | }
      | ^

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