oj.uz

답안 #377221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377221 2021-03-13T12:10:12 Z Kevin_Zhang_TW 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 1385 ms 11964 KB 
#include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() {cerr << endl;}
template<class T, class ...U> void kout (T v, U ...e) { cerr << v << ' ', kout(e...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L)==R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
// What I should check
// 1. overflow
// 2. corner cases
// Enjoy the problem instead of hurrying to AC
// Good luck !
const int MAX_N = 500;
 
// modify the following functions
// you can define global variables and functions
 
int cop[MAX_N][MAX_N], rob[MAX_N][MAX_N], N;
int capchance[MAX_N][MAX_N], eschance[MAX_N][MAX_N], ti;
int inq[2][MAX_N][MAX_N];
bool E[MAX_N][MAX_N];
 
#pragma GCC optimize("Ofast")
 
void finishdp() {
	const int cop_t = 0, rob_t = 1;
	queue< tuple<int,int,int,int> > q;
 
	for (int i = 0;i < N;++i) q.emplace(rob_t, i, i, true);
 
	auto qpush = [&](int t, int i, int j, int k) {
		if (inq[t][i][j]) return;
		inq[t][i][j] = true;
		q.emplace(t, i, j, k);
	};
 
	while (q.size()) {
		auto [t, i, j, res] = q.front(); q.pop();
		if (t == cop_t) {
			if (~cop[i][j]) continue;
			cop[i][j] = res;
			if (res == false) {
				for (int k = 0;k < N;++k) 
					if (E[j][k]) 
						qpush(rob_t, i, k, false);
			}
			else {
				cop[i][j] = ++ti;
				for (int k = 0;k < N;++k) 
					if (E[j][k]) {
						if (--eschance[i][k] == 0)
							qpush(rob_t, i, k, true);
					}
			}
		}
		else {
			if (~rob[i][j]) continue;
			rob[i][j] = res;
			if (res == true) {
				rob[i][j] = ++ti;
				for (int k = 0;k < N;++k) 
					if (k == i || E[i][k]) 
						qpush(cop_t, k, j, true);
			}
			else {
				for (int k = 0;k < N;++k) 
					if (k == i || E[i][k]) {
						if (--capchance[j][k] == 0)
							qpush(cop_t, k, j, false);
					}
			}
		} 
	}
}
int cur;
 
int start(int N, bool A[MAX_N][MAX_N]) {
	::N = N;
	memcpy(E, A, sizeof(E));
	memset(cop, -1, sizeof(cop));
	memset(rob, -1, sizeof(rob));
 
	for (int i = 0;i < N;++i)
		for (int j = 0;j < N;++j) 
		 	for (int k = 0;k < N;++k)  {
				if (E[j][k]) 
					++eschance[i][j];
				if (E[j][k] || j == k) 
					++capchance[i][j];
			}
 
	finishdp();
 
	for (int i = 0;i < N;++i)
		if (count(cop[i], cop[i] + N, false) + count(cop[i], cop[i] + N, -1) == 0)
			return cur = i;
 
	return -1;
}
int nextMove(int R) {
 
	if (E[cur][R]) return R;
 
	for (int i = 0;i < N;++i) if (i == cur || E[cur][i])  {
		if (cop[i][R] > 0 && cop[cur][R] > rob[i][R])
			return cur = i;
	}
 
	assert(false);
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2540 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 542 ms 7916 KB Output is correct
5 Correct 74 ms 5100 KB Output is correct
6 Correct 587 ms 8300 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2540 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 565 ms 7996 KB Output is correct
4 Correct 539 ms 7880 KB Output is correct
5 Correct 528 ms 7916 KB Output is correct
6 Correct 566 ms 7804 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2540 KB Output is correct
2 Correct 2 ms 2540 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2540 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2540 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2796 KB Output is correct
10 Correct 5 ms 3436 KB Output is correct
11 Correct 11 ms 3436 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 4 ms 3180 KB Output is correct
14 Correct 8 ms 3436 KB Output is correct
15 Correct 4 ms 3052 KB Output is correct
16 Correct 4 ms 3052 KB Output is correct
17 Correct 14 ms 3692 KB Output is correct
18 Correct 5 ms 3436 KB Output is correct
19 Correct 2 ms 2540 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2540 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 3 ms 2668 KB Output is correct
4 Correct 542 ms 7916 KB Output is correct
5 Correct 74 ms 5100 KB Output is correct
6 Correct 587 ms 8300 KB Output is correct
7 Correct 2 ms 2540 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 565 ms 7996 KB Output is correct
10 Correct 539 ms 7880 KB Output is correct
11 Correct 528 ms 7916 KB Output is correct
12 Correct 566 ms 7804 KB Output is correct
13 Correct 2 ms 2540 KB Output is correct
14 Correct 2 ms 2540 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2540 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2540 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2796 KB Output is correct
22 Correct 5 ms 3436 KB Output is correct
23 Correct 11 ms 3436 KB Output is correct
24 Correct 2 ms 2796 KB Output is correct
25 Correct 4 ms 3180 KB Output is correct
26 Correct 8 ms 3436 KB Output is correct
27 Correct 4 ms 3052 KB Output is correct
28 Correct 4 ms 3052 KB Output is correct
29 Correct 14 ms 3692 KB Output is correct
30 Correct 5 ms 3436 KB Output is correct
31 Correct 2 ms 2540 KB Output is correct
32 Correct 2 ms 2540 KB Output is correct
33 Correct 2 ms 2540 KB Output is correct
34 Correct 3 ms 2668 KB Output is correct
35 Correct 534 ms 8020 KB Output is correct
36 Correct 77 ms 5228 KB Output is correct
37 Correct 615 ms 8428 KB Output is correct
38 Correct 2 ms 2540 KB Output is correct
39 Correct 2 ms 2668 KB Output is correct
40 Correct 544 ms 8044 KB Output is correct
41 Correct 554 ms 7916 KB Output is correct
42 Correct 513 ms 7928 KB Output is correct
43 Correct 569 ms 7788 KB Output is correct
44 Correct 2 ms 2540 KB Output is correct
45 Correct 2 ms 2668 KB Output is correct
46 Correct 2 ms 2668 KB Output is correct
47 Correct 2 ms 2796 KB Output is correct
48 Correct 5 ms 3436 KB Output is correct
49 Correct 8 ms 3436 KB Output is correct
50 Correct 2 ms 2796 KB Output is correct
51 Correct 4 ms 3180 KB Output is correct
52 Correct 8 ms 3436 KB Output is correct
53 Correct 4 ms 3052 KB Output is correct
54 Correct 4 ms 3052 KB Output is correct
55 Correct 19 ms 3692 KB Output is correct
56 Correct 5 ms 3584 KB Output is correct
57 Correct 20 ms 4332 KB Output is correct
58 Correct 109 ms 5868 KB Output is correct
59 Correct 202 ms 6912 KB Output is correct
60 Correct 870 ms 11964 KB Output is correct
61 Correct 614 ms 7676 KB Output is correct
62 Correct 662 ms 7916 KB Output is correct
63 Correct 1042 ms 10332 KB Output is correct
64 Correct 396 ms 7660 KB Output is correct
65 Correct 1385 ms 11640 KB Output is correct
66 Correct 552 ms 8812 KB Output is correct
67 Correct 1367 ms 10236 KB Output is correct
68 Correct 601 ms 7404 KB Output is correct
69 Correct 2 ms 2540 KB Output is correct