oj.uz

답안 #147756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147756 2019-08-30T14:49:27 Z leatherman Red-blue table (IZhO19_stones) C++14
27 / 100
 36 ms 2808 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define ll long long
#define ld long double
#define endl "\n"
#define fi first
#define se second
#define y1 sadjfskldf
#define PB push_back
#define sqr(x) ((x) * (x))
#define all(x) x.begin(), x.end()
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

const ll N = 1005;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll Q,n,m,x,a[N][N],b[N][N],ans,y;
void check()
{
    ll l,r,kol = 0;
    for(int i = 1; i <= n; i++)
    {
        l = 0;
        for(int j = 1; j <= m; j++) l += a[i][j];
        r = m - l;
        if(l > r) kol++;
    }
    for(int j = 1; j <= m; j++)
    {
        l = 0;
        for(int i = 1; i <= n; i++) l += a[i][j];
        r = n - l;
        if(r > l) kol++;
    }
    if(kol > ans)
    {
        ans = kol;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++) b[i][j] = a[i][j];
    }
}
void solv_1()
{
    x = n / 2;
    y = m - x;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
        {
            if(j <= x || i % y + (i % y == 0) * (m - x) == j - x) a[i][j] = 1;
            else a[i][j] = 0;
        }
    check();
}
void solv_2()
{
    x = m / 2;
    y = n - x;
    for(int j = 1; j <= m; j++)
        for(int i = 1; i <= n; i++)
        {
            if(i <= x || j % y + (j % y == 0) * (n - x) == i - x) a[i][j] = 0;
            else a[i][j] = 1;
        }
    check();
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>Q;
    while(Q--)
    {
        cin>>n>>m;
        ans = 0;
        if(n > 4 && m > 4)
        {
            solv_1();
            solv_2();
            cout<<ans<<endl;
            for(int i = 1; i <= n; i++)
            {
                for(int j = 1; j <= m; j++) cout<<(b[i][j] ? '+' : '-');
                cout<<endl;
            }
            continue;
        }
        if(n + m - (m / 2 + 1) >= m + n - (n / 2 + 1))
        {
            cout<<n + m - (m / 2 + 1)<<endl;
            for(int i = 1; i <= n; i++)
            {
                for(int j = 1; j <= m; j++)
                {
                    if(j <= m / 2 + 1) cout<<'+';
                    else cout<<'-';
                }
                cout<<endl;
            }
        } else
        {
            cout<< m + n - (n / 2 + 1)<<endl;
            for(int i = 1; i <= n; i++)
            {
                for(int j = 1; j <= m; j++)
                {
                    if(i <= n / 2 + 1) cout<<'-';
                    else cout<<'+';
                }
                cout<<endl;
            }
        }
    }
    return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Incorrect 4 ms 760 KB Wrong answer in test 5 29: 29 < 32

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 2296 KB Wrong answer in test 97 21: 97 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 36 ms 2808 KB Wrong answer in test 24 24: 36 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Incorrect 4 ms 760 KB Wrong answer in test 5 29: 29 < 32