Submission #1156350

#TimeUsernameProblemLanguageResultExecution timeMemory
1156350AbdullahIshfaqRed-blue table (IZhO19_stones)C++20
100 / 100
16 ms1352 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define MOD 1000000007 void solve(){ ll n , m, a = 0, b = 0; cin >> n >> m; for(int i = 0 ; i <= n; i++){ ll j = m; if(i > (n - 1) / 2){ j = min((i * ((m - 1) / 2)) / (i - (n - 1) / 2), m); } if(i + j > a + b){ a = i; b = j; } } cout << (a + b) << '\n'; for(int i = 0 ;i < n; i++){ for(int j = 0 ; j < m; j++){ if(j >= b){ cout << "+"; } else if(i >= a){ cout << "-"; } else{ if((j - (b - (m - 1) / 2) * i % b + b) % b < b - (m - 1) / 2){ cout << "+"; } else{ cout << "-"; } } } cout << '\n'; } } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int tests = 1; cin >> tests; for(int i = 1; i <= tests; i ++){ solve(); } }
#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...