// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
edi
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "coprobber.h"
int n;
int u;
int dp[MAX_N][MAX_N][2];
bool a[MAX_N][MAX_N];
int start(int n_, bool a_[MAX_N][MAX_N])
{
n = n_;
rep(i,MAX_N){
rep(j,MAX_N){
a[i][j] = a_[i][j];
}
}
memset(dp,-1,sizeof dp);
rep(i,n){
dp[i][i][0] = 1;
dp[i][i][1] = 1;
}
rep(times,5*n){
rep(i,n){
rep(j,n){
rep(t,2){
if(dp[i][j][t] != -1) conts;
// cout << i << " " << j << " " << t << endl;
if(t == 0){
// cop
int unvis = 0;
rep(k,n){
if(a[i][k] or i == k){
if(dp[k][j][t^1] == 1){
dp[i][j][t] = 1;
}
else if(dp[k][j][t^1] == -1){
unvis++;
}
}
}
if(dp[i][j][t] != 1 and unvis == 0){
dp[i][j][t] = 0;
}
}
else{
// robber
int unvis = 0;
rep(k,n){
if(a[j][k]){
if(dp[i][k][t^1] == 0){
dp[i][j][t] = 0;
}
else if(dp[i][k][t^1] == -1){
unvis++;
}
}
}
if(dp[i][j][t] != 0 and unvis == 0){
dp[i][j][t] = 1;
}
}
}
}
}
}
int u = -1;
rep(i,n){
int bad = 0;
rep(j,n){
if(dp[i][j][0] != 1){
bad++;
}
}
if(!bad){
u = i;
break;
}
}
return u;
}
int nextMove(int v)
{
rep(k,n){
if((a[u][k] or u == k) and dp[k][v][0] == 1){
u = k;
break;
}
}
return u;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2512 KB |
Output is correct |
2 |
Correct |
1 ms |
2512 KB |
Output is correct |
3 |
Incorrect |
1 ms |
2512 KB |
the situation repeated |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
2512 KB |
the situation repeated |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2512 KB |
Output is correct |
2 |
Correct |
1 ms |
2512 KB |
Output is correct |
3 |
Incorrect |
1 ms |
2512 KB |
the situation repeated |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2512 KB |
Output is correct |
2 |
Correct |
1 ms |
2512 KB |
Output is correct |
3 |
Incorrect |
1 ms |
2512 KB |
the situation repeated |
4 |
Halted |
0 ms |
0 KB |
- |