제출 #1083374

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

stones

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void solve(){
    int n, m; cin >> n >> m;
    int ans = 0;
    if (m >= n){
        ans = m;
        string filled(m, '-');
        vector<int> cnt(m);
        int les_n = (n-1) / 2;

        vector<string> table;
        for(int i = 0; i<n; ++i){
            pair<int, int> what[m];
            for(int j = 0; j < m; ++j) what[j] = {cnt[j], j};
            sort(what, what + m);
            string cur = filled;
            int moore_m = m / 2 + 1;
            for(int j = 0; j < moore_m; ++j){
                cnt[what[j].second]++;
                cur[what[j].second] = '+';
            }
            if (*max_element(ALL(cnt)) <= les_n){
                table.push_back(cur);
                ans++;
            }
            else table.push_back(filled);
        }
        cout << ans << "\n";
        printArr(table, "\n");

    }
    else{
        exit(1);
    }
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

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

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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