제출 #250158

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

coprobber

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

using namespace std;
#define pb emplace_back
#define MAX_N 500
const int inf = 1e9;
// modify the following functions
// you can define global variables and functions
int dp[MAX_N][MAX_N];
int now, n;
vector<int> edge[MAX_N];
bool con[MAX_N][MAX_N], win[MAX_N][MAX_N];
bool check(int a, int b) {
	if (a == b) return true;
	//cerr <<" A B " << a << ' ' << b << '\n';
	for (int u : edge[b]) {
		if (!con[a][u]) return false;
		//cerr << "CON " << a << ' ' << u << '\n';
	}
	return true;
}
int start(int N, bool A[MAX_N][MAX_N]) {
	n = N;
	for (int i = 0;i < n;++i) {
		for (int j = 0;j < n;++j) {
			if (A[i][j])
				con[i][j] = true, edge[i].pb(j);//, con[i][j] = A[i][j], con[i][i] = true;
		}
		con[i][i] = true;
	}
	for (int i = 0;i < n;++i)
		for (int j = 0;j < n;++j) {
			win[i][j] = check(i, j);
			//cerr << "win " << i << ' ' << j << " : " <<(win[i][j] ?"WIN ": "LOSE") << '\n';
		}

	//exit(0);
	bool ch = true;
	while (ch) {
		ch = false;
		for (int i = 0;i < n;++i)
			for (int j = 0;j < n;++j) if (!win[i][j]) {
				bool esc = false;
				for (int u : edge[j]) {
					bool die = false;
					for (int k : edge[i]) {
						if (win[k][u]) {
							die = true;
							break;
						}
					}
					die |= win[i][u];
					if (!die) esc = true;
					if (esc) break;
				}
				if (!esc) win[i][j] = true, ch = true;
			}
	}
//	for (int i = 0;i < n;++i)
//		for (int j = 0;j < n;++j)
//			printf("win[%d][%d] : %d\n", i, j, (int)win[i][j]);
//	exit(0);
	for (int i = 0;i < n;++i) {
		bool allwin = true;
		for (int j = 0;j < n;++j)
			if (!win[i][j]) {
				allwin = false;
				break;
			}
		if (allwin)
			return now = i;
	}
	return -1;
}
int nextMove(int R) {
	if (now == R) return now;
	for (int u : edge[now])
		if (win[u][R])
			return now = u;
	return now;
}

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