oj.uz

Submission #584551

# Submission time Handle Problem Language Result Execution time Memory
584551 2022-06-27T14:33:09 Z MohammadAghil Cop and Robber (BOI14_coprobber) C++17
60 / 100
 856 ms 262144 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;
int nxt[maxn*maxn], out[maxn*maxn];

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]){
               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 7 ms 12112 KB Output is correct
2 Correct 6 ms 12112 KB Output is correct
3 Correct 6 ms 12164 KB Output is correct
4 Correct 170 ms 32148 KB Output is correct
5 Correct 39 ms 17988 KB Output is correct
6 Correct 208 ms 33340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12112 KB Output is correct
2 Correct 6 ms 12112 KB Output is correct
3 Correct 208 ms 40960 KB Output is correct
4 Correct 191 ms 32148 KB Output is correct
5 Correct 203 ms 40156 KB Output is correct
6 Correct 193 ms 35824 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12132 KB Output is correct
2 Correct 6 ms 12044 KB Output is correct
3 Correct 6 ms 12112 KB Output is correct
4 Correct 6 ms 12112 KB Output is correct
5 Correct 7 ms 12112 KB Output is correct
6 Correct 7 ms 12080 KB Output is correct
7 Correct 7 ms 12112 KB Output is correct
8 Correct 7 ms 12112 KB Output is correct
9 Correct 6 ms 12240 KB Output is correct
10 Correct 12 ms 13776 KB Output is correct
11 Correct 26 ms 18228 KB Output is correct
12 Correct 7 ms 12368 KB Output is correct
13 Correct 8 ms 13040 KB Output is correct
14 Correct 20 ms 15184 KB Output is correct
15 Correct 10 ms 12880 KB Output is correct
16 Correct 9 ms 13136 KB Output is correct
17 Correct 29 ms 19648 KB Output is correct
18 Correct 10 ms 13264 KB Output is correct
19 Correct 7 ms 12092 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12112 KB Output is correct
2 Correct 6 ms 12112 KB Output is correct
3 Correct 6 ms 12164 KB Output is correct
4 Correct 170 ms 32148 KB Output is correct
5 Correct 39 ms 17988 KB Output is correct
6 Correct 208 ms 33340 KB Output is correct
7 Correct 6 ms 12112 KB Output is correct
8 Correct 6 ms 12112 KB Output is correct
9 Correct 208 ms 40960 KB Output is correct
10 Correct 191 ms 32148 KB Output is correct
11 Correct 203 ms 40156 KB Output is correct
12 Correct 193 ms 35824 KB Output is correct
13 Correct 6 ms 12132 KB Output is correct
14 Correct 6 ms 12044 KB Output is correct
15 Correct 6 ms 12112 KB Output is correct
16 Correct 6 ms 12112 KB Output is correct
17 Correct 7 ms 12112 KB Output is correct
18 Correct 7 ms 12080 KB Output is correct
19 Correct 7 ms 12112 KB Output is correct
20 Correct 7 ms 12112 KB Output is correct
21 Correct 6 ms 12240 KB Output is correct
22 Correct 12 ms 13776 KB Output is correct
23 Correct 26 ms 18228 KB Output is correct
24 Correct 7 ms 12368 KB Output is correct
25 Correct 8 ms 13040 KB Output is correct
26 Correct 20 ms 15184 KB Output is correct
27 Correct 10 ms 12880 KB Output is correct
28 Correct 9 ms 13136 KB Output is correct
29 Correct 29 ms 19648 KB Output is correct
30 Correct 10 ms 13264 KB Output is correct
31 Correct 7 ms 12092 KB Output is correct
32 Correct 7 ms 12132 KB Output is correct
33 Correct 7 ms 12112 KB Output is correct
34 Correct 7 ms 12112 KB Output is correct
35 Correct 167 ms 32188 KB Output is correct
36 Correct 43 ms 18012 KB Output is correct
37 Correct 203 ms 33216 KB Output is correct
38 Correct 6 ms 12112 KB Output is correct
39 Correct 6 ms 12112 KB Output is correct
40 Correct 220 ms 40908 KB Output is correct
41 Correct 174 ms 32096 KB Output is correct
42 Correct 200 ms 40136 KB Output is correct
43 Correct 250 ms 36004 KB Output is correct
44 Correct 7 ms 12112 KB Output is correct
45 Correct 7 ms 12112 KB Output is correct
46 Correct 6 ms 12192 KB Output is correct
47 Correct 6 ms 12240 KB Output is correct
48 Correct 12 ms 13760 KB Output is correct
49 Correct 27 ms 18200 KB Output is correct
50 Correct 8 ms 12368 KB Output is correct
51 Correct 9 ms 12992 KB Output is correct
52 Correct 20 ms 15184 KB Output is correct
53 Correct 8 ms 12880 KB Output is correct
54 Correct 12 ms 13136 KB Output is correct
55 Correct 31 ms 19636 KB Output is correct
56 Correct 11 ms 13288 KB Output is correct
57 Correct 35 ms 18328 KB Output is correct
58 Correct 150 ms 29384 KB Output is correct
59 Correct 315 ms 53356 KB Output is correct
60 Runtime error 856 ms 262144 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -