oj.uz

답안 #286730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
286730 2020-08-30T20:03:01 Z errorgorn Red-blue table (IZhO19_stones) C++14
100 / 100
 40 ms 2296 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,m) grid[x][y]='-';
			
			int num=m*((n-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;
		}
		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[x%n][pos]='-';
				curr++;
				if (curr>n-curr){
					curr=0;
					pos++;
				}
			}
			
			cout<<n+pos<<endl;
		}
		
		rep(x,0,n){
			rep(y,0,m) cout<<grid[x][y];	
			cout<<endl;
		}
	}
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 1552 KB Output is correct
2 Correct 33 ms 2040 KB Output is correct
3 Correct 29 ms 2168 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 1528 KB Output is correct
2 Correct 28 ms 1844 KB Output is correct
3 Correct 26 ms 1664 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 40 ms 1552 KB Output is correct
6 Correct 33 ms 2040 KB Output is correct
7 Correct 29 ms 2168 KB Output is correct
8 Correct 34 ms 1528 KB Output is correct
9 Correct 28 ms 1844 KB Output is correct
10 Correct 26 ms 1664 KB Output is correct
11 Correct 9 ms 640 KB Output is correct
12 Correct 27 ms 1912 KB Output is correct
13 Correct 29 ms 2048 KB Output is correct
14 Correct 22 ms 1664 KB Output is correct
15 Correct 36 ms 2296 KB Output is correct
16 Correct 26 ms 2040 KB Output is correct
17 Correct 12 ms 1408 KB Output is correct