oj.uz

답안 #648418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648418 2022-10-06T11:22:59 Z mychecksedad Red-blue table (IZhO19_stones) C++17
0 / 100
 27 ms 1296 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;


int n, m;
void solve(){
    cin >> n >> m;
    if(n==1){
        cout << m << '\n';
        for(int i = 0; i < m; ++i) cout << '+' << '\n';
    }else if(m==1){
        cout << n << '\n';
        for(int i = 0; i < n; ++i) cout << '-' << '\n';
    }else{
        cout << (n-1)/2*2 + (m-1)/2*2 << '\n';
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < m; ++j){
                if(i >= (n-1)/2*2) cout << '-';
                else if(i < (n-1)/2){
                    if(j < (m-1)/2) cout << '-';
                    else cout << '+';
                }else{
                    if(j < (m-1)/2) cout << '+';
                    else if(j < (m-1)/2*2) cout << '-';
                    else cout << '+';
                }
            }
            cout << '\n';
        }
    }
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:53:16: warning: variable 'aa' set but not used [-Wunused-but-set-variable]
   53 |     int T = 1, aa;
      |                ^~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB in the table A+B is not equal to 2
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 1236 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 1296 KB in the table A+B is not equal to 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Wrong answer
2 Halted 0 ms 0 KB -