oj.uz

답안 #683643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683643 2023-01-19T04:24:16 Z nwgnbtb Red-blue table (IZhO19_stones) C++14
27 / 100
 23 ms 1384 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back // kak push_back 5
#define endl '\n'
#define FOR(i,start,end) for(int i = start;i < end;i ++)
const ll mxn = 1e6;
ll n,m,a[mxn];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll tt = 1;
    cin >> tt;   
    while(tt --){
        ll n,m,ans = 0;
        cin >> n >> m;
        if(n >= m){
            if(n == 1){
                cout << 1 << endl << '+' << endl;
                continue;
            }
            if(m == 1){
                cout << n << endl;
                for(int i = 0;i < n;i ++) cout << '+' << endl;
                continue;
            }
            char a[n][m];
            cout << n + (m - 2) / 2 + (m - 2) % 2 << endl;
            for(int i = 0;i < n;i ++){
                cout<<'+';
                for(int j = 1;j < m - 1;j ++){
                    if(j % 2 == 1) cout << '-';
                    else cout << '+';
                }
                cout << '+' << endl;
            }
        }
        else{
            if(m == 1){
                cout << 1 << endl << '-' << endl;
                continue;
            }
            if(n == 1){
                cout << m << endl;
                for(int i = 0;i < m;i ++) cout << '-';
                cout << endl;
                continue;
            }
            char a[n][m];
            cout << m + (n - 2) / 2 + (n - 2) % 2 << endl;
            for(int i = 0;i < n;i ++){
                for(int j = 0;j < m;j ++){
                    if(i == 0 || i == n - 1){
                        cout << '-';
                    }
                    else if(i % 2 == 1) cout << '+';
                    else cout << '-';
                }
                cout << endl;
            }
        }
    }
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:28:18: warning: unused variable 'a' [-Wunused-variable]
   28 |             char a[n][m];
      |                  ^
stones.cpp:50:18: warning: unused variable 'a' [-Wunused-variable]
   50 |             char a[n][m];
      |                  ^
stones.cpp:16:16: warning: unused variable 'ans' [-Wunused-variable]
   16 |         ll n,m,ans = 0;
      |                ^~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 2 ms 340 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 1384 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 1324 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 2 ms 340 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -