Submission #341374

#	Time	Username	Problem	Language	Result	Execution time	Memory
341374		Dilshod_Imomov	Red-blue table (IZhO19_stones)	C++17	17 / 100	34 ms	1516 KiB

stones

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second
 
using namespace std;
 
const int N = 1e3 + 7;
const int mod = 1e9 + 7;

char a[N][N];
int cnt[N];

void solve() {
    int n, m;
    cin >> n >> m;
    if ( n + (m - (m + 2) / 2) + (m == 5) >= m + (n - (n + 2) / 2) + (n == 5) ) {
        for ( int i = 1; i <= n; i++ ) {
            for ( int j = 1; j <= m; j++ ) {
                if ( j <= (m + 2) / 2 ) {
                    a[i][j] = '+';
                }
                else {
                    a[i][j] = '-';
                }
            }
        }
        int t = n + (m - (m + 2) / 2);
        if ( m == 5 ) {
            for ( int i = 1; i <= (n + 2) / 2; i++ ) {
                a[i][3] = '-';
                a[i][4] = '+';
            }
            for ( int i = 1; i <= (n + 2) / 4; i++ ) {
                a[i][4] = '-';
                a[i][5] = '+';
            }
            t++;
        }
        cout << t << '\n';
    }
    else {
        for ( int i = 1; i <= n; i++ ) {
            for ( int j = 1; j <= m; j++ ) {
                if ( i <= (n + 2) / 2 ) {
                    a[i][j] = '-';
                }
                else {
                    a[i][j] = '+';
                }
            }
        }
        int t = m + (n - (n + 2) / 2);
        if ( n == 5 ) {
            for ( int i = 1; i <= (m + 2) / 2; i++ ) {
                a[4][i] = '-';
                a[3][i] = '+';
            }
            for ( int i = 1; i <= (m + 2) / 4; i++ ) {
                a[5][i] = '-';
                a[4][i] = '+';
            }
            t++;
        }
        cout << t << '\n';
    }
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = 1; j <= m; j++ ) {
            cout << a[i][j];
        }
        cout << '\n';
    }
}

int32_t main() {
    speed; 
    int T = 1;
    cin >> T;
    while ( T-- ) {
        solve();
    }   
}

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