답안 #338093

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338093	2020-12-22T13:14:24 Z	CaroLinda	경찰관과 강도 (BOI14_coprobber)	C++14	100 / 100	755 ms	11504 KB

coprobber

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

#define sz(x) (int)(x.size() )
#define all(x) x.begin(),x.end()
#define debug printf
#define ll long long

const int MAXN = 505 ;

using namespace std ;

int nxtMove[MAXN][MAXN] ;
int outDeg[MAXN][MAXN][2] ;
bool graph[MAXN][MAXN] ;
bool isWinner[MAXN][MAXN] ;
int myCurrent , n ;

int start(int N, bool A[MAX_N][MAX_N])
{
	n = N ;

	for(int i = 0 ; i < N ; i++ )
	{
		int deg = 0 ;

		for(int j = 0 ; j < N ; j++ )
			graph[i][j] = A[i][j] , deg += A[i][j] ;

		for(int j = 0 ; j < N ; j++ )
		{			
			outDeg[i][j][0] = deg+1 ;

			if(i != j )
				outDeg[j][i][1] = deg ;
		}
	}

	vector< tuple<int,int,int> > q ;
	int ini = 0 ;

	for(int i = 0 ; i < N ; i++ )
		for(int j = 0 ; j < N ; j++ )
			for(int k = 0 ; k < 2 ; k++ )
			{
				if( outDeg[i][j][k] == 0 ) 
				{
					q.push_back( make_tuple(i,j,k) ) ;
					outDeg[i][j][k] = -1 ;
				}
			}
	while( ini < sz(q) )
	{

		int x = get<0>( q[ini] ) ;
		int y = get<1>( q[ini] ) ;
		int z = get<2>( q[ini] ) ;

		ini++ ;

		if(z) isWinner[x][y] = true ;

		//cout << x << " " << y << " " << z << endl ;

		if(!z)
		{
			//I'm the cop's turn
			//That means my previous must be a robber's move

			for(int i = 0 ; i < N ; i++ )
				if( A[i][y] && (--outDeg[x][i][1]) == 0 ) q.push_back( make_tuple(x,i,1) ) ;

		}
		else
		{
			for(int i = 0 ; i < N ; i++ )
			{
				if( (!A[i][x] && i != x) || outDeg[i][y][0] <= 0 ) continue ;
				
				outDeg[i][y][0] = -1 ;
				nxtMove[i][y] = x ;

				q.push_back( make_tuple(i,y,0) ) ;

			}
		}	

	}

	for(int i = 0 ; i < N ; i++ )
	{
		bool theyWin = true ;

		for(int j = 0 ; j < N ; j++ )
			theyWin &= isWinner[i][j] ;

		if( theyWin ) return myCurrent = i ;	
	}

	return -1 ;

}

int nextMove(int R)
{

	//The state is (myCurrent, R, 0) 
	return myCurrent = nxtMove[myCurrent][R] ;

}

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	405 ms	11356 KB	Output is correct
5	Correct	53 ms	4472 KB	Output is correct
6	Correct	458 ms	11356 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	399 ms	11356 KB	Output is correct
4	Correct	403 ms	11356 KB	Output is correct
5	Correct	372 ms	11248 KB	Output is correct
6	Correct	413 ms	11356 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	2 ms	1132 KB	Output is correct
11	Correct	3 ms	1260 KB	Output is correct
12	Correct	1 ms	620 KB	Output is correct
13	Correct	2 ms	1004 KB	Output is correct
14	Correct	4 ms	1260 KB	Output is correct
15	Correct	2 ms	1004 KB	Output is correct
16	Correct	2 ms	1004 KB	Output is correct
17	Correct	8 ms	1836 KB	Output is correct
18	Correct	2 ms	1132 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	405 ms	11356 KB	Output is correct
5	Correct	53 ms	4472 KB	Output is correct
6	Correct	458 ms	11356 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	399 ms	11356 KB	Output is correct
10	Correct	403 ms	11356 KB	Output is correct
11	Correct	372 ms	11248 KB	Output is correct
12	Correct	413 ms	11356 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	0 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	1 ms	492 KB	Output is correct
22	Correct	2 ms	1132 KB	Output is correct
23	Correct	3 ms	1260 KB	Output is correct
24	Correct	1 ms	620 KB	Output is correct
25	Correct	2 ms	1004 KB	Output is correct
26	Correct	4 ms	1260 KB	Output is correct
27	Correct	2 ms	1004 KB	Output is correct
28	Correct	2 ms	1004 KB	Output is correct
29	Correct	8 ms	1836 KB	Output is correct
30	Correct	2 ms	1132 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	0 ms	364 KB	Output is correct
34	Correct	0 ms	364 KB	Output is correct
35	Correct	409 ms	11356 KB	Output is correct
36	Correct	56 ms	4196 KB	Output is correct
37	Correct	432 ms	11392 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	492 KB	Output is correct
40	Correct	392 ms	11240 KB	Output is correct
41	Correct	424 ms	11308 KB	Output is correct
42	Correct	392 ms	11228 KB	Output is correct
43	Correct	433 ms	11340 KB	Output is correct
44	Correct	1 ms	364 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	492 KB	Output is correct
47	Correct	1 ms	492 KB	Output is correct
48	Correct	2 ms	1132 KB	Output is correct
49	Correct	3 ms	1388 KB	Output is correct
50	Correct	1 ms	620 KB	Output is correct
51	Correct	2 ms	1004 KB	Output is correct
52	Correct	4 ms	1260 KB	Output is correct
53	Correct	2 ms	1004 KB	Output is correct
54	Correct	2 ms	1004 KB	Output is correct
55	Correct	8 ms	1836 KB	Output is correct
56	Correct	2 ms	1132 KB	Output is correct
57	Correct	8 ms	1900 KB	Output is correct
58	Correct	24 ms	3436 KB	Output is correct
59	Correct	35 ms	4264 KB	Output is correct
60	Correct	571 ms	11416 KB	Output is correct
61	Correct	81 ms	5348 KB	Output is correct
62	Correct	80 ms	5732 KB	Output is correct
63	Correct	673 ms	11356 KB	Output is correct
64	Correct	122 ms	5732 KB	Output is correct
65	Correct	755 ms	11256 KB	Output is correct
66	Correct	416 ms	11228 KB	Output is correct
67	Correct	709 ms	11504 KB	Output is correct
68	Correct	288 ms	7392 KB	Output is correct
69	Correct	1 ms	364 KB	Output is correct

답안 #338093

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