oj.uz

Submission #498846

# Submission time Handle Problem Language Result Execution time Memory
498846 2021-12-26T12:54:49 Z alimurodov Red-blue table (IZhO19_stones) C++14
27 / 100
 37 ms 1188 KB 
#include <bits/stdc++.h>

using namespace std;

void solve(){
	int n, m;	
    cin >> n >> m;
    
    if(n >= 3 && m >= 3){
    	if(n < m){
    		int s = m;
    		char a[100][100];
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    				a[i][j] = '-';
    			}
    		}
    		
    		if(n % 2 && m % 2){
    			s += n / 2;
	    		for(int i = 0; i < n / 2; i++){
	    			for(int j = 0; j < m / 2 + 1; j++){
	    				a[i][j] = '+';
	    			}
	    		}
			}else if(n % 2 && m % 2 == 0){
    			s += n / 2;
	    		for(int i = 0; i < n / 2; i++){
	    			for(int j = 0; j < m / 2 + 1; j++){
	    				a[i][j] = '+';
	    			}
	    		}
			}else if(n % 2 == 0 && m % 2){
    			s += n / 2;
	    		for(int i = 0; i < n / 2; i++){
	    			for(int j = 0; j < m / 2 + 1; j++){
	    				a[i][j] = '+';
	    			}
	    		}
			} else{
				s += n / 2;
				for(int i = 0; i < n / 2; i++){
	    			for(int j = 0; j < m / 2 + 1; j++){
	    				a[i][j] = '+';
	    			}
	    		}
			}
			
			cout << s << '\n';
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    				cout << a[i][j];
    			}
    			cout << '\n';
    		}
		}
		else{
			int s = n;
    		char a[100][100];
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    				a[i][j] = '+';
    			}
    		}
    		
    		if(n % 2 && m % 2){
    			s += m / 2;
	    		for(int i = 0; i < n / 2 + 1; i++){
	    			for(int j = 0; j <= m / 2 - 1; j++){
	    				a[i][j] = '-';
	    			}
	    		}
			}else if(n % 2 && m % 2 == 0){
    			s += m / 2 - 1;
	    		for(int i = 0; i < n / 2 + 1; i++){
	    			for(int j = 0; j < m / 2 - 1; j++){
	    				a[i][j] = '-';
	    			}
	    		}
			}else if(n % 2 == 0 && m % 2){
    			s += m / 2;
	    		for(int i = 0; i < n / 2 + 1; i++){
	    			for(int j = 0; j < m / 2; j++){
	    				a[i][j] = '-';
	    			}
	    		}
			} else{
				s += n / 2 - 1;
				for(int i = 0; i < n / 2 + 1; i++){
	    			for(int j = 0; j < m / 2 - 1; j++){
	    				a[i][j] = '-';
	    			}
	    		}
			}
    		cout << s << '\n';
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    				cout << a[i][j];
    			}
    			cout << '\n';
		}
    		
    	}	
    } else{
    	if(n < m){
    		cout << m << '\n';
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    				cout << '-';
    			}
    			cout << '\n';
    		}
    	} else{	
    		cout << n << '\n';
    		for(int i = 0; i < n; i++){
    			for(int j = 0; j < m; j++){
    					cout << '+';
    				}
    				cout << '\n';
    			}
    	}
    }
}

int main(){
    int t;
    cin >> t;
    
    while(t--)
    	solve();
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Incorrect 3 ms 332 KB in the table A+B is not equal to 27

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 1188 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Incorrect 3 ms 332 KB in the table A+B is not equal to 27