제출 #1156505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156505		hashimali	Red-blue table (IZhO19_stones)	C++20	15 / 100	14 ms	1648 KiB

stones

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define ld long double
#define pb push_back
#define pf push_front
#define mod 998244353
#define se second
#define fi first
#define all(ls) (ls).begin(),(ls).end()
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
void solve(){
    int n,m;
    cin>>n>>m;
    char grid[n][m];
    int f=!(n<m);
    if(!f)
        swap(n,m);
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++){
            if(f)
                grid[i][j]='+';
            else
                grid[i][j]='-';
        }
    int tot=0,j=n;
    int cnt=(m-1)/2;
    while(cnt--){
        for(int i=0;i<n;i++){
            if(f)
                grid[i][j-n]='-';
            else
                grid[i][j-n]='+';
            if(tot==(n/2)){
                j++;
                tot=0;
            }
            else
                tot++;
        }
    }
    cout<<j<<endl;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++)
            if(f)
                cout<<grid[i][j];
            else
                cout<<grid[j][i];
        cout<<endl;
    }
    cout<<endl;
}  
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    for(int i=1;i<=t;i++){
        // cout<<"Scenario #"<<i<<":"<<" ";
        solve();
    }
}

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