oj.uz

Submission #992862

# Submission time Handle Problem Language Result Execution time Memory
992862 2024-06-05T07:55:46 Z NValchanov Red-blue table (IZhO19_stones) C++17
15 / 100
 27 ms 2392 KB 
#include <bits/stdc++.h>

#define endl '\n'

using namespace std;

typedef long long ll;

const int MAXN = 1e3 + 10;

int n, m;
bool table[MAXN][MAXN];
int ans;
bool sw;

void read()
{
    sw = false;
    cin >> n >> m;
    if(n < m)
    {
        swap(n, m);
        sw = true;
    }
}

void solve()
{
    memset(table, 1, sizeof(table));
    ans = n;
    int j = 1;
    int placed = 0;
    for(int k = 1; k <= (m - 1) / 2; k++)
    {
        for(int i = 1; i <= n; i++)
        {
            table[i][j] = 0;
            
            if(++placed == n / 2 + 1)
            {
                ans++;
                placed = 0;
                j++;
            }
        }
    }
}

void print()
{
    if(!sw)
    {
        cout << ans << endl;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                cout << (table[i][j] ? '+' : '-');
            }
            cout << endl;
        }
    }
    else
    {
        cout << ans << endl;
        for(int j = 1; j <= m; j++)
        {
            for(int i = 1; i <= n; i++)
            {
                cout << (!table[i][j] ? '-' : '+');
            }
            
            cout << endl;
        }
    }
}

int main()
{
    // #ifdef ONLINE_JUDGE
    //     freopen(".in", "r", stdin);
    //     freopen(".out", "w", stdout);
    // #endif

    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

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

    return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1468 KB in the table A+B is not equal to 46
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 2384 KB in the table A+B is not equal to 78
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2392 KB Output is correct
2 Correct 15 ms 2140 KB Output is correct
3 Correct 13 ms 2140 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1368 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -