oj.uz

답안 #343668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343668 2021-01-04T11:01:34 Z mglstew Red-blue table (IZhO19_stones) C++17
27 / 100
 76 ms 1672 KB 
#include <bits/stdc++.h>
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define N 100005
#define ccin cin >>
#define ccout cout <<
 
using namespace std;

char a[2000][2000];
int col[2000];
int row[2000];
     
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    int t;
    ccin t;
    while(t--){
    	int n, m;
    	ccin n >> m;
    	int ans = max(n, m);
    	if(n > m){
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    				a[i][j] = '+';
    				row[i] = m;
    			}
    		}
    		for(int i = 0; i < m; i++){
    			int l = 0;
    			for(int j = 0; j < n; j++){
    				if(l >= n / 2 + 1){
    					break;
    				}
    				if(row[j] - 1 >= m / 2 + 1){
    					a[j][i] = '-';
    					row[j]--;
    					l++;
    				}
    			}
    			if(l == n / 2 + 1){
    				ans++;
    			}
    		}
    			
    	}
    	else{
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    				a[i][j] = '-';
    				col[j] = n;
    			}
    		}
    		for(int i = 0; i < n; i++){
    			int l = 0;
    			for(int j = 0; j < m; j++){
    				if(l >= m / 2 + 1){
    					break;
    				}
    				if(col[j] - 1 >= n / 2 + 1){
    					a[i][j] = '+';
    					col[j]--;
    					l++;
    				}
    			}
    			if(l == m / 2 + 1){
    				ans++;
    			}
    		}
    	}
    	ccout ans << endl;
    	for(int i = 0; i < n; i++){
    		for(int j = 0; j < m; j++){
    			ccout a[i][j];
    		}
    		ccout endl;
    	}
    }
    return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 492 KB Output is correct

Subtask #3
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 11 ms 492 KB Output is correct
4 Incorrect 18 ms 492 KB Wrong answer in test 5 29: 31 < 32

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 76 ms 1516 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 56 ms 1672 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 11 ms 492 KB Output is correct
4 Incorrect 18 ms 492 KB Wrong answer in test 5 29: 31 < 32