#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
int n=v.size();
for(int i=0; i<n; i++)
cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
vector<T>ans;
for(T t:a)
if(ans.empty() || t!=ans.back())
ans.push_back(t);
return ans;
}
ll ceil(ll a,ll b){
ll ans=a/b;
if(a%b)ans++;
return ans;
}
ld log (ld a,ld b){return log(b)/log(a);}
ll power(ll base, ll exp,ll M=1e18){//(base^exp)%M
ll ans=1;
while(exp){
if(exp%2==1)ans=((ans%M)*(base%M))%M;
base=((base%M)*(base%M))%M;
exp/=2;
}
return ans;
}
string to_base(int n,int new_base){
string s;
int nn=n;
while(nn){
s+=to_string(nn%new_base);
nn/=new_base;
}
reverse(all(s));
return s;
}
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(b==0)return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll x= (a/gcd(a,b));
return b*x;
}
vl generate_array(ll n,ll mn=1,ll mx=1e18+1){
if(mx==1e18+1)
mx=n;
vl ans(n);
for(int i=0; i<n;i++)
ans[i]=(mn+rand()%(mx-mn+1));
return ans;
}
string substr(string s,int l,int r){
string ans;
for(int i=l; i<=r; i++)
ans+=s[i];
return ans;
}
void solve();
int main(){
GLHF;
int t=1;
cin >> t;
while(t--)
solve();
}
int chk(int x,int y,int n,int m){
x++,y++;
int ans=m-y;
if(y>m-y)
ans+=x;
if(x<n-x)
ans+=y;
return ans;
}
void solve() {
int n,m;
cin >> n >> m;
vector<string>ans=vector<string>(n,string(m,'-'));
int bst=m;
for(int i=0; i<=n-1; i++)
for(int j=0; j<=m-1; j++){
vector<string>cur(n,string(m,'-'));
for(int ii=0; ii<=i; ii++)
for(int jj=0; jj<=j; jj++)
cur[ii][jj]='+';
/*for(string s:cur)
cout << s << "\n";
cout << "\n";
*/
if(chk(i,j,n,m)>bst)
ans=cur,bst=chk(i,j,n,m);
}
cout << bst << "\n";
for(string s:ans)
cout << s << "\n";
}
Compilation message
stones.cpp: In function 'std::vector<_Tp> UNQ(std::vector<_Tp>)':
stones.cpp:51:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
51 | for(T t:a)
| ^~~
stones.cpp:54:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
54 | return ans;
| ^~~~~~
stones.cpp: In function 'void solve()':
stones.cpp:133:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
133 | for(int ii=0; ii<=i; ii++)
| ^~~
stones.cpp:140:17: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
140 | if(chk(i,j,n,m)>bst)
| ^~
stones.cpp: In function 'void usaco(std::string)':
stones.cpp:39:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
39 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
stones.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
40 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
304 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
304 KB |
Output is correct |
| 3 |
Correct |
8 ms |
332 KB |
Output is correct |
| 4 |
Incorrect |
27 ms |
384 KB |
Wrong answer in test 5 29: 31 < 32 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2062 ms |
612 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2067 ms |
380 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
304 KB |
Output is correct |
| 3 |
Correct |
8 ms |
332 KB |
Output is correct |
| 4 |
Incorrect |
27 ms |
384 KB |
Wrong answer in test 5 29: 31 < 32 |
