oj.uz

Submission #584561

# Submission time Handle Problem Language Result Execution time Memory
584561 2022-06-27T14:45:36 Z MohammadAghil Cop and Robber (BOI14_coprobber) C++17
60 / 100
 1500 ms 4964 KB 
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;

typedef long long ll;
typedef pair<int, int> pp;

#define rep(i,l,r) for(int i = (l); i < (r); i++)
#define per(i,r,l) for(int i = (r); i >= (l); i--)
#define sz(x) (int)x.size()
#define ff first
#define ss secounf 
#define all(x) begin(x), end(x)
#define pb push_back

const ll mod = 1e9+7, maxn = 5e2+1, inf = ll(1e9)+5;


struct state{
     int u, v, id;
     bool nb;
     state(){}
     state(int u, int v, int nb): u(u), v(v), nb(nb){ 
          id = (u*maxn + v)<<1|nb; 
     }
     state(int id): id(id){
          nb = id&1, id >>= 1;
          v = id%maxn, u = id/maxn;
     }
};

int n, cnt[maxn*maxn];
// vector<int> adjr[maxn*maxn*2];
// bool win[maxn*maxn*2];
bitset<maxn*maxn*2> win;
bool B[maxn][maxn];
int nxt[maxn*maxn], out[maxn*maxn];

vector<int> adjr(state a){
     vector<int> res;
     if(a.nb){
          rep(i,0,n) if(B[i][a.u]) res.pb(state(i, a.v, 0).id);
          res.pb(a.id^1);
          if(a.v == n) res.pb(state(n, n, 0).id);
     }else{
          rep(i,0,n) if(B[i][a.v]) res.pb(state(a.u, i, 1).id);
          res.pb(state(a.u, n, 1).id);
     }
     return res;
}

void calc(){
     vector<int> winners;
     rep(i,0,n) rep(t,0,2) winners.pb(state(i, i, t).id), win[winners.back()] = true;
     while(sz(winners)){
          int r = winners.back(); winners.pop_back();
          state R(r);
          for(int c: adjr(R)){
               if(win[c]) continue;
               if(c&1) cnt[c>>1]++;
               state S(c); c >>= 1;
               if(S.nb){
                    if(cnt[c] == out[c]) {
                         winners.pb(S.id);
                         win[winners.back()] = true;
                    }
               }else winners.pb(S.id), nxt[c] = R.u, win[winners.back()] = true;
          }
     }
}

void add_edge(state a, state b){
     // adjr[b.id].pb(a.id);
     if(a.id&1) out[a.id>>1]++;
}

state cr;

int nextMove(int r){
     cr = state(cr.u, r, 0);
     cr = state(nxt[cr.id>>1], r, 1);
     return cr.u;
}

int start(int n, bool A[MAX_N][MAX_N]){ ::n = n;
     rep(i,0,n) rep(j,0,n) {
          if(A[i][j]){
               B[i][j] = true;
               rep(a,0,n) {
                    add_edge(state(a, i, 1), state(a, j, 0));
                    add_edge(state(i, a, 0), state(j, a, 1));
               }
          }
     }
     rep(i,0,n) rep(j,0,n) add_edge(state(i, j, 0), state(i, j, 1));
     rep(i,0,n) {
          add_edge(state(n, n, 0), state(i, n, 1)); 
          rep(j,0,n) add_edge(state(i, n, 1), state(i, j, 0));
     }
     calc();
     if(!win[state(n, n, 0).id]) return -1;
     cr = state(nxt[state(n, n, 0).id>>1], n, 1);
     return cr.u;
}

// int main(){
//      cin.tie(0) -> sync_with_stdio(0);
//      cin >> n;
//      rep(i,0,n) rep(j,0,n) {
//           bool k; cin >> k;
//           if(k){
//                rep(a,0,n) {
//                     add_edge(state(a, i, 1), state(a, j, 0));
//                     add_edge(state(i, a, 0), state(j, a, 1));
//                }
//           }
//      }
//      rep(i,0,n) rep(j,0,n) add_edge(state(i, j, 0), state(i, j, 1));
//      rep(i,0,n) {
//           add_edge(state(n, n, 0), state(i, n, 1)); 
//           rep(j,0,n) add_edge(state(i, n, 1), state(i, j, 0));
//      }
//      calc();
//      rep(i,0,n) rep(j,0,n) {
//           int ID = state(i, j, 0).id;
//           if(!win[ID]) cout << -1 << ' ';
//           else cout << i << ',' << j << ',' << nxt[ID] << ' ';
//           if(j == n-1) cout << '\n';
//      }
//      if(!win[state(n, n, 0).id]) return -1;
//      cr = state(nxt[state(n, n, 0).id], n, 1);


//      cout << '#' << cr.u << endl;
//      while(cr.u - cr.v || cr.u == n){
//           int a; cin >> a;
//           cout << '#' << nextMove(a) << endl;
//      }
//      return 0;
// }

/*
4
0 1 0 1
1 0 1 0 
0 1 0 1
1 0 1 0

3
0 1 1
1 0 1 
1 1 0

*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 289 ms 4908 KB Output is correct
5 Correct 50 ms 2436 KB Output is correct
6 Correct 290 ms 4808 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 312 ms 4724 KB Output is correct
4 Correct 282 ms 4900 KB Output is correct
5 Correct 343 ms 4652 KB Output is correct
6 Correct 305 ms 4808 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 5 ms 976 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 2 ms 848 KB Output is correct
14 Correct 5 ms 976 KB Output is correct
15 Correct 3 ms 720 KB Output is correct
16 Correct 3 ms 720 KB Output is correct
17 Correct 13 ms 1232 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 289 ms 4908 KB Output is correct
5 Correct 50 ms 2436 KB Output is correct
6 Correct 290 ms 4808 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 312 ms 4724 KB Output is correct
10 Correct 282 ms 4900 KB Output is correct
11 Correct 343 ms 4652 KB Output is correct
12 Correct 305 ms 4808 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 2 ms 976 KB Output is correct
23 Correct 5 ms 976 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 848 KB Output is correct
26 Correct 5 ms 976 KB Output is correct
27 Correct 3 ms 720 KB Output is correct
28 Correct 3 ms 720 KB Output is correct
29 Correct 13 ms 1232 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 298 ms 4964 KB Output is correct
36 Correct 43 ms 2384 KB Output is correct
37 Correct 293 ms 4744 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 307 ms 4808 KB Output is correct
41 Correct 293 ms 4912 KB Output is correct
42 Correct 329 ms 4648 KB Output is correct
43 Correct 312 ms 4764 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 5 ms 976 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 2 ms 848 KB Output is correct
52 Correct 8 ms 976 KB Output is correct
53 Correct 2 ms 720 KB Output is correct
54 Correct 2 ms 720 KB Output is correct
55 Correct 13 ms 1232 KB Output is correct
56 Correct 1 ms 976 KB Output is correct
57 Correct 6 ms 1616 KB Output is correct
58 Correct 16 ms 3024 KB Output is correct
59 Correct 27 ms 3792 KB Output is correct
60 Execution timed out 1510 ms 4880 KB Time limit exceeded
61 Halted 0 ms 0 KB -