Submission #206527

#TimeUsernameProblemLanguageResultExecution timeMemory
206527bashRed-blue table (IZhO19_stones)C++17
0 / 100
41 ms1528 KiB
/** SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ== */ #include <cstring> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <queue> #include <cmath> #include <cstdlib> #include <ctime> #include <cassert> #define F first #define S second #define endl '\n' #define deb(x) cout<<#x<<' '<<x<<endl; #define pb push_back using namespace __gnu_pbds; using namespace std; typedef tree< int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; /* #ifdef IZI_KATKA #define int __int64_t #else #define int __int64 #endif */ const long long MOD = 1e9 + 7; typedef long long ll; #define pii pair<int,int> long long readInt() { bool minus1 = false; long long result = 0; char ch; ch = getchar(); while (true) { if (ch == '-') break; if (ch >= '0' && ch <= '9') break; ch = getchar(); } if (ch == '-') minus1 = true; else result = ch-'0'; while (true) { ch = getchar(); if (ch < '0' || ch > '9') break; result = result*10 + (ch - '0'); } if (minus1) return -result; else return result; } const int MAXN = 1111; char ans[MAXN][MAXN]; int col[MAXN]; int a[MAXN]; int nxt(int a, int n) { if (a <= n) { return a; } if (a % n == 0) return n; else return a % n; } int main() { #ifdef IZI_KATKA assert(freopen("input", "r", stdin)); assert(freopen("output", "w", stdout)); #endif int T = readInt(); while(T--) { int n = readInt(), m = readInt(); for (int i = 1; i <= n; i++) { col[i] = 0; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { ans[i][j] = '-'; } } int half_col = ((n + 2) / 2); int half_row = ((m + 2) / 2); int cur = 1; int kek = n; int col = 1; for (int col = 1;; col++) { int next = nxt(cur + half_col, n); if (a[cur] + 1 < half_row && a[next] + 1 < half_row) { if (cur <= next) { for (int j = cur; j <= next; j++) { ans[j][col] = '+'; a[j]++; } } else { for (int j = cur; j <= n; j++) { ans[j][col] = '+'; a[j] ++; } for (int j = 1; j <= next; j++) { ans[j][col] = '+'; a[j] ++; } } kek++; } else { break; } col++; cur = next + 1; } if (kek > max(n, m)) { cout << kek << endl; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cout << ans[i][j]; } cout << endl; } } else { if (n > m) { cout << n << endl; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cout << '+'; } cout << endl; } } else { cout << m << endl; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cout << '-'; } cout << endl; } } } memset(a, 0, sizeof(a)); } return 0; }

Compilation message (stderr)

stones.cpp: In function 'int main()':
stones.cpp:115:10: warning: unused variable 'col' [-Wunused-variable]
      int col = 1;
          ^~~
#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...