제출 #424765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424765		egekabas	Red-blue table (IZhO19_stones)	C++14	27 / 100	36 ms	2236 KiB

stones

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, m, rev;
int ans[1009][1009];
int tmp[1009][1009];
int cur[1009];
void solve(){
    cin >> n >> m;
    rev = 0;
    if(n > m){
        rev = 1;
        swap(n, m);
    }
    for(int i = 0; i < n; ++i)
        cur[i] = 0;
    for(int j = 0; j < m; ++j){
        int need = (n+2)/2;
        for(int i = 0; i < n; ++i){
            if(cur[i] > m/2 || n-i == need){
                --need;
                ans[i][j] = 0;
            }
            else{
                ++cur[i];
                ans[i][j] = 1;
            }
        }
    }
    int totval = m;
    for(int i = 0; i < n; ++i)
        if(cur[i] > m/2)
            ++totval;
    if(rev){
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
                tmp[j][i] = ans[i][j];
        swap(n, m);
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
                ans[i][j] = tmp[i][j];
    }
    cout << totval << '\n';
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < m; ++j){
            if(ans[i][j]^rev)
                cout << '+';
            else
                cout << '-';
        }
        cout << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    int t;
    cin >> t;
    while(t--)
        solve();
    
}

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