Submission #342560

#	Time	Username	Problem	Language	Result	Execution time	Memory
342560		Olerinskiy	Red-blue table (IZhO19_stones)	C++14	100 / 100	43 ms	2412 KiB

stones

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert> 
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template<typename T> ostream& operator<< (ostream& out, const vector<T>& a) {
    for (auto k : a) out << k << " ";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << endl;
    const long long INF = 1e18;
    const long long mod = 2600000069;
    const long long p = 10;
#else
    #define dbg(x) 57
    const long long INF = 1e18;
    const long long mod = 2600000069;  
    const long long p = 179;
#endif

const ld PI = 4 * atan(1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 1010;

char a[N][N];

int solve(int n, int m) {
    int x = ((m - m / 2 - 1) * n) / (n / 2 + 1);
    int ans = n + x;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            a[i][j] = '+';
        }
    }
    int ptr = 0;
    for (int i = 0; i < x; i++) {
        for (int j = 0; j < n / 2 + 1; j++) {
            a[ptr][i] = '-';
            ptr++;
            if (ptr == n) ptr = 0;
        }
    }
    return ans;
}

void solve() {
    int n, m;
    cin >> n >> m;
    int ans;
    int sw = 0;
    if (n >= m) {
        cout << solve(n, m) << "\n";
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << a[i][j];
            }
            cout << "\n";
        }
    } else {
        cout << solve(m, n) << "\n";
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (a[j][i] == '+') cout << '-';
                else cout << '+';
            }
            cout << "\n";
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int q = 1;
    cin >> q;
    while (q--) {
        solve();
    }
}
/*

*/

Compilation message (stderr)

stones.cpp: In function 'void solve()':
stones.cpp:108:9: warning: unused variable 'ans' [-Wunused-variable]
  108 |     int ans;
      |         ^~~
stones.cpp:109:9: warning: unused variable 'sw' [-Wunused-variable]
  109 |     int sw = 0;
      |         ^~

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