Submission #424136

#	Time	Username	Problem	Language	Result	Execution time	Memory
424136		doowey	Red-blue table (IZhO19_stones)	C++14	27 / 100	50 ms	1344 KiB

stones

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 1010;


vector<vector<char>> get(int n, int m, int &sol){
    sol = n;
    vector<vector<char>> sos;
    sos.resize(n);
    for(int i = 0 ; i < n; i ++ ){
        for(int j = 0 ; j < m ; j ++ ){
            sos[i].push_back('-');
        }
    }
    for(int i = 0 ; i < n; i ++ ){
        for(int j = 0; j < (m + 2) / 2; j ++ ){
            sos[i][j] = '+';
        }
    }
    int mod = (n+2)/2;
    int xx = 0;
    if(m > 2)
        sol += (m+1)/2-1;
    for(int take = 0 ; take < (m-3)/2; take ++ ){
        xx = take;
        for(int j = 0; j < mod; j ++ ){
            sos[j][take] = '-';
            sos[j][xx + (m+1)/2] = '+';
            xx ++ ;
            xx %= m/2;
        }
    }
    return sos;
}

void solve(){
    int n, m;
    cin >> n >> m;
    if(n >= m){
        int res = 0;
        vector<vector<char>> cc = get(n, m, res);
        cout << res << "\n";
        for(auto x : cc){
            for(auto y : x){
                cout << y;
            }
            cout << "\n";
        }
    }
    else{
        int res = 0;
        vector<vector<char>> cc = get(m, n, res);
        cout << res << "\n";
        for(int i = 0 ; i < n; i ++ ){
            for(int j = 0 ; j < m ; j ++ ){
                if(cc[j][i] == '-'){
                    cc[j][i] = '+';
                }
                else{
                    cc[j][i] = '-';
                }
                cout << cc[j][i];
            }
            cout << "\n";
        }

    }
}

int main(){
    fastIO;
    //freopen("in.txt","r",stdin);
    int tc;
    cin >> tc;
    for(int iq = 1; iq <= tc; iq ++ ){
        solve();
    }
    return 0;
}

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