Submission #330707

#TimeUsernameProblemLanguageResultExecution timeMemory
330707tavhidRed-blue table (IZhO19_stones)C++14
0 / 100
55 ms1388 KiB
#include <bits/stdc++.h> //#pragma GCC optimize("Ofast") //1.0 * clock() / CLOCKS_PER_SEC #define fi first #define se second #define ll long long int #define dl double long using namespace std; const int N = 1e6 + 7; const ll INF = 1e10 + 7; const int mod = 998244353; //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void solve1() { int n, m; char a = '+', b = '-'; bool f = false; cin >> n >> m; if(n < m){ swap(a, b); f = true; } int k = (min(n, m) * max(n, m)) - (min(n, m) / 2 + 1) * max(n, m); cout << max(n, m) + k / ((max(n, m) + 1) / 2) << endl; char ar[n][m]; for(int i = 0; i < k / n && f; i++){ for(int j = 0; j < m; j++){ ar[i][j] = b; } } for(int i = 0; i < n; i++){ for(int j = 0; j < k / m && !f; j++){ ar[i][j] = b; } } for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(ar[i][j] != b){ cout << a; }else{ cout << b; } } cout << endl; } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); srand(time(0)); //freopen( "input.txt" , "r" , stdin ); //freopen( "output.txt" , "w" , stdout ); //freopen( "cupboard.in" , "r" , stdin ); //freopen( "cupboard.out" , "w" , stdout ); int cghf = 1;cin >> cghf; while( cghf-- ){ solve1(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...