Submission #168863

#	Time	Username	Problem	Language	Result	Execution time	Memory
168863		ptreap	Red-blue table (IZhO19_stones)	C++14	0 / 100	143 ms	1400 KiB

stones

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <cmath>
#include <iomanip>
#include <stdio.h>
#include <ctime>
#include <fstream>
#include <chrono>
#define _GLIBCXX_DEBUG
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)x.size()
#define pb push_back;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma GCC optimize "-O3"
typedef int supertype;


using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    int bestI = 0, best = 0;
    for (int i = 0; i <= n; i++) {
        multiset <int> canAdd;
        for (int i = 0; i < (m - (m / 2 + 1)); i++) {
            canAdd.insert(i);
        }
        int now = i;
        for (int j = 0; j < m; j++) {
            int needAdd = max(0LL, n / 2 + 1 - (n - i));
            if (needAdd > 0) {
                auto t = canAdd.lower_bound(needAdd);
                if (t != canAdd.end()) {
                    int nov = *t - needAdd;
                    canAdd.erase(t);
                    if (nov != 0)
                        canAdd.insert(nov);
                    now++;
                }
            }
            else
                now++;
        }
        if (now > best) {
            best = now;
            bestI = i;
        }
    }
    cout << best << endl;
    vector <int> plused(bestI, m / 2 + 1);
    vector <vector <char>> ans(n, vector <char>(m, '-'));
    for (int i = 0; i < bestI; i++) {
        for (int j = 0; j < m; j++) {
            ans[i][j] = '+';
        }
    }
    for (int j = 0; j < best - bestI; j++) {
        int needPlus = n / 2 + 1 - (n - bestI);
        for (int i = 0; i < bestI && needPlus != 0; i++) {
            if (plused[i] - 1 > m - plused[i] + 1) {
                plused[i]--;
                needPlus--;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << ans[i][j];
        }
        cout << endl;
    }
}


signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(NULL));
    //freopen("sort.in", "r", stdin);
    //freopen("sort.in", "r", stdin);

    //int n, m, mask;
    //cin >> n >> m >> mask;
    //print(generate(mask, n, m));
    int tests = 1;
    cin >> tests;
    while (tests--) {
        solve();
    }

    return 0;
}


/*

*/

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