제출 #1122655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122655		Mher777	Red-blue table (IZhO19_stones)	C++17	100 / 100	206 ms	3236 KiB

stones

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

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

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 1005;
char ans[N][N], anss[N][N];
int n, m;
set<pii> st;

int solv() {
    st.clear();
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            ans[i][j] = anss[i][j] = '-';
            if (i == 1) {
                st.insert({ 0,j });
            }
        }
    }
    int answ = m;
    int cnt = m / 2 + 1, cur;
    int until = 0;
    vector<pii> del;
    int new_ans = answ;
    for (int i = 1; i <= n; ++i) {
        cur = cnt;
        del.clear();
        ++new_ans;
        while (cur--) {
            if ((*st.rbegin()).ff >= n / 2 + n % 2) {
                auto it = st.end();
                --it;
                del.pub({ (*it).ff + 1,(*it).ss });
                ans[i][(*it).ss] = '+';
                st.erase(it);
                continue;
            }
            auto it = st.begin();
            del.pub({ (*it).ff + 1,(*it).ss });
            if ((*it).ff + 1 == n / 2 + n % 2) {
                --new_ans;
            }
            ans[i][(*it).ss] = '+';
            st.erase(it);
        }
        if (new_ans > answ) {
            answ = new_ans;
            until = i;
        }
        for (auto elem : del) {
            st.insert(elem);
        }
    }
    st.clear();
    for (int j = 1; j <= m; ++j) {
        st.insert({ 0,j });
    }
    for (int i = 1; i <= until; ++i) {
        cur = cnt;
        del.clear();
        while (cur--) {
            if ((*st.rbegin()).ff >= n / 2 + n % 2) {
                auto it = st.end();
                --it;
                del.pub({ (*it).ff + 1,(*it).ss });
                anss[i][(*it).ss] = '+';
                st.erase(it);
                continue;
            }
            auto it = st.begin();
            del.pub({ (*it).ff + 1,(*it).ss });
            anss[i][(*it).ss] = '+';
            st.erase(it);
        }
        for (auto elem : del) {
            st.insert(elem);
        }
    }
    return answ;
}

void slv() {
    cin >> n >> m;
    int answ1 = solv();
    swap(n, m);
    st.clear();
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            ans[i][j] = anss[i][j] = '-';
            if (i == 1) {
                st.insert({ 0,j });
            }
        }
    }
    int answ2 = solv();
    if (answ2 >= answ1) {
        cout << answ2 << '\n';
        for (int j = 1; j <= m; ++j) {
            for (int i = 1; i <= n; ++i) {
                cout << (anss[i][j] == '+' ? '-' : '+');
            }
            cout << '\n';
        }
        return;
    }
    swap(n, m);
    solv();
    cout << answ1 << '\n';
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cout << anss[i][j];
        }
        cout << '\n';
    }
}

void cs() {
    int tstc = 1;
    cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 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