제출 #973240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973240		steveonalex	경찰관과 강도 (BOI14_coprobber)	C++17	16 / 100	153 ms	2888 KiB

coprobber

#include <bits/stdc++.h>
#include "coprobber.h"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }


template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 500;
const int INF = 1e9 + 69;

int graph[N][N];
bitset<N> edging[N];
int cop;

int current_subtask;

int n;


namespace Sub1{
    int nextMove(int R){
        vector<int> S; S.push_back(cop);
        for(int i = 0; i<n; ++i) if (edging[cop][i]) S.push_back(i);

        pair<int, int> best = {INF, INF};
        for(int i: S){
            int cur = graph[i][R];
            minimize(best, make_pair(cur, i));
        }
        cop = best.second;

        return best.second;

    }
}

namespace Sub2{
    int r, c;
    void init(){
        for(int i = 1; i<n; ++i) if (edging[i].count() == 2){
            c = i + 1, r = n / c;
        }
    }

    int nextMove(int R){
        pair<int, int> u = make_pair(cop / c, cop % c);
        pair<int, int> v = make_pair(R / c, R % c);

        if (u.second % 2 != v.second % 2) return cop;

        vector<int> S; S.push_back(cop);
        for(int i = 0; i<n; ++i) if (edging[cop][i]) S.push_back(i);

        vector<int> T;
        for(int i = 0; i<n; ++i) if (edging[R][i]) T.push_back(i);

        pair<int, int> best = {INF, INF};
        for(int i: S){
            int cur = graph[i][R];
            minimize(best, make_pair(cur, i));
        }
        cop = best.second;

        return best.second;
    }
}

int start(int _n, bool A[N][N]){
    n = _n;

    for(int i = 0; i<n; ++i) for(int j= 0; j<n; ++j) edging[i][j] = A[i][j];

    int cnt = 0;
    for(int i = 0; i<n; ++i) cnt += edging[i].count();

    if (cnt == (n-1) * 2) current_subtask = 1;
    else{
        current_subtask = 2;
        Sub2::init();
    }

    for(int i = 0; i<n; ++i) for(int j = 0; j<n; ++j) {
        if (A[i][j]) graph[i][j] = 1;
        else graph[i][j] = INF;
        if (i == j) graph[i][j] = 0;
    }

    for(int k = 0; k<n; ++k) for(int i= 0; i<n; ++i) for(int j = 0; j<n; ++j) 
        minimize(graph[i][j], graph[i][k] + graph[k][j]);

    cop = 0;
    return 0;
    // if (biggest_cycle <= 4) return 0;
    // return -1;
}


int nextMove(int R){
    if (current_subtask == 1) return Sub1::nextMove(R);
    else return Sub2::nextMove(R);
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int n; cin >> n;
//     bool a[N][N];
//     memset(a, 0, sizeof a);

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

//     int cop = start(n, a);
//     cout << "? " << cop << endl;

//     int crim; cin >> crim;
//     while(cop != crim){
//         cop = nextMove(crim);
//         if (cop == crim) break;
//         cout << "? " << cop << endl;
//         cin >> crim;
//     }

//     cout << "Crim caught!!!!" << endl;

//     return 0;
// }

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