oj.uz

Submission #286860

# Submission time Handle Problem Language Result Execution time Memory
286860 2020-08-31T05:52:05 Z dvdg6566 Red-blue table (IZhO19_stones) C++14
11 / 100
 32 ms 1400 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
const int MAXN=1001;
const ll MOD=998244353;

ll A[MAXN][MAXN];
ll R,C,T;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>T;
	while(T--){
		cin>>R>>C;
		assert(R%2==1&&C%2==1);

		if(R==1){
			cout<<C<<'\n';
			for(int i=0;i<C;++i)cout<<'-';cout<<'\n';
			continue;
		}else if(C==1){
			cout<<R<<'\n';
			for(int i=0;i<R;++i){cout<<'+';cout<<'\n';}
			continue;
		}
		cout<<R+C-2<<'\n';

		for(int i=0;i<C;++i)cout<<'-';cout<<'\n';
		int h=C/2;
		for(int i=1;i<R;++i){
			if(i%2==1){
				cout<<'+';
				for(int k=0;k<h;++k)cout<<'+';
				for(int k=0;k<h;++k)cout<<'-';
			}else{
				cout<<'+';
				for(int k=0;k<h;++k)cout<<'-';
				for(int k=0;k<h;++k)cout<<'+';
			}
			cout<<'\n';
		}
		// return 0;
	}	
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:29:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   29 |    for(int i=0;i<C;++i)cout<<'-';cout<<'\n';
      |    ^~~
stones.cpp:29:34: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   29 |    for(int i=0;i<C;++i)cout<<'-';cout<<'\n';
      |                                  ^~~~
stones.cpp:38:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   38 |   for(int i=0;i<C;++i)cout<<'-';cout<<'\n';
      |   ^~~
stones.cpp:38:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   38 |   for(int i=0;i<C;++i)cout<<'-';cout<<'\n';
      |                                 ^~~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Runtime error 1 ms 512 KB Execution killed with signal 11

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 512 KB Execution killed with signal 11

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Runtime error 1 ms 512 KB Execution killed with signal 11

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1400 KB Output is correct
2 Correct 28 ms 1280 KB Output is correct
3 Correct 25 ms 1152 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 528 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Runtime error 1 ms 512 KB Execution killed with signal 11