# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076315 | anton | Cop and Robber (BOI14_coprobber) | C++17 | 42 ms | 4428 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 rem[MAX_N][MAX_N];
int next_pos[MAX_N][MAX_N];
bool is_vis[2][MAX_N][MAX_N];
struct Pos{
int player_id;
int cop_pos, r_pos;
Pos(){};
Pos(int _id, int _cop_pos, int _r_pos){
player_id = _id;
cop_pos = _cop_pos;
r_pos = _r_pos;
}
bool& vis(){
return is_vis[player_id][cop_pos][r_pos];
}
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |