oj.uz

답안 #286725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
286725 2020-08-30T19:45:44 Z errorgorn Red-blue table (IZhO19_stones) C++14
15 / 100
 36 ms 1920 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
char grid[1005][1005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	int TC;
	cin>>TC;
	while (TC--){
		cin>>n>>m;
		
		if (n>m){
			rep(x,0,n) rep(y,0,n) grid[x][y]='+';
			
			int num=m*((n-1)/2);
			int pos=0,curr=0;
			rep(x,0,num){
				grid[x%n][pos]='-';
				curr++;
				if (curr>n-curr){
					curr=0;
					pos++;
				}
			}
			cout<<n+pos<<endl;
		}
		else{
			rep(x,0,n) rep(y,0,m) grid[x][y]='-';
			
			int num=n*((m-1)/2);
			int pos=0,curr=0;
			rep(x,0,num){
				grid[pos][x%m]='+';
				curr++;
				if (curr>m-curr){
					curr=0;
					pos++;
				}
			}
			cout<<m+pos<<endl;
		}
		
		rep(x,0,n){
			rep(y,0,m) cout<<grid[x][y];	
			cout<<endl;
		}
	}
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB in the table A+B is not equal to 47

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 36 ms 1400 KB in the table A+B is not equal to 117
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 1504 KB Output is correct
2 Correct 29 ms 1920 KB Output is correct
3 Correct 26 ms 1656 KB Output is correct

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -