제출 #311193

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311193		VROOM_VARUN	경찰관과 강도 (BOI14_coprobber)	C++14	0 / 100	1 ms	384 KiB

coprobber

/*
ID: varunra2
LANG: C++
TASK: copfriend
*/

#include<bits/stdc++.h>
#include "coprobber.h"
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions


const int N = 500;

int cnt[2][N][N]; // 0 -> cop, 1 -> robber
int best[N][N];

int start(int n, bool a[N][N]) {

  for(int i = 0; i < n; i++) {
    int tot = 0;
    for(int j = 0; j < n; j++) {
      tot += a[i][j];
    }
    for(int j = 0; j < n; j++) {
      cnt[0][i][j] = 1;
      cnt[1][i][j] = tot;
    }

  }

  queue<pair<int, PII>> q;

  int vis = 0;

  for(int i = 0; i < n; i++) {
    q.push(MP(0, MP(i, i)));
    q.push(MP(1, MP(i, i)));
  }

  while(!q.empty()) {
    auto x = q.front();
    q.pop();
    int type = x.x;
    int u = x.y.x;
    int v = x.y.y;
    vis++;
    if(type ^ 1) {
      for(int i = 0; i < n; i++) {
        if(a[u][i] and cnt[1][u][i] > 0) {
          cnt[1][u][i]--;
          if(cnt[1][u][i] == 0) {
            q.push(MP(1, MP(u, i)));
          }
        }
      }
    }
    else {
      for(int i = 0; i < n; i++) {
        if((a[u][i] or u == i) and cnt[0][i][v]) {
          cnt[0][i][v] = 0;
          best[i][v] = u;
          q.push(MP(0, MP(i, v)));
        }
      }
    }
  }

  if(vis == 2 * n * n) {
    return 0;    
  }
  return -1;
}

int c = 0;

int nextMove(int r) {
  c = best[c][r];
  return c;
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("copfriend.in", "r", stdin);
//   freopen("copfriend.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0); cin.tie(0);

//   // int n;
//   // cin >> n;

//   // int a[n][n];

//   // for(int i = 0; i < n; i++) {
//     // for(int j = 0; j < n; j++) {
//       // cin >> a[]
//     // }
//   // }

//   return 0;
// }

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