oj.uz

답안 #448672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448672 2021-07-31T14:41:38 Z NhatMinh0208 Red-blue table (IZhO19_stones) C++14
100 / 100
 46 ms 5128 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b,mi,mj,mx;
int arr[1001][1001];
// int mx,mx_seed;
int main()
{
	fio;
    cin>>t;
    for (t1=0;t1<t;t1++)
    {
        cin>>n>>m;
        mx=0;
        for (i=0;i<=n;i++)
        for (j=0;j<=m;j++)
        {
            u=m/2+1;
            u-=m-j;
            u*=i;
            v=n/2;
            if (n%2==0) v--;
            v*=j;
            // cout<<i<<' '<<j<<' '<<u<<' '<<v<<endl;
            if ((u<=v)and(mx<i+j))
            {
                mx=i+j;
                mi=i;
                mj=j;
            }
        }
        for (i=0;i<n;i++)
        {
            for (j=0;j<m;j++)
            {
                arr[i][j]=0;
            }
        }
        for (i=0;i<mi;i++)
        {
            for (j=mj;j<m;j++)
            {
                arr[i][j]=1;
            }
        }
        u=m/2+1;
        u-=m-mj;
        u*=mi;
        // cout<<u<<' '<<mi<<' '<<mj<<endl;
        for (i=0;i<u;i++)
        {
            // cout<<i<<' '<<i/(u/mi)<<' '<<i%mj<<endl;
            arr[i/(u/mi)][i%mj]=1;
        }
        cout<<mx<<endl;
        for (i=0;i<n;i++)
        {
            for (j=0;j<m;j++) if (arr[i][j]) cout<<'+'; else cout<<'-';
            cout<<endl;
        }

    }

}
// Normie28

Compilation message

stones.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 0 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 4 ms 460 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 1676 KB Output is correct
2 Correct 37 ms 4056 KB Output is correct
3 Correct 36 ms 4752 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 1820 KB Output is correct
2 Correct 34 ms 3908 KB Output is correct
3 Correct 35 ms 3372 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 44 ms 1676 KB Output is correct
6 Correct 37 ms 4056 KB Output is correct
7 Correct 36 ms 4752 KB Output is correct
8 Correct 46 ms 1820 KB Output is correct
9 Correct 34 ms 3908 KB Output is correct
10 Correct 35 ms 3372 KB Output is correct
11 Correct 10 ms 588 KB Output is correct
12 Correct 39 ms 4164 KB Output is correct
13 Correct 35 ms 4560 KB Output is correct
14 Correct 27 ms 3916 KB Output is correct
15 Correct 42 ms 5128 KB Output is correct
16 Correct 36 ms 4152 KB Output is correct
17 Correct 16 ms 3268 KB Output is correct