oj.uz

답안 #781396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781396 2023-07-13T05:16:32 Z ZHIRDILBILDIZ Red-blue table (IZhO19_stones) C++14
27 / 100
 54 ms 340 KB 
#include<bits/stdc++.h>
using namespace std ;
int main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    int t ;
    cin >> t ;
    while(t--)
    {
        int n, m, mx = 0 ;
        cin >> n >> m ;
        char c[n][m], ans[n][m] ;
        if(n * m <= 16)
        {
            for(int x = 0 ; x < (1 << (n * m)) ; x++)
            {
                int st[m] = {}, str[n] = {}, sum = 0 ;
                for(int i = 0 ; i < n ; i++)
                    for(int j = 0 ; j < m ; j++)
                        if(x & (1 << (i * m + j)))
                        {
                            str[i]++ ;
                            c[i][j] = '+' ;
                        }
                        else
                        {
                            st[j]++ ;
                            c[i][j] = '-' ;
                        }
                for(int i = 0 ; i < n ; i++)
                    if(str[i] > m / 2)sum++ ;
                for(int i = 0 ; i < m ; i++)
                    if(st[i] > n / 2)sum++ ;
                if(mx < sum)
                {
                    for(int i = 0 ; i < n ; i++)
                        for(int j = 0 ; j < m ; j++)
                            ans[i][j] = c[i][j] ;
                }
                mx = max(mx, sum) ;
            }
            cout << mx << '\n' ;
            for(int i = 0 ; i < n ; i++)
            {
                for(int j = 0 ; j < m ; j++)
                    cout << ans[i][j] ;
                cout << '\n' ;
            }
            continue ;
        }
        if(n % 2 && m % 2)
        {
        }
        if(min(n, m) == 1)
        {
            if(n == 1)
            {
                cout << m << '\n' ;
                for(int i = 0 ; i < m ; i++)
                    ans[0][i] = '-' ;
            }
            else
            {
                cout << n << '\n' ;
                for(int i = 0 ; i < n ; i++)
                    ans[i][0] = '+' ;
            }
            for(int i = 0 ; i < n ; i++)
            {
                for(int j = 0 ; j < m ; j++)
                    cout << ans[i][j];
                cout << '\n' ;
            }
            continue ;
        }
        if(min(n, m) == 2)
        {
            if(n == 2)
            {
                cout << m << '\n' ;
                for(int i = 0 ; i < n ; i++)
                    for(int j = 0 ; j < m ; j++)
                        ans[i][j] = '-' ;
            }
            else
            {
                cout << n << '\n' ;
                for(int i = 0 ; i < n ; i++)
                    for(int j = 0 ; j < m ; j++)
                        ans[i][j] = '+' ;
            }
            for(int i = 0 ; i < n ; i++)
            {
                for(int j = 0 ; j < m ; j++)
                    cout << ans[i][j];
                cout << '\n' ;
            }
            continue ;
        }
        if(min(n, m) == 3)
        {
            if(n == 3)
            {
                for(int i = 0 ; i < n - 1 ; i++)
                    for(int j = 0 ; j < m ; j++)
                        ans[i][j] = '-' ;
                for(int i = 0 ; i < m ; i++)
                    ans[n - 1][i] = '+' ;
            }
            else
            {
                for(int i = 0 ; i < n ; i++)
                    for(int j = 0 ; j < m - 1 ; j++)
                        ans[i][j] = '+' ;
                for(int i = 0 ; i < n ; i++)
                    ans[i][m - 1] = '-' ;
            }
            cout << max(n, m) + 1 << '\n' ;
            for(int i = 0 ; i < n ; i++)
            {
                for(int j = 0 ; j < m ; j++)
                    cout << ans[i][j] ;
                cout << '\n' ;
            }
            continue ;
        }
    }
    return 0 ;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 212 KB Output is correct
3 Correct 40 ms 324 KB Output is correct
4 Incorrect 54 ms 320 KB Wrong answer
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 340 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 212 KB Output is correct
3 Correct 40 ms 324 KB Output is correct
4 Incorrect 54 ms 320 KB Wrong answer
5 Halted 0 ms 0 KB -