Submission #503943

#TimeUsernameProblemLanguageResultExecution timeMemory
503943tmn2005Red-blue table (IZhO19_stones)C++17
27 / 100
50 ms1300 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define ar array #define fr first #define sc second #define vec vector #define ret return #define ins insert #define mk make_pair #define pb push_back #define pf push_front #define pob pop_back #define pof pop_front #define int long long #define pii pair<int,int> #define all(s) s.begin(), s.end() #define allr(s) s.rbegin(), s.rend() #define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0); #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> const int N=1e6+12,INF=1e9,mod = 1e9+7; bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;} int n, m, k, x, y, l, r, o, ans, res, ok, mx, mn = INF; int a, b, c; main(){ NeedForSpeed cin>>o; while(o--){ cin>>n>>m; cout<<max(n, m) + max(0ll, (min(n, m) - min(n, m) / 2 - 1))<<endl; if(n >= m){ for(int i=1; i<=n; i++){ for(int j=1; j<=m; j++){ if(j <= m/2+1)cout<<"+"; else cout<<"-"; } cout<<endl; } } else{ for(int i=1; i<=n; i++){ for(int j=1; j<=m; j++){ if(i <= n/2+1)cout<<"-"; else cout<<"+"; } cout<<endl; } } } return 0; }

Compilation message (stderr)

stones.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~
#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...