Submission #1305696

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305696		peteza	Red-blue table (IZhO19_stones)	C++20	69 / 100	6 ms	4428 KiB

stones

#include <bits/stdc++.h>
using namespace std;

int t, n, m;

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cin >> t;
    while(t--) {
        cin >> n >> m;
        int swapped = 0;
        if(!(n&1)) {swapped = 1; swap(n, m);}
        pair<int, int> ans(-1, -1);
        int sum = (n)/2+1;
        for(int R=0;R<=n;R++) {
            if(n-R>=sum) {
                ans = max(ans, make_pair(R+m, R)); 
                continue;
            }
            ans = max(ans, make_pair((int)min((R/(sum-n+R))*1ll*((m-1)/2), m*1ll)+R, R));
        }
        cout << ans.first << '\n';
        //cout << ans.first << ' ' << ans.second << '\n';
        int magic = 0;
        vector<string> anss;
        for(int i=1;i<=ans.second;i++) {
            string toprint = string(m, '+');
            if(n-ans.second >= sum) {
                anss.push_back(toprint);
                //cout << toprint << '\n';
                continue;
            }
            int tochange = ((m-1)/2);
            for(int j=0;j<tochange;j++) {
                toprint[(j+magic)%m] = '-';
            }
            if(i%(sum-n+ans.second) == 0) magic += (m-1)/2;
            anss.push_back(toprint);
            //cout << toprint << '\n';
        }
        for(int i=ans.second+1;i<=n;i++) {
            anss.push_back(string(m,'-'));
            //cout << string(m, '-') << '\n';
        }
        if(swapped) {
            swap(n, m);
            for(int j=0;j<n;j++) {
                for(int i=0;i<m;i++) {
                    cout << (anss[i][j] == '+' ? '-' : '+');
                }
                cout << '\n';
            }
        } else for(auto &e:anss) cout << e << '\n';
    }
}

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