oj.uz

Submission #919552

# Submission time Handle Problem Language Result Execution time Memory
919552 2024-02-01T06:19:26 Z manizare Red-blue table (IZhO19_stones) C++14
27 / 100
 17 ms 1368 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3,unroll-loops")
#pragma GCC target("avx2") 
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define int long long 
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ; 
using namespace std ;   
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 10 , maxm = 1e6+10 , lg = 18 , inf= 1e18 , mod = 998244353 ;

signed main(){
	ios_base::sync_with_stdio(false);cin.tie(0);
    int t ;
    cin >>  t;
    while(t--){
        int n , m ;
        cin >> n >> m ;
        if(n+(m-1)/2 >= m+(n-1)/2){
            cout << n+(m-1)/2 << "\n"; 
            rep(i , 1, n){
                rep(j ,1 , m){
                    if(j%2==1 || j == m){
                        cout << "+" ;
                    }else {
                        cout << "-" ; 
                    }
                }
                cout << "\n"; 
            }
        }else{
            cout << m+(n-1)/2 << "\n"; 
            rep(i , 1 ,n){
                rep(j , 1, m){
                    if(i%2==0 && i != n){
                        cout << "+" ;;
                    }else{
                        cout << "-" ;
                    }
                }
                cout << "\n"; 
            }
        }
    }
}
/*
    
*/

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Incorrect 1 ms 344 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 1368 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1292 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Incorrect 1 ms 344 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -