제출 #602349

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

stones

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 1000

lli n,m,t,mejor,lim,f,c,b,a,ini,todo;
pair<lli,lli> cant;
char res[MAX+2][MAX+2];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> t;
    rep(i,1,t) {

        cin >> n >> m;
        mejor = 0;
        f = n / 2;
        f++;
        c = m / 2;
        c++;
        lim = n*m;

        repa(i,n,0) {
            repa(j,m,0) {
                a = i*c;
                a += j*f;
                a += (n-i)*(m-j);
                b = i + j;

                if (a > lim) continue;
                if (b <= mejor) break;

                mejor = b;
                cant = {i,j};
            }
        }

        rep(i,1,n) {
            rep(j,1,m) res[i][j] = '-';
        }

        ini = 1;
        c -= m - cant.second;

        rep(i,1,cant.first) {
            rep(j,1,c) {
                res[i][ini] = '+';
                ini++;
                if (ini > cant.second) ini = 1;
            }
            rep(j,cant.second+1,m) res[i][j] = '+';
        }

        cout << mejor << "\n";
        rep(i,1,n) {
            rep(j,1,m) cout << res[i][j];
            cout << "\n";
        }
    }
}

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