Submission #908542

#	Time	Username	Problem	Language	Result	Execution time	Memory
908542		SalihSahin	Red-blue table (IZhO19_stones)	C++14	0 / 100	66 ms	1364 KiB

stones

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
using namespace std;
 
const int mod = 1e9 + 7;
const int inf = 1e12*2;
const int N = 2e5 + 5;
 
int32_t main(){
    cin.tie(0); cout.tie(0);
    ios_base::sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--){
        int n, m;
        cin>>n>>m;
        int type1 = n + ((m - (m/2 + 1)) * n) / (n/2 + 1);
        int type2 = m + ((n - (n/2 + 1)) * m) / (m/2 + 1);

        cout<<max(type1, type2)<<endl;

        if(type1 >= type2){
            vector<vector<char> > a(n, vector<char>(m, '+'));
            priority_queue<pair<int, int> > pq;
            for(int i = 0; i < n; i++){
                pq.push(mp(0LL, i));
            }

            int cnt = n/2 + 1;
            int limit = m - (m/2 + 1);

            for(int j = 0; j < m; j++){
                for(int i = 0; i < cnt; i++){
                    if(!pq.size()) break;
                    int xc = pq.top().first * (-1), pos = pq.top().second;
                    a[pos][j] = '-';
                    xc++;
                    pq.pop();
                    if(xc < limit) pq.push(mp(xc * (-1), pos));
                }
            }

            for(int i = 0; i < n; i++){
                for(int j = 0; j < m; j++){
                    cout<<a[i][j];
                }
                cout<<endl;
            }
        }
        else{
            vector<vector<char> > a(n, vector<char>(m, '+'));
            priority_queue<pair<int, int> > pq;
            for(int i = 0; i < n; i++){
                pq.push(mp(0LL, i));
            }

            int cnt = n/2 + 1;
            int limit = m - (m/2 + 1);

            for(int j = 0; j < m; j++){
                for(int i = 0; i < cnt; i++){
                    if(!pq.size()) break;
                    int xc = pq.top().first * (-1), pos = pq.top().second;
                    a[pos][j] = '-';
                    xc++;
                    pq.pop();
                    if(xc < limit) pq.push(mp(xc * (-1), pos));
                }
            }

            for(int i = 0; i < n; i++){
                for(int j = 0; j < m; j++){
                    cout<<a[i][j];
                }
                cout<<endl;
            }
        }
    }
    return 0;
}

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