oj.uz

답안 #852940

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852940 2023-09-23T08:37:14 Z lovrot 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 335 ms 10528 KB 
#include <iostream>
#include <cstdio> 
#include <vector> 
#include <queue> 
#include "coprobber.h" 

#define EB emplace_back
#define MAX_N 500

using namespace std;

const int N = 510; 

struct node {
	int u, v, f;
	node() {}
	node(int u, int v, int f) : u(u), v(v), f(f) {}
};

int n;
vector<int> G[N], GP[N];

int CNT[N][N][2], NXT[N][N];
bool W[N][N][2];
queue<node> Q;

int pol = -1;

int start(int size, bool A[MAX_N][MAX_N]) {
	n = size;
	for(int u = 0; u < n; ++u) 
		for(int v = 0; v < n; ++v) {
			if(A[u][v]) {
				G[u].EB(v);
				GP[u].EB(v);
			} else if(u == v) { GP[u].EB(u); }
		}

//	printf("yes\n");

	for(int u = 0; u < n; ++u) {
		W[u][u][1] = 1;
		Q.push(node(u, u, 1));
	}
	
	while(!Q.empty()) {
		node s = Q.front(); 
		Q.pop();
		int u = s.u, v = s.v, f = s.f;
		if(f == 0) {
			for(int w : G[v]) {	
				++CNT[u][w][1];
				if(CNT[u][w][1] == G[w].size()) {
					W[u][w][1] = 1;
					Q.push(node(u, w, 1));
				}
			}
		} else {
			for(int w : GP[u]) 
				if(!W[w][v][0]) {
					W[w][v][0] = 1;
					NXT[w][v] = u;
					Q.push(node(w, v, 0)); 
				}
		}
	}

	for(int u = 0; u < n; ++u) {
		int cnt = 0;
		for(int v = 0; v < n; ++v) cnt += W[u][v][0];
		if(cnt == n) return pol = u;
	}
	return -1;
}

int nextMove(int R) {
	return pol = NXT[pol][R];
}
/*
// don't modify the main function
int main() {
    int N;
    cin >> N;
    bool A[MAX_N][MAX_N];
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cin >> A[i][j];
        }
    }
    int P = start(N,A);
    cout << P << endl;
    int R;
    cin >> R;
    while (true) {
        if (P == R) break;
        P = nextMove(R);
        cout << P << endl;
        if (P == R) break;
        cin >> R;
    }
	return 0;
}
*/

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:53:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     if(CNT[u][w][1] == G[w].size()) {
      |        ~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4436 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 39 ms 5320 KB Output is correct
5 Correct 11 ms 4908 KB Output is correct
6 Correct 53 ms 5860 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 45 ms 5680 KB Output is correct
4 Correct 41 ms 5368 KB Output is correct
5 Correct 47 ms 5464 KB Output is correct
6 Correct 41 ms 5448 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4552 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4692 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 3 ms 4696 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 2 ms 4696 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 3 ms 4696 KB Output is correct
18 Correct 1 ms 4696 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4436 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 39 ms 5320 KB Output is correct
5 Correct 11 ms 4908 KB Output is correct
6 Correct 53 ms 5860 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 45 ms 5680 KB Output is correct
10 Correct 41 ms 5368 KB Output is correct
11 Correct 47 ms 5464 KB Output is correct
12 Correct 41 ms 5448 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4552 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4692 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4696 KB Output is correct
23 Correct 3 ms 4696 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 2 ms 4696 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 3 ms 4696 KB Output is correct
30 Correct 1 ms 4696 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4536 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 49 ms 5520 KB Output is correct
36 Correct 11 ms 4908 KB Output is correct
37 Correct 55 ms 5848 KB Output is correct
38 Correct 1 ms 4440 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 48 ms 6136 KB Output is correct
41 Correct 44 ms 5532 KB Output is correct
42 Correct 41 ms 5472 KB Output is correct
43 Correct 39 ms 5468 KB Output is correct
44 Correct 1 ms 4440 KB Output is correct
45 Correct 1 ms 4500 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Correct 1 ms 4440 KB Output is correct
48 Correct 2 ms 4696 KB Output is correct
49 Correct 2 ms 4696 KB Output is correct
50 Correct 1 ms 4440 KB Output is correct
51 Correct 1 ms 4440 KB Output is correct
52 Correct 3 ms 4696 KB Output is correct
53 Correct 1 ms 4440 KB Output is correct
54 Correct 2 ms 4440 KB Output is correct
55 Correct 3 ms 4852 KB Output is correct
56 Correct 1 ms 4696 KB Output is correct
57 Correct 3 ms 4696 KB Output is correct
58 Correct 11 ms 4964 KB Output is correct
59 Correct 18 ms 4992 KB Output is correct
60 Correct 335 ms 10528 KB Output is correct
61 Correct 38 ms 6776 KB Output is correct
62 Correct 36 ms 6780 KB Output is correct
63 Correct 216 ms 9016 KB Output is correct
64 Correct 28 ms 5732 KB Output is correct
65 Correct 250 ms 10148 KB Output is correct
66 Correct 45 ms 6296 KB Output is correct
67 Correct 139 ms 7848 KB Output is correct
68 Correct 48 ms 5720 KB Output is correct
69 Correct 1 ms 4440 KB Output is correct