제출 #395791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
395791		CaroLinda	Red-blue table (IZhO19_stones)	C++14	100 / 100	69 ms	2220 KiB

stones

#include <bits/stdc++.h>

#define ll long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
#define sz(x) (int)(x.size())

using namespace std ;

int T , N , M , K ;

int teto(int num, int den) { return (num/den)+( num%den != 0 ) ; }

void solve()
{
	scanf("%d %d", &N, &M ) ;
	K = (N+2)>>1 ;

	vector<int> freq(N,M) ;
	vector< vector<char> > grid( N , vector<char>(M,'+') ) ;

	for(int ans = 1 ; ans <= N+M ; ans++ )
		for(int linhas_zoadas = max(0, ans-M) ; linhas_zoadas <= min(N, ans) ; linhas_zoadas++ )
		{
			int colunas_zoadas = ans-linhas_zoadas ;
			int k_azul = K-linhas_zoadas ;
			int k_verm = K-colunas_zoadas ;
			int worst_line = (N-linhas_zoadas) ? teto( k_azul*(M-colunas_zoadas) , N-linhas_zoadas ) : 0 ;

			if(worst_line*2 >= M) continue ;

			for(int a = 0 ; a < linhas_zoadas ; a++ ) 
				for(int b = 0 ; b < M ; b++ ) grid[a][b] = '-' ;

			for(int a = colunas_zoadas , id = linhas_zoadas ; a < M ; a++ )
			{
				int cnt = k_azul ;
				while(cnt--)
				{
					if(id == N) id = linhas_zoadas ;
					grid[id][a] = '-' ;
					id++ ;
				}
			}

			printf("%d\n", N+M-ans) ;

 			for(int i = 0 ; i < N ; i++ , printf("\n"))
 				for(int j = 0 ; j < M ; j++ ) printf("%c", grid[i][j] ) ;

 			return ;

		}

}

int main()
{
	scanf("%d", &T ) ;
	while(T--) solve() ;
}

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp: In function 'void solve()':
stones.cpp:29:8: warning: unused variable 'k_verm' [-Wunused-variable]
   29 |    int k_verm = K-colunas_zoadas ;
      |        ^~~~~~
stones.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |  scanf("%d %d", &N, &M ) ;
      |  ~~~~~^~~~~~~~~~~~~~~~~~
stones.cpp: In function 'int main()':
stones.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   61 |  scanf("%d", &T ) ;
      |  ~~~~~^~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 10 / 10
• Subtask 3: 16 / 16
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 31 / 31