oj.uz

Submission #905859

# Submission time Handle Problem Language Result Execution time Memory
905859 2024-01-13T05:26:30 Z vjudge1 Red-blue table (IZhO19_stones) C++17
100 / 100
 21 ms 5288 KB 
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>

#include <bits/stdc++.h>
#include <chrono>
#include <random>

// @author: Vlapos

namespace operators
{
    template <typename T1, typename T2>
    std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
    {
        in >> x.first >> x.second;
        return in;
    }

    template <typename T1, typename T2>
    std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
    {
        out << x.first << " " << x.second;
        return out;
    }

    template <typename T1>
    std::istream &operator>>(std::istream &in, std::vector<T1> &x)
    {
        for (auto &i : x)
            in >> i;
        return in;
    }

    template <typename T1>
    std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
    {
        for (auto &i : x)
            out << i << " ";
        return out;
    }

    template <typename T1>
    std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
    {
        for (auto &i : x)
            out << i << " ";
        return out;
    }
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

// usefull stuff

void boost()
{
    ios_base ::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }

const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};

const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;

// #define int ll

struct test
{
    void solve(int testcase)
    {
        int n, m;
        cin >> n >> m;
        bool flag = 0;
        if (n < m)
        {
            swap(n, m);
            flag = 1;
        }
        int res = n;
        vector<vector<int>> ans(n, vector<int>(m, 1));

        int k = 0, bf = 0;
        for (int cnt = 0; cnt < (m - 1) / 2; ++cnt)
        {
            for (int i = 0; i < n; ++i)
            {
                ans[i][k] = 0;
                bf++;
                if (bf == n / 2 + 1)
                {
                    bf = 0;
                    k++;
                    res++;
                }
            }
        }
        cout << res << "\n";
        if (flag)
        {
            for (int i = 0; i < m; ++i, cout << "\n")
                for (int j = 0; j < n; ++j)
                    if (ans[j][i])
                        cout << "-";
                    else
                        cout << "+";
        }
        else
        {
            for (int i = 0; i < n; ++i, cout << "\n")
                for (int j = 0; j < m; ++j)
                    if (ans[i][j])
                        cout << "+";
                    else
                        cout << "-";
        }
    }
};

main()
{
    boost();
    int q = 1;
    cin >> q;
    for (int i = 0; i < q; i++)
    {
        test t;
        t.solve(i);
    }
    return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
//                                                                                    //
//                               Coded by Der_Vlἀpos                                  //
//                                                                                    //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message

stones.cpp:147:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  147 | main()
      | ^~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1364 KB Output is correct
2 Correct 18 ms 3676 KB Output is correct
3 Correct 19 ms 4044 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1628 KB Output is correct
2 Correct 18 ms 2960 KB Output is correct
3 Correct 15 ms 2144 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 21 ms 1364 KB Output is correct
6 Correct 18 ms 3676 KB Output is correct
7 Correct 19 ms 4044 KB Output is correct
8 Correct 19 ms 1628 KB Output is correct
9 Correct 18 ms 2960 KB Output is correct
10 Correct 15 ms 2144 KB Output is correct
11 Correct 6 ms 604 KB Output is correct
12 Correct 16 ms 2812 KB Output is correct
13 Correct 18 ms 2244 KB Output is correct
14 Correct 20 ms 1444 KB Output is correct
15 Correct 21 ms 5288 KB Output is correct
16 Correct 15 ms 3932 KB Output is correct
17 Correct 9 ms 1968 KB Output is correct