이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;
int n, m;
void solve(){
cin >> n >> m;
if((n-1)/2*2 + (m-1)/2*2 < max(n + (m-1)/2, m + (n-1)/2)){
if(n >= m){
cout << n + (m-1)/2 << '\n';
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j){
cout << (j<(m-1)/2 ? '-' : '+');
}
cout << '\n';
}
}else{
cout << m + (n-1)/2 << '\n';
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j){
cout << (i<(n-1)/2 ? '+' : '-');
}
cout << '\n';
}
}
}else{
cout << (n-1)/2*2 + (m-1)/2*2 << '\n';
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j){
if(i >= (n-1)/2*2) cout << '-';
else if(i < (n-1)/2){
if(j < (m-1)/2) cout << '-';
else cout << '+';
}else{
if(j < (m-1)/2) cout << '+';
else if(j < (m-1)/2*2) cout << '-';
else cout << '+';
}
}
cout << '\n';
}
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
cout << '\n';
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
stones.cpp: In function 'int main()':
stones.cpp:65:16: warning: variable 'aa' set but not used [-Wunused-but-set-variable]
65 | int T = 1, aa;
| ^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |