제출 #329077

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

stones

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>


using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


int mat[1005][1005];


void solve(){
    int n,m;
    cin >> n >> m;
    int p1 = n + (m - 1) / 2;
    int p2 = m + (n - 1) / 2;
    if(p1 > p2){
        cout << p1 << "\n";
        ff(i,1,n){
            ff(j,1,m){
                if(j <= (m-1)/2)cout << '-';
                else cout << '+';
            }
            cout << "\n";
        }
    }
    else{
        cout << p2 << "\n";
        ff(i,1,n){
            ff(j,1,m){
                if(i <= (n-1)/2)cout << '+';
                else cout << '-';
            }
            cout << "\n";
        }
    }
}

int main()
{

    ios_base::sync_with_stdio(false); cin.tie(0);

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

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp: In function 'void solve()':
stones.cpp:6:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
stones.cpp:33:9: note: in expansion of macro 'ff'
   33 |         ff(i,1,n){
      |         ^~
stones.cpp:6:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
stones.cpp:34:13: note: in expansion of macro 'ff'
   34 |             ff(j,1,m){
      |             ^~
stones.cpp:6:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
stones.cpp:43:9: note: in expansion of macro 'ff'
   43 |         ff(i,1,n){
      |         ^~
stones.cpp:6:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    6 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
stones.cpp:44:13: note: in expansion of macro 'ff'
   44 |             ff(j,1,m){
      |             ^~

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