oj.uz

Submission #230114

# Submission time Handle Problem Language Result Execution time Memory
230114 2020-05-08T12:43:19 Z egorlifar Cop and Robber (BOI14_coprobber) C++17
100 / 100
 616 ms 9124 KB 
#include "coprobber.h"
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define rank rank228
#define y1 y1228
#define pb push_back
#define mp make_pair
using ll = long long;
using ld = long double;



bool win[MAX_N][MAX_N][2];
int	moves[MAX_N][MAX_N][2];
int cnt[MAX_N][MAX_N][2];
int deg[MAX_N];
int pos;


int start(int n, bool A[MAX_N][MAX_N]) {
	queue<pair<pair<int, int>, int> > q;
	for (int i = 0; i < n; i++) {
		for (int t = 0; t < 2; t++) {
			win[i][i][t] = true;
			q.push(mp(mp(i, i), t));
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (A[i][j] && j != i) {
				deg[i]++;
			}
		}
	}
	while (!q.empty()) {
		auto x = q.front();
		q.pop();
		int t = x.second;
		int i = x.first.first;
		int j = x.first.second;
		if (t == 1) {
			for (int k = 0; k < n; k++) {
				if ((i == k || A[k][i]) && !win[k][j][t ^ 1]) {
					win[k][j][t ^ 1] = true;
					moves[k][j][t ^ 1] = i;
					q.push(mp(mp(k, j), t ^ 1));
				}
			}
		} else {
			for (int k = 0; k < n; k++) {
				if (A[k][j] && !win[i][k][t ^ 1]) {
					cnt[i][k][t ^ 1]++;
					if (cnt[i][k][t ^ 1] == deg[k]) {
						win[i][k][t ^ 1] = true;
						q.push(mp(mp(i, k), t ^ 1));
					}
				}
			}
		}
	}
	pos = -1;
	for (int i = 0; i < n; i++) {
		bool bad = false;
		for (int j = 0; j < n; j++) {
			if (!win[i][j][0]) {
				bad = true;
			}
		}
		if (!bad) {
			pos = i;
		}
	}
    return pos;
}

int nextMove(int R) {
    pos = moves[pos][R][0];
    return pos;
}

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 4 ms 384 KB Output is correct
4 Correct 349 ms 6160 KB Output is correct
5 Correct 52 ms 3192 KB Output is correct
6 Correct 336 ms 6392 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 343 ms 6448 KB Output is correct
4 Correct 346 ms 6172 KB Output is correct
5 Correct 323 ms 6236 KB Output is correct
6 Correct 379 ms 6136 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 5 ms 512 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 1280 KB Output is correct
11 Correct 8 ms 1408 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 6 ms 1152 KB Output is correct
14 Correct 9 ms 1280 KB Output is correct
15 Correct 6 ms 968 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 12 ms 1536 KB Output is correct
18 Correct 6 ms 1280 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 4 ms 384 KB Output is correct
4 Correct 349 ms 6160 KB Output is correct
5 Correct 52 ms 3192 KB Output is correct
6 Correct 336 ms 6392 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 343 ms 6448 KB Output is correct
10 Correct 346 ms 6172 KB Output is correct
11 Correct 323 ms 6236 KB Output is correct
12 Correct 379 ms 6136 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 5 ms 512 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 1280 KB Output is correct
23 Correct 8 ms 1408 KB Output is correct
24 Correct 5 ms 640 KB Output is correct
25 Correct 6 ms 1152 KB Output is correct
26 Correct 9 ms 1280 KB Output is correct
27 Correct 6 ms 968 KB Output is correct
28 Correct 7 ms 896 KB Output is correct
29 Correct 12 ms 1536 KB Output is correct
30 Correct 6 ms 1280 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 319 ms 6176 KB Output is correct
36 Correct 49 ms 3072 KB Output is correct
37 Correct 372 ms 6324 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 4 ms 512 KB Output is correct
40 Correct 322 ms 6336 KB Output is correct
41 Correct 343 ms 6140 KB Output is correct
42 Correct 334 ms 6040 KB Output is correct
43 Correct 344 ms 6008 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 512 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 6 ms 1280 KB Output is correct
49 Correct 7 ms 1280 KB Output is correct
50 Correct 5 ms 640 KB Output is correct
51 Correct 6 ms 1024 KB Output is correct
52 Correct 8 ms 1280 KB Output is correct
53 Correct 6 ms 1024 KB Output is correct
54 Correct 6 ms 896 KB Output is correct
55 Correct 12 ms 1536 KB Output is correct
56 Correct 8 ms 1280 KB Output is correct
57 Correct 11 ms 2208 KB Output is correct
58 Correct 26 ms 4088 KB Output is correct
59 Correct 37 ms 4984 KB Output is correct
60 Correct 496 ms 9124 KB Output is correct
61 Correct 107 ms 5600 KB Output is correct
62 Correct 124 ms 5880 KB Output is correct
63 Correct 459 ms 8036 KB Output is correct
64 Correct 128 ms 5672 KB Output is correct
65 Correct 536 ms 8860 KB Output is correct
66 Correct 347 ms 6648 KB Output is correct
67 Correct 616 ms 7952 KB Output is correct
68 Correct 292 ms 5368 KB Output is correct
69 Correct 4 ms 384 KB Output is correct