Submission #234668

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
234668	2020-05-25T05:10:51 Z	BamiTorabi	Cop and Robber (BOI14_coprobber)	C++14	100 / 100	563 ms	6776 KB

coprobber

//Sasayego! Sasayego! Shinzou wo Sasageyo!

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include <bitset>
#include <ctime>
#include "coprobber.h"
#define debug(x)  cerr << #x << " = " << x << endl
#define lid (id << 1)
#define rid (lid ^ 1)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;

int arumin[MAX_N][MAX_N][2], eren[MAX_N][MAX_N];
int annie[MAX_N][MAX_N], deg[MAX_N], shingeki;
queue <int> Q;

int start(int n, bool A[MAX_N][MAX_N]){
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++)
			if (A[i][j])
				deg[i]++;
		for (int j = 0; j < n; j++)
			annie[j][i] = deg[i];
	}
	for (int i = 0; i < n; i++)
		for (int b = 0; b < 2; b++){
			arumin[i][i][b] = 1;
			eren[i][i] = i;
			Q.push(b * n * n + i * n + i);
		}
	while (!Q.empty()){
		int x = Q.front();;
		Q.pop();
		bool b = (x >= n * n);
		x -= b * n * n;
		int att = x / n;
		int fem = x % n;
		if (b){
			for (int u = 0; u < n; u++)
				if (A[u][fem]){
					annie[att][u]--;
					if (annie[att][u] == 0 && !arumin[att][u][0]){
						arumin[att][u][0] = 1;
						Q.push(n * att + u);
					}
				}
		}
		else{
			for (int u = 0; u < n; u++)
				if ((A[u][att] || u == att) && !arumin[u][fem][1]){
					arumin[u][fem][1] = 1;
					eren[u][fem] = att;
					Q.push(n * n + u * n + fem);
				}
		}
	}
	shingeki = -1;
	for (int i = 0; i < n; i++){
		bool flag = true;
		for (int j = 0; j < n; j++)
			flag &= (arumin[i][j][1]);
		if (flag)
			shingeki = i;
	}
	return shingeki;
}

int nextMove(int femaleTitan){
	return shingeki = eren[shingeki][femaleTitan];
}

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	330 ms	5672 KB	Output is correct
5	Correct	51 ms	2816 KB	Output is correct
6	Correct	357 ms	5640 KB	Output is correct

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	512 KB	Output is correct
3	Correct	337 ms	5532 KB	Output is correct
4	Correct	347 ms	5752 KB	Output is correct
5	Correct	345 ms	5496 KB	Output is correct
6	Correct	358 ms	5624 KB	Output is correct

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	4 ms	512 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	5 ms	640 KB	Output is correct
10	Correct	6 ms	1152 KB	Output is correct
11	Correct	7 ms	1152 KB	Output is correct
12	Correct	5 ms	512 KB	Output is correct
13	Correct	6 ms	896 KB	Output is correct
14	Correct	8 ms	1152 KB	Output is correct
15	Correct	6 ms	896 KB	Output is correct
16	Correct	6 ms	896 KB	Output is correct
17	Correct	11 ms	1536 KB	Output is correct
18	Correct	6 ms	1152 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	330 ms	5672 KB	Output is correct
5	Correct	51 ms	2816 KB	Output is correct
6	Correct	357 ms	5640 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	337 ms	5532 KB	Output is correct
10	Correct	347 ms	5752 KB	Output is correct
11	Correct	345 ms	5496 KB	Output is correct
12	Correct	358 ms	5624 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	512 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	4 ms	512 KB	Output is correct
21	Correct	5 ms	640 KB	Output is correct
22	Correct	6 ms	1152 KB	Output is correct
23	Correct	7 ms	1152 KB	Output is correct
24	Correct	5 ms	512 KB	Output is correct
25	Correct	6 ms	896 KB	Output is correct
26	Correct	8 ms	1152 KB	Output is correct
27	Correct	6 ms	896 KB	Output is correct
28	Correct	6 ms	896 KB	Output is correct
29	Correct	11 ms	1536 KB	Output is correct
30	Correct	6 ms	1152 KB	Output is correct
31	Correct	4 ms	384 KB	Output is correct
32	Correct	4 ms	384 KB	Output is correct
33	Correct	4 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	344 ms	5668 KB	Output is correct
36	Correct	55 ms	2816 KB	Output is correct
37	Correct	366 ms	5624 KB	Output is correct
38	Correct	4 ms	384 KB	Output is correct
39	Correct	5 ms	512 KB	Output is correct
40	Correct	341 ms	5624 KB	Output is correct
41	Correct	346 ms	5752 KB	Output is correct
42	Correct	320 ms	5496 KB	Output is correct
43	Correct	372 ms	5624 KB	Output is correct
44	Correct	4 ms	384 KB	Output is correct
45	Correct	5 ms	384 KB	Output is correct
46	Correct	4 ms	384 KB	Output is correct
47	Correct	5 ms	512 KB	Output is correct
48	Correct	6 ms	1152 KB	Output is correct
49	Correct	7 ms	1152 KB	Output is correct
50	Correct	5 ms	512 KB	Output is correct
51	Correct	6 ms	1024 KB	Output is correct
52	Correct	7 ms	1152 KB	Output is correct
53	Correct	6 ms	896 KB	Output is correct
54	Correct	6 ms	896 KB	Output is correct
55	Correct	11 ms	1408 KB	Output is correct
56	Correct	6 ms	1152 KB	Output is correct
57	Correct	9 ms	2048 KB	Output is correct
58	Correct	23 ms	3712 KB	Output is correct
59	Correct	41 ms	4480 KB	Output is correct
60	Correct	465 ms	6776 KB	Output is correct
61	Correct	94 ms	4480 KB	Output is correct
62	Correct	95 ms	4900 KB	Output is correct
63	Correct	487 ms	6356 KB	Output is correct
64	Correct	109 ms	4608 KB	Output is correct
65	Correct	537 ms	6520 KB	Output is correct
66	Correct	343 ms	5624 KB	Output is correct
67	Correct	563 ms	6224 KB	Output is correct
68	Correct	262 ms	4600 KB	Output is correct
69	Correct	5 ms	384 KB	Output is correct

Submission #234668

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 14.0 / 14.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
16.0 / 16.0

Subtask #2
14.0 / 14.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0