oj.uz

답안 #362956

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362956 2021-02-04T21:44:48 Z CaroLinda Cultivation (JOI17_cultivation) C++14
5 / 100
 57 ms 50412 KB 
#include <bits/stdc++.h>

#define ll long long
#define sz(x) (int)(x.size() )
#define all(x) x.begin(),x.end()
#define lp(i,a,b) for(int i= a ; i < b ; i++ )
#define pb push_back

const int MAX = 1048586 ;

using namespace std ;

int N , R , C , base ;
int dist[MAX] ;
int mask[5] ;
int grid[10][10] , code[10][10] ;
vector<int> adj[MAX] ;

bool isOn(int m, int i ) {  return ((1<<i)&m ) != 0 ; }
bool valid(int x, int y ) { return 0 <= min(x,y) && x < R && y < C ; }

//0 = north
//1 = east
//2 = south
//3 = west

void printGrid()
{
	for(int i = 0 ; i <R ; i++ , cout << endl )
		lp(j,0,C) cout << grid[i][j] << " " ;
	cout << endl ;
}


int get_code(int dir )
{
	pair<int,int> p = make_pair(0,0) ;

	if(dir == 0 ) p.first-- ;
	if( dir == 1 ) p.second++ ;
	if( dir == 2 ) p.first++ ;
	if( dir == 3 ) p.second-- ;

	int s = 0 ;

	for(int i = 0 ; i < R ; i++ )
		for(int j = 0 ; j < C ; j++ )
			if( ( valid(i-p.first, j-p.second) && grid[i-p.first][j-p.second] ) || grid[i][j]  )
				s += 1<<code[i][j] ;

	return s ;
}

int main()
{

	scanf("%d %d", &R, &C ) ;
	assert( R <= 4 && C <=  4 ) ;
	scanf("%d", &N ) ;

	for(int i= 0 , c = 0 ; i <R ; i++ )
		for(int j = 0 ; j< C ; j++ , c++ ) code[i][j] = c ;

	int s = 0 ;

	for(int i = 1 , x , y ; i<= N ; i++ )
	{
		scanf("%d %d", &x, &y ) ;
		x-- ; y-- ;
		s |= (1<<code[x][y] ) ;
	}

	int mx = (1<<(code[R-1][C-1]+1) ) - 1 ;
	
	for(int i= 0 ; i <= mx ; i++ )
	{
		dist[i] = 20 ;

		for(int j = 0 ; j < R ; j++ )
			for(int g = 0 ; g < C ; g++ )
				grid[j][g] = isOn(i,code[j][g] ) ;

		for(int j = 0 ; j <4 ; j++ ) adj[i].pb( get_code(j) ) ;
	}

	dist[s] = 0 ;
	vector<int> fila(1,s) ;
	int ini = 0 ;

	while( ini < sz(fila) )
	{
		int x = fila[ini++] ;

//		printGrid();

		for(auto e : adj[x] )
		{
			if( dist[e] <= dist[x] + 1 ) continue ;
			dist[e] = dist[x] + 1; 
			fila.push_back( e ) ;
		}
	}
	                            
	printf("%d\n", dist[mx] ) ; 
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:57:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |  scanf("%d %d", &R, &C ) ;
      |  ~~~~~^~~~~~~~~~~~~~~~~~
cultivation.cpp:59:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |  scanf("%d", &N ) ;
      |  ~~~~~^~~~~~~~~~~
cultivation.cpp:68:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   68 |   scanf("%d %d", &x, &y ) ;
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24940 KB Output is correct
2 Correct 17 ms 24940 KB Output is correct
3 Correct 17 ms 24940 KB Output is correct
4 Correct 17 ms 24940 KB Output is correct
5 Correct 57 ms 27244 KB Output is correct
6 Correct 55 ms 27244 KB Output is correct
7 Correct 55 ms 27244 KB Output is correct
8 Correct 54 ms 27244 KB Output is correct
9 Correct 19 ms 25068 KB Output is correct
10 Correct 53 ms 27260 KB Output is correct
11 Correct 17 ms 24960 KB Output is correct
12 Correct 17 ms 24940 KB Output is correct
13 Correct 20 ms 25068 KB Output is correct
14 Correct 17 ms 24960 KB Output is correct
15 Correct 55 ms 27244 KB Output is correct
16 Correct 54 ms 27244 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24940 KB Output is correct
2 Correct 17 ms 24940 KB Output is correct
3 Correct 17 ms 24940 KB Output is correct
4 Correct 17 ms 24940 KB Output is correct
5 Correct 57 ms 27244 KB Output is correct
6 Correct 55 ms 27244 KB Output is correct
7 Correct 55 ms 27244 KB Output is correct
8 Correct 54 ms 27244 KB Output is correct
9 Correct 19 ms 25068 KB Output is correct
10 Correct 53 ms 27260 KB Output is correct
11 Correct 17 ms 24960 KB Output is correct
12 Correct 17 ms 24940 KB Output is correct
13 Correct 20 ms 25068 KB Output is correct
14 Correct 17 ms 24960 KB Output is correct
15 Correct 55 ms 27244 KB Output is correct
16 Correct 54 ms 27244 KB Output is correct
17 Runtime error 48 ms 50412 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24940 KB Output is correct
2 Correct 17 ms 24940 KB Output is correct
3 Correct 17 ms 24940 KB Output is correct
4 Correct 17 ms 24940 KB Output is correct
5 Correct 57 ms 27244 KB Output is correct
6 Correct 55 ms 27244 KB Output is correct
7 Correct 55 ms 27244 KB Output is correct
8 Correct 54 ms 27244 KB Output is correct
9 Correct 19 ms 25068 KB Output is correct
10 Correct 53 ms 27260 KB Output is correct
11 Correct 17 ms 24960 KB Output is correct
12 Correct 17 ms 24940 KB Output is correct
13 Correct 20 ms 25068 KB Output is correct
14 Correct 17 ms 24960 KB Output is correct
15 Correct 55 ms 27244 KB Output is correct
16 Correct 54 ms 27244 KB Output is correct
17 Runtime error 48 ms 50412 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 48 ms 50412 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 48 ms 50412 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24940 KB Output is correct
2 Correct 17 ms 24940 KB Output is correct
3 Correct 17 ms 24940 KB Output is correct
4 Correct 17 ms 24940 KB Output is correct
5 Correct 57 ms 27244 KB Output is correct
6 Correct 55 ms 27244 KB Output is correct
7 Correct 55 ms 27244 KB Output is correct
8 Correct 54 ms 27244 KB Output is correct
9 Correct 19 ms 25068 KB Output is correct
10 Correct 53 ms 27260 KB Output is correct
11 Correct 17 ms 24960 KB Output is correct
12 Correct 17 ms 24940 KB Output is correct
13 Correct 20 ms 25068 KB Output is correct
14 Correct 17 ms 24960 KB Output is correct
15 Correct 55 ms 27244 KB Output is correct
16 Correct 54 ms 27244 KB Output is correct
17 Runtime error 48 ms 50412 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -