제출 #1155446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1155446		Nonoze	경찰관과 강도 (BOI14_coprobber)	C++20	100 / 100	341 ms	18560 KiB

coprobber

/*
*	Author: Nonoze
*	Created: Saturday 22/02/2025
*/
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;

#ifndef IN_LOCAL
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

// #define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;

int n;
vector<vector<int>> adj, nxt;

int X;

int start(int N, bool A[MAX_N][MAX_N]) {
    n = N;
    adj.resize(n);
    nxt.resize(n, vector<int>(n, -1));
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            if (A[i][j]) {
                adj[i].pb(j);
            }
        }
    }

    vector<vector<int>> cnt(n, vector<int>(n, 0));
    queue<vector<int>> q; for (int i=0; i<n; i++) q.push({i, i, 1});
    while (!q.empty()) {
        auto vec = q.front(); q.pop();
        int a=vec[0], b=vec[1], turn=vec[2];
        // cout << a << ' ' << b << ' ' << turn << endl;
        if (turn) {
            if (nxt[a][b]==-1) {
                nxt[a][b]=a;
                q.push({a, b, 0});
            }
            for (auto u: adj[a]) {
                if (nxt[u][b]==-1) {
                    nxt[u][b]=a;
                    q.push({u, b, 0});
                }
            }
        } else {
            for (auto v: adj[b]) {
                cnt[a][v]++;
                if (cnt[a][v]==sz(adj[v])) {
                    q.push({a, v, 1});
                }
            }
        }
    }


    int ans=-1;
    for (int i=0; i<n; i++) {
        bool ok=1;
        for (int j=0; j<n; j++) {
            if (i!=j && nxt[i][j]==-1) {
                ok=0;
            }
        }
        if (ok) {
            ans=i;
            break;
        }
    }
    X=ans;
    return ans;
}

int nextMove(int R) {
    int nxtT=nxt[X][R];
    X=nxtT;
    return nxtT;
}

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