oj.uz

답안 #448630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448630 2021-07-31T09:39:13 Z zaneyu Red-blue table (IZhO19_stones) C++14
100 / 100
 34 ms 5176 KB 
/*input
2
1 3
3 3
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=1e3+5;
const ll maxlg=__lg(maxn)+2; 
int arr[maxn][maxn];
void solve(){
    int n,m;
    cin>>n>>m;
    bool f=0;
    if(n<m){
        f=1;
        swap(n,m);
    }
    REP(i,n) REP(j,m) arr[i][j]=0;
    int cur=n/2;
    int ans=0;
    REP(i,(m-1)/2){
        REP(j,n){
            arr[j][ans]=1;
            if(!cur){
                ++ans;
                cur=n/2+1;
            }
            --cur;
        }
    }
    cout<<ans+n<<'\n';
    if(f) swap(n,m);
    REP(i,n){
        REP(j,m){
            cout<<((f?arr[j][i]:!arr[i][j])?'+':'-');
        }
        cout<<'\n';
    }
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int t;
    cin>>t;
    while(t--) solve();
}

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 1692 KB Output is correct
2 Correct 30 ms 4592 KB Output is correct
3 Correct 30 ms 4848 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 1816 KB Output is correct
2 Correct 28 ms 3856 KB Output is correct
3 Correct 25 ms 3276 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 33 ms 1692 KB Output is correct
6 Correct 30 ms 4592 KB Output is correct
7 Correct 30 ms 4848 KB Output is correct
8 Correct 32 ms 1816 KB Output is correct
9 Correct 28 ms 3856 KB Output is correct
10 Correct 25 ms 3276 KB Output is correct
11 Correct 8 ms 588 KB Output is correct
12 Correct 26 ms 4172 KB Output is correct
13 Correct 28 ms 4664 KB Output is correct
14 Correct 21 ms 3824 KB Output is correct
15 Correct 34 ms 5176 KB Output is correct
16 Correct 25 ms 4568 KB Output is correct
17 Correct 12 ms 3276 KB Output is correct